| Publication | Date of Publication | Type |
|---|
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
Information Processing Letters | 2024-09-11 | Paper |
Simplified Chernoff bounds with powers-of-two probabilities
Information Processing Letters | 2023-06-05 | Paper |
A simple method for resolving degeneracies in Delaunay triangulations
Automata, Languages and Programming | 2019-03-29 | Paper |
Triangulating with high connectivity.
Computational Geometry | 2008-04-25 | Paper |
| scientific article; zbMATH DE number 5264898 (Why is no real title available?) | 2008-04-16 | Paper |
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph Drawing | 2007-08-28 | Paper |
PODC: Paradigm-oriented distributed computing
Journal of Parallel and Distributed Computing | 2005-08-03 | Paper |
Distributed parallel computing using navigational programming
International Journal of Parallel Programming | 2004-09-09 | Paper |
| scientific article; zbMATH DE number 2084807 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 1955863 (Why is no real title available?) | 2003-07-29 | Paper |
| Superboundary exchange: A technique for reducing communication in distributed implementations of iterative computations | 2001-10-21 | Paper |
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Distributed coordination with MESSENGERS
Science of Computer Programming | 2000-02-15 | Paper |
Messages versus messengers in distributed programming
Journal of Parallel and Distributed Computing | 2000-01-25 | Paper |
Graph-theoretical conditions for inscribability and Delaunay realizability
Discrete Mathematics | 1997-09-15 | Paper |
Polyhedra of small order and their Hamiltonian properties
Journal of Combinatorial Theory. Series B | 1996-10-08 | Paper |
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
Discrete Applied Mathematics | 1996-08-04 | Paper |
Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
Algorithmica | 1996-01-28 | Paper |
A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA
International Journal of Computational Geometry & Applications | 1995-05-17 | Paper |
| scientific article; zbMATH DE number 742899 (Why is no real title available?) | 1995-04-11 | Paper |
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM | 1994-11-27 | Paper |
Compressing quadtrees via common subtree merging
Pattern Recognition Letters | 1994-10-30 | Paper |
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM | 1994-09-29 | Paper |
On the toughness index of planar graphs
Journal of Graph Theory | 1994-05-30 | Paper |
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
An upper bound on the shortness exponent of 1-tough, maximal planar graphs
Discrete Mathematics | 1991-01-01 | Paper |
Realizability of Delaunay triangulations
Information Processing Letters | 1990-01-01 | Paper |
Toughness and Delaunay triangulations
Discrete & Computational Geometry | 1990-01-01 | Paper |
Hamiltonian cycles in planar triangulations with no separating triangles
Journal of Graph Theory | 1990-01-01 | Paper |
An upper bound on the shortness exponent of inscribable polytopes
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
Information Processing Letters | 1987-01-01 | Paper |
A non-Hamiltonian, nondegenerate Delaunay triangulation
Information Processing Letters | 1987-01-01 | Paper |
