The following pages link to Michael B. Dillencourt (Q803160):
Displaying 32 items.
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations (Q1095812) (← links)
- A non-Hamiltonian, nondegenerate Delaunay triangulation (Q1108041) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
- Messages versus messengers in distributed programming (Q1291015) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Distributed coordination with MESSENGERS (Q1818365) (← links)
- Distributed parallel computing using navigational programming (Q1878901) (← links)
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees (Q1907033) (← links)
- Polyhedra of small order and their Hamiltonian properties (Q1907113) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- PODC: Paradigm-oriented distributed computing (Q2485158) (← links)
- Superboundary exchange: A technique for reducing communication in distributed implementations of iterative computations (Q2751906) (← links)
- Choosing Colors for Geometric Graphs Via Color Space Embeddings (Q3595461) (← links)
- Hamiltonian cycles in planar triangulations with no separating triangles (Q4206767) (← links)
- On the toughness index of planar graphs (Q4277991) (← links)
- A general approach to connected-component labeling for arbitrary image representations (Q4302798) (← links)
- A general approach to connected-component labeling for arbitrary image representations (Q4302810) (← links)
- Compressing quadtrees via common subtree merging (Q4310392) (← links)
- (Q4417516) (← links)
- Geometric Thickness of Complete Graphs (Q4511256) (← links)
- A simple method for resolving degeneracies in Delaunay triangulations (Q4630259) (← links)
- A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA (Q4698350) (← links)
- (Q4735993) (← links)
- (Q4763337) (← links)
- (Q5458658) (← links)
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION (Q5966682) (← links)
- Simplified Chernoff bounds with powers-of-two probabilities (Q6161458) (← links)
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses (Q6602327) (← links)
