| 2023 | FCT | Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. | William S. Evans, David G. Kirkpatrick |
| 2023 | WAOA | A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. | William S. Evans, David G. Kirkpatrick |
| 2021 | PODC | Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. | David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro |
| 2019 | ALT | Optimal Collusion-Free Teaching. | David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles |
| 2019 | SODA | Minimizing Interference Potential Among Moving Entities. | Daniel Busto, William S. Evans, David G. Kirkpatrick |
| 2017 | ALT | Preference-based Teaching of Unions of Geometric Objects. | Ziyuan Gao, David G. Kirkpatrick, Christoph Ries, Hans Ulrich Simon, Sandra Zilles |
| 2017 | DNA | Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. | Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Jn Manuch |
| 2017 | WALCOM | Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. | Toshiki Saitoh, David G. Kirkpatrick |
| 2015 | WADS | Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno |
| 2014 | MFCS | (√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. | Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe |
| 2013 | WADS | Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. | Tetsuo Asano, David G. Kirkpatrick |
| 2012 | Algosensors | Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. | David Yu Cheng Chan, David G. Kirkpatrick |
| 2012 | FUN | M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. | Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger |
| 2011 | Algosensors | On Barrier Resilience of Sensor Networks. | Kuan-Chieh Robert Tseng, David G. Kirkpatrick |
| 2011 | ESA | Can Nearest Neighbor Searching Be Simple and Always Fast? | Victor Alvarez, David G. Kirkpatrick, Raimund Seidel |
| 2011 | ISAAC | Input-Thrifty Extrema Testing. | Kuan-Chieh Robert Tseng, David G. Kirkpatrick |
| 2011 | WADS | Competitive Search in Symmetric Trees. | David G. Kirkpatrick, Sandra Zilles |
| 2009 | Algosensors | Approximating Barrier Resilience in Wireless Sensor Networks. | Sergey Bereg, David G. Kirkpatrick |
| 2009 | ESA | Hyperbolic Dovetailing. | David G. Kirkpatrick |
| 2008 | ICDCN | On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. | Stephane Durocher, David G. Kirkpatrick, Lata Narayanan |
| 2008 | ISAAC | A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. | Jonathan Backer, David G. Kirkpatrick |
| 2007 | SODA | Lower bounds on average-case delay for video-on-demand broadcast protocols. | Wei-Lung Dustin Tseng, David G. Kirkpatrick |
| 2004 | SODA | Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. | William S. Evans, David G. Kirkpatrick |
| 2002 | LATIN | On the Spanning Ratio of Gabriel Graphs and beta-skeletons. | Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick |
| 2000 | ESA | Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal |
| 2000 | SODA | Restructuring ordered binary trees. | William S. Evans, David G. Kirkpatrick |
| 1995 | GD | On the Complexity of Recognizing Intersection and Touching Graphs of Disks. | Heinz Breu, David G. Kirkpatrick |
| 1995 | WADS | Computing Common Tangents Without a Separating Line. | David G. Kirkpatrick, Jack Snoeyink |
| 1993 | FOCS | A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane | Michael McAllister, David G. Kirkpatrick, Jack Snoeyink |
| 1991 | WADS | Probabilistic Leader Election on Rings of Known Size. | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick |
| 1990 | ICALP | Determining the Separation of Preprocessed Polyhedra - A Unified Approach. | David P. Dobkin, David G. Kirkpatrick |
| 1990 | STOC | Quantitative Steinitz's Theorems with Applications to Multifingered Grasping | David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap |
| 1990 | SPAA | Parallel Construction of near Optimal binary Trees. | David G. Kirkpatrick, Teresa M. Przytycka |
| 1989 | WADS | Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). | David G. Kirkpatrick, Stephen K. Wismath |
| 1986 | PODC | Probabilistic Solitude Verification on a Ring. | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick |
| 1982 | ICALP | Fast Detection of Polyhedral Intersections. | David P. Dobkin, David G. Kirkpatrick |
| 1982 | PODS | Foundations for Multifile Design by Application Partitioning. | Doron Rotem, Frank Wm. Tompa, David G. Kirkpatrick |
| 1981 | WG | The Shape of a Set of Points in the Plane. | Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel |
| 1979 | FOCS | A Time-Space Tradeoff for Sorting on Non-Oblivious Machines | Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa |
| 1979 | FOCS | Efficient Computation of Continuous Skeletons | David G. Kirkpatrick |
| 1978 | STOC | On the Completeness of a Generalized Matching Problem | David G. Kirkpatrick, Pavol Hell |
| 1974 | STOC | Determining Graph Properties from Matrix Representations | David G. Kirkpatrick |
| 1972 | STOC | On the Additions Necessary to Compute Certain Functions | David G. Kirkpatrick |