David G. Kirkpatrick

179 papers A* 17A 4B 17C 3Misc 2Journal 89Unranked 46

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. Theory Comput. Syst. William S. Evans, David G. Kirkpatrick
2025	J	`jnl`	Distance-based Learning of Hypertrees. CoRR Shaun M. Fallat, Kamyar Khodamoradi, David G. Kirkpatrick, Valerii Maliuk, Seyed Ahmad Mojallal, Sandra Zilles
2025	J	`jnl`	Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots. CoRR David G. Kirkpatrick, Paul Liu
2024	J	`jnl`	Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. Algorithms William S. Evans, David G. Kirkpatrick
2024	J	`jnl`	On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. Distributed Comput. David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro
2023	B	`conf`	A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. WAOA William S. Evans, David G. Kirkpatrick
2023	B	`conf`	Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. FCT William S. Evans, David G. Kirkpatrick
2023	J	`jnl`	On Batch Teaching Without Collusion. J. Mach. Learn. Res. Shaun M. Fallat, David G. Kirkpatrick, Hans Ulrich Simon, Abolghasem Soltani, Sandra Zilles
2022	J	`jnl`	Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. CoRR William S. Evans, David G. Kirkpatrick
2021	A*	`conf`	Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. PODC David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro
2021	J	`jnl`	Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. CoRR David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro
2020	J	`jnl`	Approximate majority analyses using tri-molecular chemical reaction networks. Nat. Comput. Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch
2019	A*	`conf`	Minimizing Interference Potential Among Moving Entities. SODA Daniel Busto, William S. Evans, David G. Kirkpatrick
2019	B	`conf`	Optimal Collusion-Free Teaching. ALT David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles
2019	J	`jnl`	Optimal Collusion-Free Teaching. CoRR David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles
2018	J	`jnl`	Swapping Colored Tokens on Graphs. CoRR Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2018	J	`jnl`	Swapping colored tokens on graphs. Theor. Comput. Sci. Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2017	B	`conf`	Preference-based Teaching of Unions of Geometric Objects. ALT Ziyuan Gao, David G. Kirkpatrick, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
2017	B	`conf`	Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. DNA Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch
2017	B	`conf`	Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. WALCOM Toshiki Saitoh, David G. Kirkpatrick
2016	—	`conf`	Characterizing minimum-length coordinated motions for two discs. CCCG David G. Kirkpatrick, Paul Liu
2016	J	`jnl`	Characterizing minimum-length coordinated motions for two discs. CoRR David G. Kirkpatrick, Paul Liu
2016	J	`jnl`	Minimizing Co-location Potential of Moving Entities. SIAM J. Comput. William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals
2016	—	`conf`	Progressive Alignment of Shapes. CCCG Ashwin Gopinath, David G. Kirkpatrick, Paul W. K. Rothemund, Chris Thachuk
2015	J	`jnl`	An O(lg lg OPT)-Approximation Algorithm for Multi-guarding Galleries. Discret. Comput. Geom. David G. Kirkpatrick
2015	B	`conf`	Swapping Colored Tokens on Graphs. WADS Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2014	J	`jnl`	A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. Int. J. Comput. Geom. Appl. David G. Kirkpatrick, Boting Yang, Sandra Zilles
2014	J	`jnl`	Computational Aspects of M.C. Escher's Ribbon Patterns. Theory Comput. Syst. Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger
2014	J	`jnl`	Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience. Theor. Comput. Sci. David Yu Cheng Chan, David G. Kirkpatrick
2014	J	`jnl`	O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem. Electron. Colloquium Comput. Complex. Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
2014	—	`conf`	Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability. MFCS (2) Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
2013	—	`conf`	Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50. Space-Efficient Data Structures, Streams, and Algorithms David G. Kirkpatrick
2013	A*	`conf`	Competitive query strategies for minimising the ply of the potential locations of moving points. SoCG William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals
2013	—	`conf`	On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case. JCDCGG Sylvester David Eriksson-Bique, David G. Kirkpatrick, Valentin Polishchuk
2013	—	`conf`	On k-Guarding Polygons. CCCG Daniel Busto, William S. Evans, David G. Kirkpatrick
2013	B	`conf`	Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. WADS Tetsuo Asano, David G. Kirkpatrick
2012	C	`conf`	Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. ALGOSENSORS David Yu Cheng Chan, David G. Kirkpatrick
2012	J	`jnl`	Discrete Dubins Paths CoRR Sylvester David Eriksson-Bique, David G. Kirkpatrick, Valentin Polishchuk
2012	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. David G. Kirkpatrick
2012	J	`jnl`	Guest editorʼs foreword. Comput. Geom. David G. Kirkpatrick
2012	Misc	`conf`	M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. FUN Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger
2011	A	`conf`	Can Nearest Neighbor Searching Be Simple and Always Fast? ESA Victor Alvarez, David G. Kirkpatrick, Raimund Seidel
2011	B	`conf`	Competitive Search in Symmetric Trees. WADS David G. Kirkpatrick, Sandra Zilles
2011	—	`conf`	Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning. CCCG David G. Kirkpatrick, Irina Kostitsyna, Valentin Polishchuk
2011	J	`jnl`	Improved Approximation for Guarding Simple Galleries from the Perimeter. Discret. Comput. Geom. James King, David G. Kirkpatrick
2011	B	`conf`	Input-Thrifty Extrema Testing. ISAAC Kuan-Chieh Robert Tseng, David G. Kirkpatrick
2011	C	`conf`	On Barrier Resilience of Sensor Networks. ALGOSENSORS Kuan-Chieh Robert Tseng, David G. Kirkpatrick
2010	—	`conf`	Determining the robustness of sensor barriers. CCCG David G. Kirkpatrick
2010	J	`jnl`	Improved Approximation for Guarding Simple Galleries from the Perimeter CoRR James King, David G. Kirkpatrick
2010	—	`conf`	Multi-guard covers for polygonal regions. CCCG Zohreh Jabbari, William S. Evans, David G. Kirkpatrick
2010	J	`jnl`	On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wirel. Networks Stephane Durocher, David G. Kirkpatrick, Lata Narayanan
2010	—	`ed.`	Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010 SCG David G. Kirkpatrick, Joseph S. B. Mitchell
2009	C	`conf`	Approximating Barrier Resilience in Wireless Sensor Networks. ALGOSENSORS Sergey Bereg, David G. Kirkpatrick
2009	—	`conf`	Finding Nearest Larger Neighbors. Efficient Algorithms Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick
2009	A	`conf`	Hyperbolic Dovetailing. ESA David G. Kirkpatrick
2009	J	`jnl`	Linear-time certifying algorithms for near-graphical sequences. Discret. Math. Pavol Hell, David G. Kirkpatrick
2009	J	`jnl`	The projection median of a set of points. Comput. Geom. Stephane Durocher, David G. Kirkpatrick
2008	B	`conf`	A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. ISAAC Jonathan Backer, David G. Kirkpatrick
2008	J	`jnl`	Bounded-Velocity Approximation of Mobile Euclidean 2-Centres. Int. J. Comput. Geom. Appl. Stephane Durocher, David G. Kirkpatrick
2008	Misc	`conf`	On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. ICDCN Stephane Durocher, David G. Kirkpatrick, Lata Narayanan
2007	—	`conf`	Finding curvature-constrained paths that avoid polygonal obstacles. SCG Jonathan Backer, David G. Kirkpatrick
2007	A*	`conf`	Lower bounds on average-case delay for video-on-demand broadcast protocols. SODA Wei-Lung Dustin Tseng, David G. Kirkpatrick
2006	—	`conf`	Bounded-Curvature Path Normalization. CCCG Jonathan Backer, David G. Kirkpatrick
2006	J	`jnl`	Competitive Algorithms for Maintaining a Mobile Center. Mob. Networks Appl. Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
2006	—	`conf`	Distance Trisector Curves in Regular Convex Distance Me. ISVD Tetsuo Asano, David G. Kirkpatrick
2006	J	`jnl`	Equitable subdivisions within polygonal regions. Comput. Geom. Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick
2006	J	`jnl`	On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discret. Math. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
2006	J	`jnl`	Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. ACM Trans. Algorithms William S. Evans, David G. Kirkpatrick
2006	J	`jnl`	The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. Int. J. Comput. Geom. Appl. Stephane Durocher, David G. Kirkpatrick
2005	J	`jnl`	Computing the Set of all the Distant Horizons of a Terrain. Int. J. Comput. Geom. Appl. Daniel Archambault, William S. Evans, David G. Kirkpatrick
2005	—	`conf`	Curvature-bounded traversals of narrow corridors. SCG Sergey Bereg, David G. Kirkpatrick
2005	—	`conf`	The Projection Median of a Set of Points in R CCCG Stephane Durocher, David G. Kirkpatrick
2004	—	`conf`	Computing the set of all distant horizons of a terrain. CCCG William S. Evans, Daniel Archambault, David G. Kirkpatrick
2004	A*	`conf`	Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. SODA William S. Evans, David G. Kirkpatrick
2004	J	`jnl`	Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discret. Comput. Geom. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2004	J	`jnl`	Restructuring ordered binary trees. J. Algorithms William S. Evans, David G. Kirkpatrick
2004	—	`conf`	The gaussian centre and the projection centre of a set of points in r CCCG Stephane Durocher, David G. Kirkpatrick
2003	—	`conf`	Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2003	—	`conf`	The Gaussian Centre of a Set of Mobile Points. CCCG Stephane Durocher, David G. Kirkpatrick
2003	J	`jnl`	Tight degree bounds for pseudo-triangulations of points. Comput. Geom. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
2003	J	`jnl`	Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Comput. Geom. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
2002	—	`conf`	An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. CCCG Francois Anton, David G. Kirkpatrick, Darka Mioc
2002	—	`conf`	Constrained Equitable 3-Cuttings. JCDCG Sergei Bespamyatnikh, David G. Kirkpatrick
2002	J	`jnl`	Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
2002	J	`jnl`	Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geom. Appl. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
2002	—	`conf`	Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. SCG David G. Kirkpatrick, Bettina Speckmann
2002	—	`conf`	Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
2002	B	`conf`	On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
2002	—	`conf`	On the hardness of turn-angle-restricted rectilinear cycle cover problems. CCCG Stephane Durocher, David G. Kirkpatrick
2002	—	`conf`	Pseudo approximation algorithms, with applications to optimal motion planning. SCG Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
2001	J	`jnl`	Right-Triangulated Irregular Networks. Algorithmica William S. Evans, David G. Kirkpatrick, G. Townsend
2001	—	`conf`	Tight degree bounds for pseudo-triangulations of points. CCCG Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann
2000	A	`conf`	Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
2000	J	`jnl`	Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discret. Comput. Geom. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
2000	—	`conf`	Guarding Alcove-Free Galleries . CCCG David G. Kirkpatrick
2000	—	`conf`	Kinetic collision detection for simple polygons. SCG David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
2000	—	`conf`	Mobile facility location. DIAL-M Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
2000	A*	`conf`	Restructuring ordered binary trees. SODA William S. Evans, David G. Kirkpatrick
2000	—	`conf`	Separation Sensitive Kinetic Separation Structures for Convex Polygons. JCDCG David G. Kirkpatrick, Bettina Speckmann
1999	J	`jnl`	Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. Int. J. Comput. Geom. Appl. David G. Kirkpatrick, Jack Snoeyink
1999	—	`conf`	Generalizing Ham Sandwich Cuts to Equitable Subdivisions. SCG Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
1999	—	`conf`	Rectilinear 2-center problems. CCCG Sergei Bespamyatnikh, David G. Kirkpatrick
1998	J	`jnl`	Partial and Perfect Path Covers of Cographs. Discret. Appl. Math. David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan
1998	J	`jnl`	Unit disk graph recognition is NP-hard. Comput. Geom. Heinz Breu, David G. Kirkpatrick
1997	J	`jnl`	Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. J. Algorithms Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler
1996	J	`jnl`	A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Discret. Comput. Geom. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
1996	—	`conf`	Approximating Shortest Paths in Arrangements of Lines. CCCG Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
1996	J	`jnl`	Determining Bar-representability for Ordered Weighted Graphs. Comput. Geom. David G. Kirkpatrick, Stephen K. Wismath
1996	—	`conf`	Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. CCCG Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
1996	J	`jnl`	Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. Algorithmica David G. Kirkpatrick, Teresa M. Przytycka
1996	J	`jnl`	Rounding in Symmetric Matrices and Undirected Graphs. Discret. Appl. Math. Pavol Hell, David G. Kirkpatrick, Brenda Li
1995	B	`conf`	Computing Common Tangents Without a Separating Line. WADS David G. Kirkpatrick, Jack Snoeyink
1995	J	`jnl`	Linear Time Euclidean Distance Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. Heinz Breu, Joseph Gil, David G. Kirkpatrick, Michael Werman
1995	A	`conf`	On the Complexity of Recognizing Intersection and Touching Graphs of Disks. GD Heinz Breu, David G. Kirkpatrick
1995	J	`jnl`	Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Informaticae David G. Kirkpatrick, Jack Snoeyink
1994	J	`jnl`	Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. J. ACM Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1993	A*	`conf`	A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane FOCS Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
1993	J	`jnl`	Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. J. Algorithms Pavol Hell, David G. Kirkpatrick
1993	—	`conf`	Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG David G. Kirkpatrick, Jack Snoeyink
1993	J	`jnl`	Computing the Intersection-Depth of Polyhedra. Algorithmica David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
1993	J	`jnl`	Finding Extrema with Unary Predicates. Algorithmica Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe
1993	—	`conf`	Tentative Prune-and-Search for Computing Voronoi Vertices. SCG David G. Kirkpatrick, Jack Snoeyink
1992	J	`jnl`	Polygon Triangulation in O (n log log n) Time with Simple Data Structures. Discret. Comput. Geom. David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan
1992	J	`jnl`	Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discret. Comput. Geom. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
1991	B	`conf`	Probabilistic Leader Election on Rings of Known Size. WADS Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1990	J	`jnl`	A simple existence criterion for (g<f)- factors. Discret. Math. Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu
1990	—	`conf`	An optimal parallel minimax tree algorithm. SPDP David G. Kirkpatrick, Teresa M. Przytycka
1990	A*	`conf`	Determining the Separation of Preprocessed Polyhedra - A Unified Approach. ICALP David P. Dobkin, David G. Kirkpatrick
1990	—	`conf`	Finding Extrema with Unary Predicates. SIGAL International Symposium on Algorithms David G. Kirkpatrick, Feng Gao
1990	—	`conf`	Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
1990	B	`conf`	Parallel Construction of near Optimal binary Trees. SPAA David G. Kirkpatrick, Teresa M. Przytycka
1990	J	`jnl`	Parallel algorithms for fractional and maximal independent sets in planar graphs. Discret. Appl. Math. Norm Dadoun, David G. Kirkpatrick
1990	J	`jnl`	Parallel recognition of complement reducible graphs and cotree construction. Discret. Appl. Math. David G. Kirkpatrick, Teresa M. Przytycka
1990	—	`conf`	Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. SCG David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan
1990	A*	`conf`	Quantitative Steinitz's Theorems with Applications to Multifingered Grasping STOC David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
1989	J	`jnl`	A Simple Parallel Tree Contraction Algorithm. J. Algorithms Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka
1989	—	`conf`	Determining Sector Visibility of a Polygon. SCG Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
1989	J	`jnl`	Parallel Construction of Subdivision Hierarchies. J. Comput. Syst. Sci. Norm Dadoun, David G. Kirkpatrick
1989	J	`jnl`	Randomized Function Evaluation on a Ring. Distributed Comput. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1989	J	`jnl`	The Bit Complexity of Randomized Leader Election on a Ring. SIAM J. Comput. Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick
1989	B	`conf`	Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). WADS David G. Kirkpatrick, Stephen K. Wismath
1988	J	`jnl`	Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty
1988	J	`jnl`	Establishing Order in Planar Subdivisions. Discret. Comput. Geom. David G. Kirkpatrick
1988	J	`jnl`	On Restricted Two-Factors. SIAM J. Discret. Math. Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz
1987	—	`conf`	Establishing Order in Planar Subdivisions. SCG David G. Kirkpatrick
1987	—	`conf`	Parallel Processing for Efficient Subdivision Search. SCG Norm Dadoun, David G. Kirkpatrick
1987	—	`conf`	Randomized Function on a Ring (Preliminary Version). WDAG Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1986	J	`jnl`	A note on Graphs Comb. Pierre Fraisse, Pavol Hell, David G. Kirkpatrick
1986	A*	`conf`	Probabilistic Solitude Verification on a Ring. PODC Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
1986	J	`jnl`	The Ultimate Planar Convex Hull Algorithm? SIAM J. Comput. David G. Kirkpatrick, Raimund Seidel
1985	J	`jnl`	A Linear Algorithm for Determining the Separation of Convex Polyhedra. J. Algorithms David P. Dobkin, David G. Kirkpatrick
1985	J	`jnl`	Alphabetic Minimax Trees. SIAM J. Comput. David G. Kirkpatrick, Maria M. Klawe
1985	—	`conf`	Output-size sensitive algorithms for finding maximal vectors. SCG David G. Kirkpatrick, Raimund Seidel
1985	—	`conf`	The geometry of beam tracing. SCG Norm Dadoun, David G. Kirkpatrick, John P. Walsh
1984	J	`jnl`	Packings by cliques and by finite families of graphs. Discret. Math. Pavol Hell, David G. Kirkpatrick
1984	J	`jnl`	Upper Bounds for Sorting Integers on Random Access Machines. Theor. Comput. Sci. David G. Kirkpatrick, Stefan Reisch
1983	J	`jnl`	Dynamic Voronoi diagrams. IEEE Trans. Inf. Theory I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad
1983	J	`jnl`	Fast Detection of Polyhedral Intersection. Theor. Comput. Sci. David P. Dobkin, David G. Kirkpatrick
1983	J	`jnl`	On pseudosimilarity in trees. J. Comb. Theory B David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil
1983	J	`jnl`	On the Complexity of General Graph Factor Problems. SIAM J. Comput. David G. Kirkpatrick, Pavol Hell
1983	J	`jnl`	On the shape of a set of points in the plane. IEEE Trans. Inf. Theory Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
1983	J	`jnl`	Optimal Search in Planar Subdivisions. SIAM J. Comput. David G. Kirkpatrick
1982	A*	`conf`	Fast Detection of Polyhedral Intersections. ICALP David P. Dobkin, David G. Kirkpatrick
1982	A*	`conf`	Foundations for Multifile Design by Application Partitioning. PODS Doron Rotem, Frank Wm. Tompa, David G. Kirkpatrick
1982	J	`jnl`	Polygonal Intersection Searching. Inf. Process. Lett. Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick
1981	J	`jnl`	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1981	J	`jnl`	A Unified Lower Bound for Selection and Set Partitioning Problems. J. ACM David G. Kirkpatrick
1981	J	`jnl`	Forest embeddings in regular graphs of large girth. J. Comb. Theory B David G. Kirkpatrick, Derek G. Corneil
1981	J	`jnl`	On Generalized Matching Problems. Inf. Process. Lett. Pavol Hell, David G. Kirkpatrick
1981	B	`conf`	The Shape of a Set of Points in the Plane. WG Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
1980	J	`jnl`	A Note on Delaunay and Optimal Triangulations. Inf. Process. Lett. David G. Kirkpatrick
1980	J	`jnl`	A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. SIAM J. Comput. Derek G. Corneil, David G. Kirkpatrick
1979	A*	`conf`	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines FOCS Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1979	J	`jnl`	A time-space tradeoff for sorting and related non-oblivious computations. SIGACT News Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1979	A*	`conf`	Efficient Computation of Continuous Skeletons FOCS David G. Kirkpatrick
1978	A*	`conf`	On the Completeness of a Generalized Matching Problem STOC David G. Kirkpatrick, Pavol Hell
1977	J	`jnl`	Adequate Requirements for Rational Functions. SIAM J. Comput. David G. Kirkpatrick, Zvi M. Kedem
1974	A*	`conf`	Determining Graph Properties from Matrix Representations STOC David G. Kirkpatrick
1972	A*	`conf`	On the Additions Necessary to Compute Certain Functions STOC David G. Kirkpatrick