| Capturing Lombardi Flow In Orthogonal Drawings By Minimizing The Number Of Segments | 0 | 0.34 | 2016 |
| Distributed power flow loss minimization control for future grid | 2 | 0.41 | 2015 |
| Distributed flow optimization control for energy-harvesting wireless sensor networks | 0 | 0.34 | 2014 |
| Distributed Real-Time Power Flow control with renewable integration | 2 | 0.45 | 2013 |
| Incremental Parallelization with Migration | 0 | 0.34 | 2012 |
| Distributed Individual-Based Simulation | 1 | 0.78 | 2009 |
| Toward Automatic Data Distribution for Migrating Computations | 3 | 0.39 | 2007 |
| Toward Incremental Parallelization Using Navigational Programming*The authors gratefully acknowledge the support of a U.S. Department of Education GAANN Fellowship. | 0 | 0.34 | 2006 |
| Choosing colors for geometric graphs via color space embeddings | 5 | 0.55 | 2006 |
| Toward Incremental Parallelization Using Navigational Programming | 0 | 0.34 | 2006 |
| PODC: Paradigm-oriented distributed computing | 4 | 0.67 | 2005 |
| Mobile pipelines: parallelizing left-looking algorithms using navigational programming | 2 | 0.39 | 2005 |
| Distributed parallel computing using navigational programming | 7 | 0.51 | 2004 |
| GIDM: globally-indexed distributed memory | 0 | 0.34 | 2003 |
| Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data | 2 | 0.85 | 2002 |
| Iterative grid-based computing using mobile agents | 11 | 0.87 | 2002 |
| Mobile Agents - The Right Vehicle for Distributed Sequential Computing | 6 | 0.55 | 2002 |
| Fast File Access for Fast Agents | 6 | 0.83 | 2001 |
| Distributed Sequential Numerical Computing Using Mobile Agents: Moving Code to Data | 2 | 0.40 | 2001 |
| Messengers: Distributed Programming Using Mobile Agents | 9 | 0.61 | 2001 |
| Paradigm-Oriented Distributed Computing Using Mobile Agents | 7 | 0.79 | 2000 |
| Process Interconnection Structures in Dynamically Changing Topologies | 1 | 0.46 | 2000 |
| Compiling for Fast State Capture of Mobile Agents | 3 | 0.56 | 1999 |
| An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels | 5 | 0.51 | 1999 |
| Distributed coordination with MESSENGERS | 10 | 1.43 | 1998 |
| Automatic State Capture of Self-Migrating Computations in MESSENGERS | 13 | 1.37 | 1998 |
| Performance of the MESSENGERS Autonomous-Objects-Based System | 3 | 0.51 | 1997 |
| Messages versus messengers in distributed programming | 15 | 1.02 | 1997 |
| Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees. | 3 | 0.42 | 1996 |
| Polyhedra of small order and their Hamiltonian properties | 8 | 2.46 | 1996 |
| Finding Hamiltonian cycles in Delaunay triangulations is NP-complete | 15 | 1.49 | 1996 |
| Distributed Computing Using Autonomous Objects | 42 | 5.39 | 1996 |
| Intra- and Inter-Object Coordination with MESSENGERS | 7 | 2.01 | 1996 |
| A linear-time algorithm for testing the inscribability of trivalent polyhedra | 9 | 1.48 | 1995 |
| Graph-theoretical conditions for inscribability and Delaunay realizability | 17 | 1.08 | 1994 |
| Triangulating with high connectivity | 7 | 0.72 | 1994 |
| On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions | 1 | 0.63 | 1993 |
| A Simple Method for Resolving Degeneracies in Delaunay Triangulations | 4 | 0.55 | 1993 |
| A general approach to connected-component labeling for arbitrary image representations | 154 | 10.63 | 1992 |
| Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms. | 3 | 0.51 | 1992 |
| A Randomized Algorithm For Slope Selection | 32 | 2.11 | 1992 |
| Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations | 0 | 0.34 | 1992 |
| An upper bound on the shortness exponent of 1-tough, maximal planar graphs | 11 | 1.41 | 1991 |
| Realizability of Delaunay triangulations | 28 | 1.82 | 1990 |
| An upper bound on the shortness exponent of inscribable polytopes | 2 | 0.62 | 1989 |
| Compressing Quadtrees Via Common Subtree Merging | 4 | 0.47 | 1989 |
| Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations | 8 | 2.06 | 1987 |
| A non-Hamiltonian, nondegenerate Delaunay Triangulation | 24 | 4.46 | 1987 |
