On the Additions Necessary to Compute Certain Functions - David G. Kirkpatrick (STOC, 1972)

Determining Graph Properties from Matrix Representations - David G. Kirkpatrick (STOC, 1974)

Adequate Requirements for Rational Functions. - David G. Kirkpatrick; Zvi M. Kedem (SIAM J. Comput., 1977)

On the Completeness of a Generalized Matching Problem - David G. Kirkpatrick; Pavol Hell (STOC, 1978)

Efficient Computation of Continuous Skeletons - David G. Kirkpatrick (FOCS, 1979)

A time-space tradeoff for sorting and related non-oblivious computations. - Allan Borodin; Michael J. Fischer; David G. Kirkpatrick; Nancy A. Lynch; Martin Tompa (SIGACT News, 1979)

A Note on Delaunay and Optimal Triangulations. - David G. Kirkpatrick (Inf. Process. Lett., 1980)

A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. - Derek G. Corneil; David G. Kirkpatrick (SIAM J. Comput., 1980)

On Generalized Matching Problems. - Pavol Hell; David G. Kirkpatrick (Inf. Process. Lett., 1981)

A Unified Lower Bound for Selection and Set Partitioning Problems. - David G. Kirkpatrick (J. ACM, 1981)

A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. - Allan Borodin; Michael J. Fischer; David G. Kirkpatrick; Nancy A. Lynch; Martin Tompa (J. Comput. Syst. Sci., 1981)

Forest embeddings in regular graphs of large girth. - David G. Kirkpatrick; Derek G. Corneil (J. Comb. Theory B, 1981)

Fast Detection of Polyhedral Intersections. - David P. Dobkin; David G. Kirkpatrick (ICALP, 1982)

Foundations for Multifile Design by Application Partitioning. - Doron Rotem; Frank Wm. Tompa; David G. Kirkpatrick (PODS, 1982)

Polygonal Intersection Searching. - Herbert Edelsbrunner; Hermann A. Maurer; David G. Kirkpatrick (Inf. Process. Lett., 1982)

On pseudosimilarity in trees. - David G. Kirkpatrick; Maria M. Klawe; Derek G. Corneil (J. Comb. Theory B, 1983)

Optimal Search in Planar Subdivisions. - David G. Kirkpatrick (SIAM J. Comput., 1983)

On the Complexity of General Graph Factor Problems. - David G. Kirkpatrick; Pavol Hell (SIAM J. Comput., 1983)

Fast Detection of Polyhedral Intersection. - David P. Dobkin; David G. Kirkpatrick (Theor. Comput. Sci., 1983)

On the shape of a set of points in the plane. - Herbert Edelsbrunner; David G. Kirkpatrick; Raimund Seidel (IEEE Trans. Inf. Theory, 1983)

Dynamic Voronoi diagrams. - I. G. Gowda; David G. Kirkpatrick; D. T. Lee; Amnon Naamad (IEEE Trans. Inf. Theory, 1983)

Packings by cliques and by finite families of graphs. - Pavol Hell; David G. Kirkpatrick (Discret. Math., 1984)

Upper Bounds for Sorting Integers on Random Access Machines. - David G. Kirkpatrick; Stefan Reisch (Theor. Comput. Sci., 1984)

The geometry of beam tracing. - Norm Dadoun; David G. Kirkpatrick; John P. Walsh (SCG, 1985)

Output-size sensitive algorithms for finding maximal vectors. - David G. Kirkpatrick; Raimund Seidel (SCG, 1985)

A Linear Algorithm for Determining the Separation of Convex Polyhedra. - David P. Dobkin; David G. Kirkpatrick (J. Algorithms, 1985)

Alphabetic Minimax Trees. - David G. Kirkpatrick; Maria M. Klawe (SIAM J. Comput., 1985)

Probabilistic Solitude Verification on a Ring. - Karl R. Abrahamson; Andrew Adler; Lisa Higham; David G. Kirkpatrick (PODC, 1986)

A note onf-factors in directed and undirected multigraphs. - Pierre Fraisse; Pavol Hell; David G. Kirkpatrick (Graphs Comb., 1986)

The Ultimate Planar Convex Hull Algorithm? - David G. Kirkpatrick; Raimund Seidel (SIAM J. Comput., 1986)

Parallel Processing for Efficient Subdivision Search. - Norm Dadoun; David G. Kirkpatrick (SCG, 1987)

Randomized Function on a Ring (Preliminary Version). - Karl R. Abrahamson; Andrew Adler; Lisa Higham; David G. Kirkpatrick (WDAG, 1987)

Establishing Order in Planar Subdivisions. - David G. Kirkpatrick (Discret. Comput. Geom., 1988)

Addition Requirements for Matrix and Transposed Matrix Products. - Michael Kaminski; David G. Kirkpatrick; Nader H. Bshouty (J. Algorithms, 1988)

On Restricted Two-Factors. - Pavol Hell; David G. Kirkpatrick; Jan Kratochvíl; Igor Kríz (SIAM J. Discret. Math., 1988)

Determining Sector Visibility of a Polygon. - Binay K. Bhattacharya; David G. Kirkpatrick; Godfried T. Toussaint (SCG, 1989)

Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). - David G. Kirkpatrick; Stephen K. Wismath (WADS, 1989)

Randomized Function Evaluation on a Ring. - Karl R. Abrahamson; Andrew Adler; Lisa Higham; David G. Kirkpatrick (Distributed Comput., 1989)

A Simple Parallel Tree Contraction Algorithm. - Karl R. Abrahamson; Norm Dadoun; David G. Kirkpatrick; Teresa M. Przytycka (J. Algorithms, 1989)

Parallel Construction of Subdivision Hierarchies. - Norm Dadoun; David G. Kirkpatrick (J. Comput. Syst. Sci., 1989)

The Bit Complexity of Randomized Leader Election on a Ring. - Karl R. Abrahamson; Andrew Adler; Rachel Gelbart; Lisa Higham; David G. Kirkpatrick (SIAM J. Comput., 1989)

Determining the Separation of Preprocessed Polyhedra - A Unified Approach. - David P. Dobkin; David G. Kirkpatrick (ICALP, 1990)

Implicitly Searching Convolutions and Computing Depth of Collision. - David P. Dobkin; John Hershberger 001; David G. Kirkpatrick; Subhash Suri (SIGAL International Symposium on Algorithms, 1990)

Finding Extrema with Unary Predicates. - David G. Kirkpatrick; Feng Gao 002 (SIGAL International Symposium on Algorithms, 1990)

Parallel Construction of near Optimal binary Trees. - David G. Kirkpatrick; Teresa M. Przytycka (SPAA, 1990)

An optimal parallel minimax tree algorithm. - David G. Kirkpatrick; Teresa M. Przytycka (SPDP, 1990)

Parallel algorithms for fractional and maximal independent sets in planar graphs. - Norm Dadoun; David G. Kirkpatrick (Discret. Appl. Math., 1990)

Parallel recognition of complement reducible graphs and cotree construction. - David G. Kirkpatrick; Teresa M. Przytycka (Discret. Appl. Math., 1990)

A simple existence criterion for (g<f)- factors. - Katherine Heinrich; Pavol Hell; David G. Kirkpatrick; Guizhen Liu (Discret. Math., 1990)

Probabilistic Leader Election on Rings of Known Size. - Karl R. Abrahamson; Andrew Adler; Lisa Higham; David G. Kirkpatrick (WADS, 1991)

Polygon Triangulation in O (n log log n) Time with Simple Data Structures. - David G. Kirkpatrick; Maria M. Klawe; Robert Endre Tarjan (Discret. Comput. Geom., 1992)

Quantitative Steinitz's Theorems Applications to Multifingered Grasping. - David G. Kirkpatrick; Bhubaneswar Mishra; Chee-Keng Yap (Discret. Comput. Geom., 1992)

Tentative Prune-and-Search for Computing Voronoi Vertices. - David G. Kirkpatrick; Jack Snoeyink (SCG, 1993)

Computing the Intersection-Depth of Polyhedra. - David P. Dobkin; John Hershberger 001; David G. Kirkpatrick; Subhash Suri (Algorithmica, 1993)

Finding Extrema with Unary Predicates. - Feng Gao 002; Leonidas J. Guibas; David G. Kirkpatrick; William T. Laaser; James B. Saxe (Algorithmica, 1993)

Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. - Pavol Hell; David G. Kirkpatrick (J. Algorithms, 1993)

Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. - Karl R. Abrahamson; Andrew Adler; Lisa Higham; David G. Kirkpatrick (J. ACM, 1994)

On the Complexity of Recognizing Intersection and Touching Graphs of Disks. - Heinz Breu; David G. Kirkpatrick (GD, 1995)

Computing Common Tangents Without a Separating Line. - David G. Kirkpatrick; Jack Snoeyink (WADS, 1995)

Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. - David G. Kirkpatrick; Jack Snoeyink (Fundam. Informaticae, 1995)

Linear Time Euclidean Distance Algorithms. - Heinz Breu; Joseph Gil; David G. Kirkpatrick; Michael Werman (IEEE Trans. Pattern Anal. Mach. Intell., 1995)

Approximating Shortest Paths in Arrangements of Lines. - Prosenjit Bose; William S. Evans; David G. Kirkpatrick; Michael McAllister; Jack Snoeyink (CCCG, 1996)

Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. - Prosenjit Bose; David G. Kirkpatrick; Zaiqing Li (CCCG, 1996)

d1-Optimal Motion for a Rod (Extended Abstract). - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (SCG, 1996)

Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. - David G. Kirkpatrick; Teresa M. Przytycka (Algorithmica, 1996)

Determining Bar-representability for Ordered Weighted Graphs. - David G. Kirkpatrick; Stephen K. Wismath (Comput. Geom., 1996)

Rounding in Symmetric Matrices and Undirected Graphs. - Pavol Hell; David G. Kirkpatrick; Brenda Li (Discret. Appl. Math., 1996)

A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. - Michael McAllister; David G. Kirkpatrick; Jack Snoeyink (Discret. Comput. Geom., 1996)

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. - Lisa Higham; David G. Kirkpatrick; Karl R. Abrahamson; Andrew Adler (J. Algorithms, 1997)

Unit disk graph recognition is NP-hard. - Heinz Breu; David G. Kirkpatrick (Comput. Geom., 1998)

Partial and Perfect Path Covers of Cographs. - David G. Kirkpatrick; Madhukar K. Reddy; C. Pandu Rangan; Anand Srinivasan (Discret. Appl. Math., 1998)

Rectilinear 2-center problems. - Sergei Bespamyatnikh; David G. Kirkpatrick (CCCG, 1999)

Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. - David G. Kirkpatrick; Jack Snoeyink (Int. J. Comput. Geom. Appl., 1999)

Guarding Alcove-Free Galleries . - David G. Kirkpatrick (CCCG, 2000)

Mobile facility location. - Sergei Bespamyatnikh; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (DIAL-M, 2000)

Separation Sensitive Kinetic Separation Structures for Convex Polygons. - David G. Kirkpatrick; Bettina Speckmann (JCDCG, 2000)

Generalizing Ham Sandwich Cuts to Equitable Subdivisions. - Sergei Bespamyatnikh; David G. Kirkpatrick; Jack Snoeyink (Discret. Comput. Geom., 2000)

Tight degree bounds for pseudo-triangulations of points. - Lutz Kettner; David G. Kirkpatrick; Bettina Speckmann (CCCG, 2001)

Right-Triangulated Irregular Networks. - William S. Evans; David G. Kirkpatrick; G. Townsend (Algorithmica, 2001)

An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. - Francois Anton; David G. Kirkpatrick; Darka Mioc (CCCG, 2002)

On the hardness of turn-angle-restricted rectilinear cycle cover problems. - Stephane Durocher; David G. Kirkpatrick (CCCG, 2002)

Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. - David G. Kirkpatrick; Bettina Speckmann (SCG, 2002)

Lower and Upper Bounds for Tracking Mobile Users. - Sergei Bespamyatnikh; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (IFIP TCS, 2002)

Constrained Equitable 3-Cuttings. - Sergei Bespamyatnikh; David G. Kirkpatrick (JCDCG, 2002)

Kinetic Collision Detection for Simple Polygons. - David G. Kirkpatrick; Jack Snoeyink; Bettina Speckmann (Int. J. Comput. Geom. Appl., 2002)

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 001 (Networks, 2002)

Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (CCCG, 2003)

The Gaussian Centre of a Set of Mobile Points. - Stephane Durocher; David G. Kirkpatrick (CCCG, 2003)

Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. - Prosenjit Bose; David G. Kirkpatrick; Zaiqing Li (Comput. Geom., 2003)

Tight degree bounds for pseudo-triangulations of points. - Lutz Kettner; David G. Kirkpatrick; Andrea Mantler; Jack Snoeyink; Bettina Speckmann; Fumihiko Takeuchi (Comput. Geom., 2003)

The gaussian centre and the projection centre of a set of points in r3. - Stephane Durocher; David G. Kirkpatrick (CCCG, 2004)

Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. - William S. Evans; David G. Kirkpatrick (SODA, 2004)

Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. - Tetsuo Asano; David G. Kirkpatrick; Chee-Keng Yap (Discret. Comput. Geom., 2004)

Restructuring ordered binary trees. - William S. Evans; David G. Kirkpatrick (J. Algorithms, 2004)

The Projection Median of a Set of Points in R2. - Stephane Durocher; David G. Kirkpatrick (CCCG, 2005)

Curvature-bounded traversals of narrow corridors. - Sergey Bereg; David G. Kirkpatrick (SCG, 2005)

Computing the Set of all the Distant Horizons of a Terrain. - Daniel Archambault; William S. Evans; David G. Kirkpatrick (Int. J. Comput. Geom. Appl., 2005)

Bounded-Curvature Path Normalization. - Jonathan Backer; David G. Kirkpatrick (CCCG, 2006)

Distance Trisector Curves in Regular Convex Distance Me. - Tetsuo Asano; David G. Kirkpatrick (ISVD, 2006)

Equitable subdivisions within polygonal regions. - Sergey Bereg; Prosenjit Bose; David G. Kirkpatrick (Comput. Geom., 2006)

The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. - Stephane Durocher; David G. Kirkpatrick (Int. J. Comput. Geom. Appl., 2006)

Competitive Algorithms for Maintaining a Mobile Center. - Sergey Bereg; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (Mob. Networks Appl., 2006)

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. - Prosenjit Bose; Luc Devroye; William S. Evans; David G. Kirkpatrick (SIAM J. Discret. Math., 2006)

Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. - William S. Evans; David G. Kirkpatrick (ACM Trans. Algorithms, 2006)

Finding curvature-constrained paths that avoid polygonal obstacles. - Jonathan Backer; David G. Kirkpatrick (SCG, 2007)

Lower bounds on average-case delay for video-on-demand broadcast protocols. - Wei-Lung Dustin Tseng; David G. Kirkpatrick (SODA, 2007)

A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. - Jonathan Backer; David G. Kirkpatrick (ISAAC, 2008)

Bounded-Velocity Approximation of Mobile Euclidean 2-Centres. - Stephane Durocher; David G. Kirkpatrick (Int. J. Comput. Geom. Appl., 2008)

Approximating Barrier Resilience in Wireless Sensor Networks. - Sergey Bereg; David G. Kirkpatrick (ALGOSENSORS, 2009)

Finding Nearest Larger Neighbors. - Tetsuo Asano; Sergey Bereg; David G. Kirkpatrick (Efficient Algorithms, 2009)

Hyperbolic Dovetailing. - David G. Kirkpatrick (ESA, 2009)

The projection median of a set of points. - Stephane Durocher; David G. Kirkpatrick (Comput. Geom., 2009)

Linear-time certifying algorithms for near-graphical sequences. - Pavol Hell; David G. Kirkpatrick (Discret. Math., 2009)

Multi-guard covers for polygonal regions. - Zohreh Jabbari; William S. Evans; David G. Kirkpatrick (CCCG, 2010)

Determining the robustness of sensor barriers. - David G. Kirkpatrick (CCCG, 2010)

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. - Stephane Durocher; David G. Kirkpatrick; Lata Narayanan (Wirel. Networks, 2010)

On Barrier Resilience of Sensor Networks. - Kuan-Chieh Robert Tseng; David G. Kirkpatrick (ALGOSENSORS, 2011)

Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning. - David G. Kirkpatrick; Irina Kostitsyna; Valentin Polishchuk (CCCG, 2011)

Can Nearest Neighbor Searching Be Simple and Always Fast? - Victor Alvarez 001; David G. Kirkpatrick; Raimund Seidel (ESA, 2011)

Input-Thrifty Extrema Testing. - Kuan-Chieh Robert Tseng; David G. Kirkpatrick (ISAAC, 2011)

Competitive Search in Symmetric Trees. - David G. Kirkpatrick; Sandra Zilles (WADS, 2011)

Improved Approximation for Guarding Simple Galleries from the Perimeter. - James King 001; David G. Kirkpatrick (Discret. Comput. Geom., 2011)

Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. - David Yu Cheng Chan; David G. Kirkpatrick (ALGOSENSORS, 2012)

M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. - Ellen Gethner; David G. Kirkpatrick; Nicholas Pippenger (FUN, 2012)

Guest editorʼs foreword. - David G. Kirkpatrick (Comput. Geom., 2012)

Discrete Dubins Paths - Sylvester David Eriksson-Bique; David G. Kirkpatrick; Valentin Polishchuk (CoRR, 2012)

Guest Editor's Foreword. - David G. Kirkpatrick (Discret. Comput. Geom., 2012)

Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50. - David G. Kirkpatrick (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

On k-Guarding Polygons. - Daniel Busto; William S. Evans; David G. Kirkpatrick (CCCG, 2013)

Competitive query strategies for minimising the ply of the potential locations of moving points. - William S. Evans; David G. Kirkpatrick; Maarten Löffler; Frank Staals (SoCG, 2013)

On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case. - Sylvester David Eriksson-Bique; David G. Kirkpatrick; Valentin Polishchuk (JCDCGG, 2013)

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. - Tetsuo Asano; David G. Kirkpatrick (WADS, 2013)

Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. - Tetsuo Asano; David G. Kirkpatrick; Kotaro Nakagawa; Osamu Watanabe 001 (MFCS (2), 2014)

O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem. - Tetsuo Asano; David G. Kirkpatrick; Kotaro Nakagawa; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2014)

A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. - David G. Kirkpatrick; Boting Yang; Sandra Zilles (Int. J. Comput. Geom. Appl., 2014)

Computational Aspects of M.C. Escher's Ribbon Patterns. - Ellen Gethner; David G. Kirkpatrick; Nicholas Pippenger (Theory Comput. Syst., 2014)

Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience. - David Yu Cheng Chan; David G. Kirkpatrick (Theor. Comput. Sci., 2014)

Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Takashi Horiyama; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (WADS, 2015)

An O(lg lg OPT)-Approximation Algorithm for Multi-guarding Galleries. - David G. Kirkpatrick (Discret. Comput. Geom., 2015)

Progressive Alignment of Shapes. - Ashwin Gopinath; David G. Kirkpatrick; Paul W. K. Rothemund; Chris Thachuk (CCCG, 2016)

Characterizing minimum-length coordinated motions for two discs. - David G. Kirkpatrick; Paul Liu (CCCG, 2016)

Minimizing Co-location Potential of Moving Entities. - William S. Evans; David G. Kirkpatrick; Maarten Löffler; Frank Staals (SIAM J. Comput., 2016)

Preference-based Teaching of Unions of Geometric Objects. - Ziyuan Gao; David G. Kirkpatrick; Christoph Ries; Hans Ulrich Simon; Sandra Zilles (ALT, 2017)

Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. - Anne Condon; Monir Hajiaghayi; David G. Kirkpatrick; Ján Manuch (DNA, 2017)

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. - Toshiki Saitoh; David G. Kirkpatrick (WALCOM, 2017)

Swapping colored tokens on graphs. - Katsuhisa Yamanaka; Takashi Horiyama; J. Mark Keil; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2018)

Optimal Collusion-Free Teaching. - David G. Kirkpatrick; Hans Ulrich Simon; Sandra Zilles (ALT, 2019)

Minimizing Interference Potential Among Moving Entities. - Daniel Busto; William S. Evans; David G. Kirkpatrick (SODA, 2019)

Approximate majority analyses using tri-molecular chemical reaction networks. - Anne Condon; Monir Hajiaghayi; David G. Kirkpatrick; Ján Manuch (Nat. Comput., 2020)

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. - David G. Kirkpatrick; Irina Kostitsyna; Alfredo Navarra; Giuseppe Prencipe; Nicola Santoro (PODC, 2021)

Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. - William S. Evans; David G. Kirkpatrick (CoRR, 2022)

A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. - William S. Evans; David G. Kirkpatrick (WAOA, 2023)

On Batch Teaching Without Collusion. - Shaun M. Fallat; David G. Kirkpatrick; Hans Ulrich Simon; Abolghasem Soltani; Sandra Zilles (J. Mach. Learn. Res., 2023)

Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. - William S. Evans; David G. Kirkpatrick (Algorithms, 2024)

On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. - David G. Kirkpatrick; Irina Kostitsyna; Alfredo Navarra; Giuseppe Prencipe; Nicola Santoro (Distributed Comput., 2024)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots. - David G. Kirkpatrick; Paul Liu (CoRR, 2025)