| 2026 | ESA | Bicriteria Polygon Aggregation with Arbitrary Shapes. | Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman J. Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann, Jonas Sauer |
| 2025 | ESA | Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. | David Eppstein, Michael T. Goodrich, Songyu Liu |
| 2025 | GD | Visualizing Treewidth. | Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nllenburg |
| 2025 | GD | String Graph Obstacles of High Girth and of Bounded Degree. | Maria Chudnovsky, David Eppstein, David Fischer |
| 2025 | GD | Stabbing Faces by a Convex Curve. | David Eppstein |
| 2025 | WADS | Computational Geometry with Probabilistically Noisy Primitive Operations. | David Eppstein, Michael T. Goodrich, Vinesh Sridhar |
| 2024 | GD | Noncrossing Longest Paths and Cycles. | Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tth, Pavel Valtr |
| 2024 | GD | Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bzier Curves with Bounded Curvature. | David Eppstein, Michael T. Goodrich, Abraham M. Illickan |
| 2023 | GD | Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. | Alvin Chiu, David Eppstein, Michael T. Goodrich |
| 2023 | GD | On the Biplanarity of Blowups. | David Eppstein |
| 2023 | ICALP | Improved Mixing for the Convex Polygon Triangulation Flip Walk. | David Eppstein, Daniel Frishberg |
| 2023 | ISAAC | Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. | David Eppstein, Daniel Frishberg |
| 2023 | WADS | Lower Bounds for Non-adaptive Shortest Path Relaxation. | David Eppstein |
| 2022 | SPAA | Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. | David Eppstein, Hadi Khodabandeh |
| 2021 | FCT | Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. | David Eppstein, Siddharth Gupta, Elham Havvaei |
| 2021 | FUN | On the Treewidth of Hanoi Graphs. | David Eppstein, Daniel Frishberg, William Maxwell |
| 2021 | GD | Limitations on Realistic Hyperbolic Graph Drawing. | David Eppstein |
| 2021 | WADS | A Stronger Lower Bound on Parametric Minimum Spanning Trees. | David Eppstein |
| 2021 | WG | The Graphs of Stably Matchable Pairs. | David Eppstein |
| 2019 | GD | Homotopy Height, Grid-Major Height and Graph-Drawing Height. | Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders |
| 2019 | ISAAC | Tracking Paths in Planar Graphs. | David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias |
| 2019 | ISAAC | New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. | Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk |
| 2019 | SODA | Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time. | David Eppstein, Bruce A. Reed |
| 2019 | SPAA | NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. | David Eppstein, Vijay V. Vazirani |
| 2019 | WADS | Reconfiguring Undirected Paths. | Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno |
| 2018 | ALENEX | Grid peeling and the affine curve-shortening flow. | David Eppstein, Sariel Har-Peled, Gabriel Nivasch |
| 2018 | ALENEX | Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | COCOON | Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. | Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow |
| 2018 | FUN | Faster Evaluation of Subtraction Games. | David Eppstein |
| 2018 | FUN | Making Change in 2048. | David Eppstein |
| 2018 | GD | Realization and Connectivity of the Graphs of Origami Flat Foldings. | David Eppstein |
| 2018 | ICALP | Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. | Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2018 | ICALP | Optimally Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | LATIN | Reactive Proximity Data Structures for Graphs. | David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2018 | WG | Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. | Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta |
| 2017 | GD | Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. | David Eppstein |
| 2017 | GD | The Effect of Planarization on Width. | David Eppstein |
| 2017 | ISAAC | Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. | Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson |
| 2017 | IWCIA | Algorithms for Stable Matching and Clustering in a Grid. | David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2017 | PODS | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. | David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres |
| 2017 | SPAA | Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. | David Eppstein, Michael T. Goodrich |
| 2017 | WADS | Maximum Plane Trees in Multipartite Geometric Graphs. | Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid |
| 2016 | ATMOS | Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich |
| 2016 | GD | Track Layout Is Hard. | Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood |
| 2016 | LATIN | From Discrepancy to Majority. | David Eppstein, Daniel S. Hirschberg |
| 2016 | LATIN | On the Planar Split Thickness of Graphs. | David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath |
| 2016 | SODA | Treetopes and their Graphs. | David Eppstein |
| 2015 | GD | Confluent Orthogonal Drawings of Syntax Diagrams. | Michael J. Bannister, David A. Brown, David Eppstein |
| 2015 | GD | Genus, Treewidth, and Local Crossing Number. | Vida Dujmovic, David Eppstein, David R. Wood |
| 2015 | SODA | Minimum Forcing Sets for Miura Folding Patterns. | Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull |
| 2015 | WADS | Contact Graphs of Circular Arcs. | Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Andr Schulz, Torsten Ueckerdt |
| 2015 | WADS | The Parametric Closure Problem. | David Eppstein |
| 2015 | WADS | Rooted Cycle Bases. | David Eppstein, J. Michael McCarthy, Brian E. Parrish |
| 2015 | WALCOM | Folding a Paper Strip to Minimize Thickness. | Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno |
| 2014 | GD | Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. | Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara |
| 2014 | GD | Balanced Circle Packings for Planar Graphs. | Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev |
| 2014 | GD | The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. | Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich |
| 2014 | GD | Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. | Michael J. Bannister, David Eppstein |
| 2014 | GD | Planar Induced Subgraphs of Sparse Graphs. | Glencora Borradaile, David Eppstein, Pingan Zhu |
| 2014 | ISAAC | Linear-Time Algorithms for Proportional Apportionment. | Zhanpeng Cheng, David Eppstein |
| 2013 | GD | Superpatterns and Universal Point Sets. | Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein |
| 2013 | GD | Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. | Michael J. Bannister, David Eppstein, Joseph A. Simons |
| 2013 | GD | Drawing Arrangement Graphs in Small Grids, or How to Play Planarity. | David Eppstein |
| 2013 | GD | Strict Confluent Drawing. | David Eppstein, Danny Holten, Maarten Lffler, Martin Nllenburg, Bettina Speckmann, Kevin Verbeek |
| 2013 | SODA | Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. | Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth |
| 2013 | WADS | Parameterized Complexity of 1-Planarity. | Michael J. Bannister, Sergio Cabello, David Eppstein |
| 2013 | WADS | Combinatorial Pair Testing: Distinguishing Workers from Slackers. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2012 | FUN | Solving Single-Digit Sudoku Subproblems. | David Eppstein |
| 2012 | GD | Force-Directed Graph Drawing Using Social Gravity and Scaling. | Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott |
| 2012 | GD | On the Density of Maximal 1-Planar Graphs. | Franz-Josef Brandenburg, David Eppstein, Andreas Gleiner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber |
| 2012 | GD | Planar Lombardi Drawings for Subcubic Graphs. | David Eppstein |
| 2012 | IROS | UOBPRM: A uniformly distributed obstacle-based PRM. | Hsin-Yi Yeh, Shawna L. Thomas, David Eppstein, Nancy M. Amato |
| 2011 | GD | Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. | Michael J. Bannister, David Eppstein |
| 2011 | GD | Planar and Poly-arc Lombardi Drawings. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Lffler |
| 2011 | GD | Confluent Hasse Diagrams. | David Eppstein, Joseph A. Simons |
| 2011 | SIGCOMM | What's the difference?: efficient set reconciliation without prior context. | David Eppstein, Michael T. Goodrich, Frank C. Uyeda, George Varghese |
| 2011 | WADS | Adjacency-Preserving Spatial Treemaps. | Kevin Buchin, David Eppstein, Maarten Lffler, Martin Nllenburg, Rodrigo I. Silveira |
| 2011 | WADS | Tracking Moving Objects with Few Handovers. | David Eppstein, Michael T. Goodrich, Maarten Lffler |
| 2010 | COCOA | Extended Dynamic Subgraph Statistics Using | David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott |
| 2010 | COCOON | Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. | John Augustine, David Eppstein, Kevin A. Wortman |
| 2010 | ESA | Cloning Voronoi Diagrams via Retroactive Data Structures. | Matthew T. Dickerson, David Eppstein, Michael T. Goodrich |
| 2010 | GD | Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. | Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Lffler |
| 2010 | GD | Drawing Trees with Perfect Angular Resolution and Polynomial Area. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nllenburg |
| 2010 | GD | Lombardi Drawings of Graphs. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nllenburg |
| 2010 | GD | Optimal 3D Angular Resolution for Low-Degree Graphs. | David Eppstein, Maarten Lffler, Elena Mumford, Martin Nllenburg |
| 2010 | ISAAC | Flows in One-Crossing-Minor-Free Graphs. | Erin W. Chambers, David Eppstein |
| 2010 | ISAAC | Regular Labelings and Geometric Structures. | David Eppstein |
| 2010 | ISAAC | Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. | David Eppstein, Maarten Lffler, Darren Strash |
| 2010 | SODA | Paired Approximation Problems and Incompatible Inapproximabilities. | David Eppstein |
| 2009 | SODA | Linear-time algorithms for geometric graphs with sublinearly many crossings. | David Eppstein, Michael T. Goodrich, Darren Strash |
| 2009 | SODA | Self-overlapping curves revisited. | David Eppstein, Elena Mumford |
| 2009 | WADS | On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker |
| 2009 | WADS | Orientation-Constrained Rectangular Layouts. | David Eppstein, Elena Mumford |
| 2009 | WADS | The | David Eppstein, Emma S. Spiro |
| 2009 | WADS | Optimal Embedding into Star Metrics. | David Eppstein, Kevin A. Wortman |
| 2009 | WG | Graph-Theoretic Solutions to Computational Geometry Problems. | David Eppstein |
| 2008 | ESA | Straight Skeletons of Three-Dimensional Polyhedra. | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman |
| 2008 | GD | The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. | David Eppstein |
| 2008 | GD | Isometric Diamond Subgraphs. | David Eppstein |
| 2008 | GD | Succinct Greedy Graph Drawing in the Hyperbolic Plane. | David Eppstein, Michael T. Goodrich |
| 2008 | SODA | Recognizing partial cubes in quadratic time. | David Eppstein |
| 2007 | SODA | Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. | David Eppstein |
| 2007 | WADS | Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. | David Eppstein, Michael T. Goodrich |
| 2007 | WADS | Edges and Switches, Tunnels and Bridges. | David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann |
| 2006 | GD | Trees with Convex Faces and Optimal Angles. | Josiah Carlson, David Eppstein |
| 2006 | GD | Choosing Colors for Geometric Graphs Via Color Space Embeddings. | Michael B. Dillencourt, David Eppstein, Michael T. Goodrich |
| 2006 | GD | Upright-Quad Drawing of | David Eppstein |
| 2005 | GD | Delta-Confluent Drawings. | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng |
| 2005 | PODC | Skip-webs: efficient distributed data structures for multi-dimensional data sets. | Lars Arge, David Eppstein, Michael T. Goodrich |
| 2005 | SODA | All maximal independent sets and dynamic dominance for sparse graphs. | David Eppstein |
| 2005 | WADS | Improved Combinatorial Group Testing for Real-World Problem Sizes. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2004 | ALENEX | Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. | Jean Cardinal, David Eppstein |
| 2004 | GD | Algorithms for Drawing Media. | David Eppstein |
| 2004 | GD | Confluent Layered Drawings. | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng |
| 2004 | SODA | Quasiconvex analysis of backtracking algorithms. | David Eppstein |
| 2004 | SODA | Testing bipartiteness of geometric intersection graphs. | David Eppstein |
| 2004 | SPAA | The effect of faults on network expansion. | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler |
| 2003 | GD | Selected Open Problems in Graph Drawing. | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel |
| 2003 | GD | Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. | Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng |
| 2003 | SODA | Mbius-invariant natural neighbor interpolation. | Marshall W. Bern, David Eppstein |
| 2003 | SODA | Dynamic generators of topologically embedded graphs. | David Eppstein |
| 2003 | WADS | The Traveling Salesman Problem for Cubic Graphs. | David Eppstein |
| 2002 | GD | Separating Thickness from Geometric Thickness. | David Eppstein |
| 2002 | WWW | A Steady State Model for Graph Power Law. | David Eppstein, Joseph Wang |
| 2001 | SODA | Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. | David Eppstein |
| 2001 | SODA | Internet packet filter management and rectangle geometry. | David Eppstein, S. Muthukrishnan |
| 2001 | SODA | Fast approximation of centrality. | David Eppstein, Joseph Wang |
| 2001 | WADS | Optimal Mbius Transformations for Information Visualization and Meshing. | Marshall W. Bern, David Eppstein |
| 2001 | WADS | Optimization over Zonotopes and Training Support Vector Machines. | Marshall W. Bern, David Eppstein |
| 2001 | WADS | Small Maximal Independent Sets and Faster Exact Graph Coloring. | David Eppstein |
| 1999 | FOCS | Setting Parameters by Example. | David Eppstein |
| 1999 | SODA | Incremental and Decremental Maintenance of Planar Width. | David Eppstein |
| 1999 | SODA | Shortest Paths in an Arrangement with | David Eppstein, David Hart |
| 1998 | FOCS | Parametric and Kinetic Minimum Spanning Trees. | Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger |
| 1998 | GD | Geometric Thickness of Complete Graphs. | Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg |
| 1998 | SODA | Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. | David Eppstein |
| 1997 | SODA | Optimal Point Placement for Mesh Smoothing. | Nina Amenta, Marshall W. Bern, David Eppstein |
| 1997 | SODA | Faster Construction of Planar Two-Centers. | David Eppstein |
| 1997 | WADS | An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. | David Eppstein, David Hart |
| 1995 | ESA | The Centroid of Points with Approximate Weights. | Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter |
| 1995 | FOCS | 3-Coloring in Time O(1.3446 | Richard Beigel, David Eppstein |
| 1995 | SODA | Dihedral Bounds for Mesh Generation in High Dimensions. | Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert |
| 1995 | SODA | Subgraph Isomorphism in Planar Graphs and Related Problems. | David Eppstein |
| 1995 | STOC | Geometric lower bounds for parametric matroid optimization. | David Eppstein |
| 1994 | FOCS | Finding the k Shortest Paths | David Eppstein |
| 1994 | SODA | Average Case Analysis of Dynamic Geometric Optimization. | David Eppstein |
| 1994 | SODA | Clustering for Faster Network Simplex Pivots. | David Eppstein |
| 1993 | SODA | Iterated Nearest Neighbors and Finding Minimal Polytopes. | David Eppstein, Jeff Erickson |
| 1993 | STOC | Separator based sparsification for dynamic planar graph algorithms. | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer |
| 1993 | WADS | Parallel Construction of Quadtrees and Quality Triangulations. | Marshall W. Bern, David Eppstein, Shang-Hua Teng |
| 1992 | FOCS | Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees | Pankaj K. Agarwal, David Eppstein, Jir Matousek |
| 1992 | FOCS | Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig |
| 1992 | LATIN | Edge Insertion for Optional Triangulations. | Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan |
| 1992 | SODA | Approximating the Minimum Weight Triangulation. | David Eppstein |
| 1992 | SODA | New Algorithms for Minimum Area | David Eppstein |
| 1991 | FOCS | Dynamic Three-Dimensional Linear Programming | David Eppstein |
| 1991 | ICALP | The Expected Extremes in a Delaunay Triangulation. | Marshall W. Bern, David Eppstein, F. Frances Yao |
| 1991 | SODA | Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. | Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung |
| 1991 | WADS | Offline Algorithms for Dynamic Minimum Spanning Tree Problems. | David Eppstein |
| 1990 | FOCS | Provably Good Mesh Generation | Marshall W. Bern, David Eppstein, John R. Gilbert |
| 1990 | SODA | Visibility with a Moving Point of View. | Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman |
| 1990 | SODA | Sparse Dynamic Programming. | David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano |
| 1990 | SODA | Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. | David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung |
| 1989 | ICALP | Parallel Algorithmic Techniques for Combinatorial Computation. | David Eppstein, Zvi Galil |
| 1988 | FOCS | Speeding up Dynamic Programming | David Eppstein, Zvi Galil, Raffaele Giancarlo |
| 1988 | ICALP | Reset Sequences for Finite Automata with Application to Design of Parts Orienters. | David Eppstein |
| 1985 | IJCAI | A Heuristic Approach to Program Inversion. | David Eppstein |