Michael B. Dillencourt

Generating author description...

All published works

Action	Title	Year	Authors
+	Leveraging parameterized Chernoff bounds for simplified algorithm analyses	2024	Michael B. Dillencourt Michael T. Goodrich Michael Mitzenmacher
+	Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments	2016	Md. Jawaherul Alam Michael B. Dillencourt Michael T. Goodrich
+	Improving numerical accuracy for non-negative matrix multiplication on GPUs using recursive algorithms	2013	Matthew Badin Paolo D’Alberto Lubomir Bic Michael B. Dillencourt Alexandru Nicolau
+	Methods for mitigating and eliminating error in hybrid matrix multiply algorithms	2013	Michael B. Dillencourt Matthew Badin
+	Choosing Colors for Geometric Graphs via Color Space Embeddings	2006	Michael B. Dillencourt David Eppstein Michael T. Goodrich
+	Geometric Thickness of Complete Graphs	2000	Michael B. Dillencourt David Eppstein Daniel S. Hirschberg
+	Geometric Thickness of Complete Graphs	1999	Michael B. Dillencourt David Eppstein Daniel S. Hirschberg
+	On the toughness index of planar graphs	1994	Michael B. Dillencourt
+	A RANDOMIZED ALGORITHM FOR SLOPE SELECTION	1992	Michael B. Dillencourt David M. Mount Nathan S. Netanyahu
+	An upper bound on the shortness exponent of 1-tough, maximal planar graphs	1991	Michael B. Dillencourt

Common Coauthors

Coauthor	Papers Together
David Eppstein	3
Michael T. Goodrich	3
Matthew Badin	2
Daniel S. Hirschberg	2
Md. Jawaherul Alam	1
Alexandru Nicolau	1
Lubomir Bic	1
Michael Mitzenmacher	1
Nathan S. Netanyahu	1
Paolo D’Alberto	1
David M. Mount	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Recognizing tough graphs is NP-hard	1990	Douglas C. Bauer S. L. Hakimi E. F. Schmeichel	2
+ PDF Chat	On the Number of Crossings in a Complete Graph	1963	Frank Harary Anthony Hill	2
+	Tough graphs and hamiltonian circuits	1973	Vašek Chvátal	2
+	On the thickness and arboricity of a graph	1991	Alice M. Dean Joan P. Hutchinson Edward R. Scheinerman	2
+	Biplanar Graphs:	1997	Lowell W. Beineke	2
+ PDF Chat	Some provably hard crossing number problems	1991	Daniel Bienstock	2
+	The book thickness of a graph	1979	Frank R. Bernhart Paul C. Kainen	2
+ PDF Chat	Simple paths on polyhedra	1963	J. W. Moon Leo Moser	1
+	A guided tour of chernoff bounds	1990	Torben Hagerup Christine Rüb	1
+	On multiplication of 2 × 2 matrices	1971	S. Winograd	1
+ PDF Chat	Relative distance—an error measure in round-off error analysis	1982	Abraham Ziv	1
+	The height of a random binary search tree	2003	Bruce Reed	1
+ PDF Chat	Algorithms for Coloring Quadtrees	2002	Eppstein Bern Hutchings	1
+	Calculus and Analytical Geometry	1990	C. H. Edwards	1
+ PDF Chat	Smooth Orthogonal Drawings of Planar Graphs	2014	Muhammad Jawaherul Alam Michael A. Bekos Michael Kaufmann Philipp Kindermann Stephen Kobourov Alexander Wolff	1
+ PDF Chat	Efficient computation of tight approximations to Chernoff bounds	2022	Daniel Shiu	1
+ PDF Chat	On Floyd and Rivest's SELECT algorithm	2005	Krzysztof C. Kiwiel	1
+	An overview of the theory of large deviations and applications to statistical mechanics	1995	Richard S. Ellis	1
+	Estimation of the transition matrix of a discrete‐time Markov chain	2002	Bruce Α. Craig Peter P. Sendi	1
+	A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations	1952	Herman Chernoff	1
+	A 1-tough nonhamiltonian maximal planar graph	1980	Takao Nishizeki	1
+ PDF Chat	A note on the height of binary search trees	1986	Luc Devroye	1