| Paper title | Citations |
|---|
| ℓ1-embeddability of 2-dimensional ℓ1-rigid periodic graphs | 1 |
| bichromatic point-set embeddings of trees with fewer bends | 0 |
| linear layouts of weakly triangulated graphs | 9 |
| on minimum average stretch spanning trees in polygonal 2-trees | 3 |
| quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods | 2 |
| complexity of disjoint π-vertex deletion for disconnected forbidden subgraphs | 1 |
| collapsing exact arithmetic hierarchies | 0 |
| alignment with non-overlapping inversions on two strings | 9 |
| editing the simplest graphs | 17 |
| results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio | 0 |
| efficient algorithms for sorting k-sets in bins | 1 |
| on dilworth k graphs and their pairwise compatibility | 2 |
| on some np-complete sefe problems | 7 |
| i/o efficient algorithms for the minimum cut problem on unweighted undirected graphs | 1 |
| some extensions of the bottleneck paths problem | 4 |
| some results on point visibility graphs | 19 |
| algorithm and hardness results for outer-connected dominating set in graphs | 11 |
| on a class of covering problems with variable capacities in wireless networks | 3 |
| minimax regret sink location problem in dynamic tree networks with uniform capacity | 27 |
| the g-packing with t-overlap problem | 10 |
| optimal serial broadcast of successive chunks | 11 |
| sahn clustering in arbitrary metric spaces using heuristic nearest neighbor search | 6 |
| simple linear comparison of strings in v-order | 5 |
| a (k1)-approximation robust network flow algorithm and a tighter heuristic method using iterative multiroute flow | 6 |
| approximating the bipartite tsp and its biased generalization | 10 |
| boundary labeling with flexible label positions | 13 |
| on generalized planar skyline and convex hull range queries | 2 |
| top-k manhattan spatial skyline queries | 9 |
| generalized class cover problem with axis-parallel strips | 3 |
| the happy end theorem and related results | 0 |
| in as few comparisons as possible | 0 |
| algorithms for equilibrium prices in linear market models | 0 |
| Total | 192 |