Michael B. Dillencourt

Available identifiers

zbMath Open dillencourt.michael-bDBLPd/MBDillencourtWikidataQ102195465 ScholiaQ102195465MaRDI QIDQ803160

List of research outcomes

Publication	Date of Publication	Type
Simplified Chernoff bounds with powers-of-two probabilities	2023-06-05	Paper
A simple method for resolving degeneracies in Delaunay triangulations	2019-03-29	Paper
Triangulating with high connectivity.	2008-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q5458658	2008-04-16	Paper
Choosing Colors for Geometric Graphs Via Color Space Embeddings	2007-08-28	Paper
PODC: Paradigm-oriented distributed computing	2005-08-03	Paper
Distributed parallel computing using navigational programming	2004-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q4735993	2004-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q4417516	2003-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q2751906	2001-10-21	Paper
Geometric Thickness of Complete Graphs	2000-12-14	Paper
Distributed coordination with MESSENGERS	2000-02-15	Paper
Messages versus messengers in distributed programming	2000-01-25	Paper
Graph-theoretical conditions for inscribability and Delaunay realizability	1997-09-15	Paper
Polyhedra of small order and their Hamiltonian properties	1996-10-08	Paper
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete	1996-08-04	Paper
Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees	1996-01-28	Paper
A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA	1995-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q4763337	1995-04-11	Paper
A general approach to connected-component labeling for arbitrary image representations	1994-11-27	Paper
Compressing quadtrees via common subtree merging	1994-10-30	Paper
A general approach to connected-component labeling for arbitrary image representations	1994-09-29	Paper
On the toughness index of planar graphs	1994-05-30	Paper
A RANDOMIZED ALGORITHM FOR SLOPE SELECTION	1993-01-16	Paper
An upper bound on the shortness exponent of 1-tough, maximal planar graphs	1991-01-01	Paper
Toughness and Delaunay triangulations	1990-01-01	Paper
Realizability of Delaunay triangulations	1990-01-01	Paper
Hamiltonian cycles in planar triangulations with no separating triangles	1990-01-01	Paper
An upper bound on the shortness exponent of inscribable polytopes	1989-01-01	Paper
Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations	1987-01-01	Paper
A non-Hamiltonian, nondegenerate Delaunay triangulation	1987-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael B. Dillencourt