| Paper title | Citations |
|---|
| object caching for queries and updates | 0 |
| shape matching by random sampling | 7 |
| the minimal manhattan network problem in three dimensions | 12 |
| the exemplar breakpoint distance for non-trivial genomes cannot be approximated | 42 |
| spherical-rectangular drawings | 1 |
| an improved upward planarity testing algorithm and related applications | 1 |
| matched drawability of graph pairs and of graph triples | 2 |
| straight-line grid drawings of label-constrained outerplanar graphs with o(n logn) area (extended abstract) | 2 |
| parameterized complexity of stabbing rectangles and squares in the plane | 15 |
| on the computational complexity of monotone constraint satisfaction problems | 9 |
| the planar k-means problem is np-hard | 420 |
| core and conditional core path of specified length in special classes of graphs | 2 |
| crossing-optimal acyclic hamiltonian path completion and its application to upward topological book embeddings | 11 |
| the generalized stable allocation problem | 4 |
| minimum cuts of simple graphs in almost always linear time | 0 |
| network design with weighted degree constraints | 6 |
| minmax tree cover in the euclidean space | 7 |
| a fully dynamic graph algorithm for recognizing proper interval graphs | 10 |
| random generation and enumeration of proper interval graphs | 13 |
| recognition of unigraphs through superposition of graphs (extended abstract) | 15 |
| generating all triangulations of plane graphs (extended abstract) | 4 |
| efficient enumeration of ordered trees with k leaves (extended abstract) | 9 |
| recursive generation of 5-regular planar graphs | 4 |
| colinear coloring on graphs | 2 |
| on exact solutions to the euclidean bottleneck steiner tree problem | 30 |
| maximum neighbour voronoi games | 4 |
| improved algorithm for a widest 1-corner corridor | 1 |
| all farthest neighbors in the presence of highways and obstacles | 13 |
| shortest gently descending paths | 7 |
| algorithms for computing diffuse reflection paths in polygons | 2 |
| line transversals and pinning numbers | 0 |
| approximating shortest paths in graphs | 13 |
| foundations of exact rounding | 7 |
| a separator theorem for string graphs and its applications | 55 |
| Total | 730 |