Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. - Michael B. Dillencourt (Inf. Process. Lett., 1987)

A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. - Michael B. Dillencourt (Inf. Process. Lett., 1987)

An upper bound on the shortness exponent of inscribable polytopes. - Michael B. Dillencourt (J. Comb. Theory B, 1989)

Compressing quadtrees via common subtree merging. - Robert E. Webber; Michael B. Dillencourt (Pattern Recognit. Lett., 1989)

Toughness and Delaunay Triangulations. - Michael B. Dillencourt (Discret. Comput. Geom., 1990)

Realizability of Delaunay Triangulations. - Michael B. Dillencourt (Inf. Process. Lett., 1990)

Hamiltonian cycles in planar triangulations with no separating triangles. - Michael B. Dillencourt (J. Graph Theory, 1990)

An upper bound on the shortness exponent of 1-tough, maximal planar graphs. - Michael B. Dillencourt (Discret. Math., 1991)

Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms. - Vitus J. Leung; Michael B. Dillencourt; Andrew L. Bliss (Computational Support for Discrete Mathematics, 1992)

A randomized algorithm for slope selection. - Michael B. Dillencourt; David M. Mount; Nathan S. Netanyahu (Int. J. Comput. Geom. Appl., 1992)

A General Approach to Connected-Component Labelling for Arbitrary Image Representations. - Michael B. Dillencourt; Hanan Samet; Markku Tamminen (J. ACM, 1992)

Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'. - Michael B. Dillencourt; Hanan Samet; Markku Tamminen (J. ACM, 1992)

On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. - Michael B. Dillencourt; David M. Mount; Alan Saalfeld (CCCG, 1993)

A Simple Method for Resolving Degeneracies in Delaunay Triangulations. - Michael B. Dillencourt; Warren D. Smith (ICALP, 1993)

Triangulating with High Connectivity. - Tamal K. Dey; Michael B. Dillencourt; Subir Kumar Ghosh (CCCG, 1994)

A linear-time algorithm for testing the inscribability of trivalent polyhedra. - Michael B. Dillencourt; Warren D. Smith (Int. J. Comput. Geom. Appl., 1995)

Intra- and Inter-Object Coordination with MESSENGERS. - Munehiro Fukuda; Lubomir Bic; Michael B. Dillencourt; Fehmina Merchant (COORDINATION, 1996)

Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. - Michael B. Dillencourt; Hanan Samet (Algorithmica, 1996)

Distributed Computing Using Autonomous Objects. - Lubomir Bic; Munehiro Fukuda; Michael B. Dillencourt (Computer, 1996)

Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. - Michael B. Dillencourt (Discret. Appl. Math., 1996)

Graph-theoretical conditions for inscribability and Delaunay realizability. - Michael B. Dillencourt; Warren D. Smith (Discret. Math., 1996)

Polyhedra of Small Order and Their Hamiltonian Properties. - Michael B. Dillencourt (J. Comb. Theory B, 1996)

A Hierarchical Mapping Scheme for Mobile Agent Systems. - Munehiro Fukuda; Lubomir Bic; Michael B. Dillencourt; Fehmina Merchant (FTDCS, 1997)

Messages versus Messengers in Distributed Programming. - Munehiro Fukuda; Lubomir Bic; Michael B. Dillencourt; Fehmina Merchant (ICDCS, 1997)

Performance of the MESSENGERS Autonomous-Objects-Based System. - Munehiro Fukuda; Lubomir Bic; Michael B. Dillencourt (WWCA, 1997)

Triangulating with High Connectivity. - Tamal K. Dey; Michael B. Dillencourt; Subir Kumar Ghosh; Jason M. Cahill (Comput. Geom., 1997)

Load Balancing in Individual-Based Spatial Applications. - Fehmina Merchant; Lubomir Bic; Michael B. Dillencourt (IEEE PACT, 1998)

Automatic State Capture of Self-Migrating Computations in MESSENGERS. - Christian Wicke; Lubomir Bic; Michael B. Dillencourt; Munehiro Fukuda (Mobile Agents, 1998)

Distributed Coordination with MESSENGERS. - Munehiro Fukuda; Lubomir Bic; Michael B. Dillencourt; Fehmina Merchant (Sci. Comput. Program., 1998)

PODC: Paradigm-Oriented Distributed Computing. - Hairong Kuang; Lubomir Bic; Michael B. Dillencourt; Adam C. Chang (FTDCS, 1999)

Compiling for fast state capture of mobile agents. - Christian Wicke; Lubomir F. Bic; Michael B. Dillencourt (PARCO, 1999)

An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels. - Eugene Gendelman; Lubomir Bic; Michael B. Dillencourt (SRDS, 1999)

Messages versus Messengers in Distributed Programming. - Munehiro Fukuda; Lubomir Bic; Michael B. Dillencourt; Jason M. Cahill (J. Parallel Distributed Comput., 1999)

Process Interconnection Structures in Dynamically Changing Topologies. - Eugene Gendelman; Lubomir Bic; Michael B. Dillencourt (HiPC, 2000)

An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems. - Eugene Gendelman; Lubomir Bic; Michael B. Dillencourt (ICDCS, 2000)

Paradigm-Oriented Distributed Computing using Mobile Agents. - Hairong Kuang; Lubomir Bic; Michael B. Dillencourt (ICDCS, 2000)

Geometric Thickness of Complete Graphs. - Michael B. Dillencourt; David Eppstein; Daniel S. Hirschberg (J. Graph Algorithms Appl., 2000)

Interest Management in Large-Scale Virtual Environments. - Katherine L. Morse; Lubomir Bic; Michael B. Dillencourt (Presence Teleoperators Virtual Environ., 2000)

Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data. - Lei Pan 001; Lubomir Bic; Michael B. Dillencourt (ICPP, 2001)

Fast File Access for Fast Agents. - Eugene Gendelman; Lubomir Bic; Michael B. Dillencourt (Mobile Agents, 2001)

Messengers: Distributed Programming using Mobile Agents. - Munehiro Fukuda; Lubomir F. Bic; Michael B. Dillencourt; Fehmina Merchant (Trans. SDPS, 2001)

Mobile Agents - The Right Vehicle for Distributed Sequential Computing. - Lei Pan 001; Lubomir Bic; Michael B. Dillencourt; Ming Kin Lai (HiPC, 2002)

Iterative Grid-Based Computing Using Mobile Agents. - Hairong Kuang; Lubomir Bic; Michael B. Dillencourt (ICPP, 2002)

Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data. - Lei Pan 001; Lubomir Bic; Michael B. Dillencourt; Javid J. Huseynov; Ming Kin Lai (IASTED PDCS, 2002)

GIDM: Globally-Indexed Distributed Memory. - Hairong Kuang; Lubomir Bic; Michael B. Dillencourt (FTDCS, 2003)

From Distributed Sequential Computing to Distributed Parallel Computing. - Lei Pan 001; Lubomir Bic; Michael B. Dillencourt; Ming Kin Lai (ICPP Workshops, 2003)

Distributed Parallel Computing Using Navigational Programming. - Lei Pan 001; Ming Kin Lai; Koji Noguchi; Javid J. Huseynov; Lubomir Bic; Michael B. Dillencourt (Int. J. Parallel Program., 2004)

Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming. - Lei Pan 001; Ming Kin Lai; Michael B. Dillencourt; Lubomir F. Bic (HiPC, 2005)

Incremental Parallelization Using Navigational Programming: A Case Study. - Lei Pan 001; Wenhui Zhang 001; Arthur U. Asuncion; Ming Kin Lai; Michael B. Dillencourt; Lubomir Bic (ICPP, 2005)

PODC: Paradigm-oriented distributed computing. - Hairong Kuang; Lubomir F. Bic; Michael B. Dillencourt (J. Parallel Distributed Comput., 2005)

Choosing Colors for Geometric Graphs Via Color Space Embeddings. - Michael B. Dillencourt; David Eppstein; Michael T. Goodrich (GD, 2006)

Toward Incremental Parallelization Using Navigational Programming. - Lei Pan 001; Wenhui Zhang 001; Arthur U. Asuncion; Ming Kin Lai; Michael B. Dillencourt; Lubomir F. Bic; Laurence Tianruo Yang (IEICE Trans. Inf. Syst., 2006)

Toward Automatic Data Distribution for Migrating Computations. - Lei Pan 001; Jingling Xue; Ming Kin Lai; Michael B. Dillencourt; Lubomir F. Bic (ICPP, 2007)

Efficient Global Pointers With Spontaneous Process Migration. - Koji Noguchi; Michael B. Dillencourt; Lubomir Bic (PDP, 2008)

Distributed Individual-Based Simulation. - Jiming Liu 002; Michael B. Dillencourt; Lubomir F. Bic; Daniel L. Gillen; Arthur D. Lander (Euro-Par, 2009)

Pretty Good Accuracy in Matrix Multiplication with GPUs. - Matthew Badin; Lubomir Bic; Michael B. Dillencourt; Alexandru Nicolau (ISPDC, 2010)

Improving the Accuracy of High Performance BLAS Implementations Using Adaptive Blocked Algorithms. - Matthew Badin; Paolo D'Alberto; Lubomir Bic; Michael B. Dillencourt; Alexandru Nicolau (SBAC-PAD, 2011)

Improving accuracy for matrix multiplications on GPUs. - Matthew Badin; Lubomir Bic; Michael B. Dillencourt; Alexandru Nicolau (Sci. Program., 2011)

Incremental Parallelization with Migration. - Wenhui Zhang 001; Lei Pan 001; Qinghong Shang; Lubomir F. Bic; Michael B. Dillencourt (ISPA, 2012)

Complete automation of future grid for optimal real-time distribution of renewables. - Kiyoshi Nakayama; Kyle E. Benson; Lubomir F. Bic; Michael B. Dillencourt (SmartGridComm, 2012)

Improving numerical accuracy for non-negative matrix multiplication on GPUs using recursive algorithms. - Matthew Badin; Paolo D'Alberto; Lubomir Bic; Michael B. Dillencourt; Alexandru Nicolau (ICS, 2013)

Tie-set Based Fault Tolerance for autonomous recovery of double-link failures. - Kiyoshi Nakayama; Kyle E. Benson; Vahe Avagyan; Michael B. Dillencourt; Lubomir F. Bic; Nalini Venkatasubramanian (ISCC, 2013)

Distributed Real-Time Power Flow control with renewable integration. - Kiyoshi Nakayama; Changhong Zhao; Lubomir F. Bic; Michael B. Dillencourt; Jack Brouwer (SmartGridComm, 2013)

Distributed flow optimization control for energy-harvesting wireless sensor networks. - Kiyoshi Nakayama; Nga Dang; Lubomir F. Bic; Michael B. Dillencourt; Elaheh Bozorgzadeh; Nalini Venkatasubramanian (ICC, 2014)

Distributed power flow loss minimization control for future grid. - Kiyoshi Nakayama; Changhong Zhao; Lubomir F. Bic; Michael B. Dillencourt; Jack Brouwer (Int. J. Circuit Theory Appl., 2015)

Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments. - Md. Jawaherul Alam; Michael B. Dillencourt; Michael T. Goodrich (CoRR, 2016)

Beyond big O: teaching experimental algorithmics. - Michael Shindler; Michael T. Goodrich; Ofek Gila; Michael B. Dillencourt (J. Comput. Sci. Coll., 2022)

Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. - Ramtin Afshar; Michael B. Dillencourt; Michael T. Goodrich; Evrim Ozel (SEA, 2023)

Simplified Chernoff bounds with powers-of-two probabilities. - Michael B. Dillencourt; Michael T. Goodrich (Inf. Process. Lett., 2023)

Leveraging parameterized Chernoff bounds for simplified algorithm analyses. - Michael B. Dillencourt; Michael T. Goodrich; Michael Mitzenmacher (Inf. Process. Lett., 2025)