2012
140Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. David Yu Cheng Chan, David G. Kirkpatrick. ALGOSENSORS 2012, 42-53. Web SearchBibTeXDownload
139Discrete Dubins Paths. Sylvester David Eriksson-Bique, David G. Kirkpatrick, Valentin Polishchuk. CoRR (abs/1211.2365) (2012). Web SearchBibTeXDownload
138Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (47): 659-660 (2012). Web SearchBibTeXDownload
137M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger. FUN 2012, 198-209. Web SearchBibTeXDownload
2011
136On Barrier Resilience of Sensor Networks. Kuan-Chieh Robert Tseng, David G. Kirkpatrick. ALGOSENSORS 2011, 130-144. Web SearchBibTeXDownload
135Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning. David G. Kirkpatrick, Irina Kostitsyna, Valentin Polishchuk. CCCG 2011. Web SearchBibTeXDownload
134Improved Approximation for Guarding Simple Galleries from the Perimeter. James King, David G. Kirkpatrick. Discrete & Computational Geometry (46): 252-269 (2011). Web SearchBibTeXDownload
133Can Nearest Neighbor Searching Be Simple and Always Fast?. Victor Alvarez, David G. Kirkpatrick, Raimund Seidel. ESA 2011, 82-92. Web SearchBibTeXDownload
132Input-Thrifty Extrema Testing. Kuan-Chieh Robert Tseng, David G. Kirkpatrick. ISAAC 2011, 554-563. Web SearchBibTeXDownload
131Competitive Search in Symmetric Trees. David G. Kirkpatrick, Sandra Zilles. WADS 2011, 560-570. Web SearchBibTeXDownload
2010
130Determining the robustness of sensor barriers. David G. Kirkpatrick. CCCG 2010, 227. Web SearchBibTeXDownload
129Multi-guard covers for polygonal regions. Zohreh Jabbari, William S. Evans, David G. Kirkpatrick. CCCG 2010, 5-8. Web SearchBibTeXDownload
128Improved Approximation for Guarding Simple Galleries from the Perimeter. James King, David G. Kirkpatrick. CoRR (abs/1001.4231) (2010). Web SearchBibTeXDownload
127On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Stephane Durocher, David G. Kirkpatrick, Lata Narayanan. Wireless Networks (16): 227-235 (2010). Web SearchBibTeXDownload
2009
126Approximating Barrier Resilience in Wireless Sensor Networks. Sergey Bereg, David G. Kirkpatrick. ALGOSENSORS 2009, 29-40. Web SearchBibTeXDownload
125The projection median of a set of points. Stephane Durocher, David G. Kirkpatrick. Comput. Geom. (42): 364-375 (2009). Web SearchBibTeXDownload
124Linear-time certifying algorithms for near-graphical sequences. Pavol Hell, David G. Kirkpatrick. Discrete Mathematics (309): 5703-5713 (2009). Web SearchBibTeXDownload
123Finding Nearest Larger Neighbors. Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick. Efficient Algorithms 2009, 249-260. Web SearchBibTeXDownload
122Hyperbolic Dovetailing. David G. Kirkpatrick. ESA 2009, 516-527. Web SearchBibTeXDownload
2008
121On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. Stephane Durocher, David G. Kirkpatrick, Lata Narayanan. ICDCN 2008, 546-557. Web SearchBibTeXDownload
120Bounded-Velocity Approximation of Mobile Euclidean 2-Centres. Stephane Durocher, David G. Kirkpatrick. Int. J. Comput. Geometry Appl. (18): 161-183 (2008). Web SearchBibTeXDownload
119A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. Jonathan Backer, David G. Kirkpatrick. ISAAC 2008, 628-643. Web SearchBibTeXDownload
2007
118Lower bounds on average-case delay for video-on-demand broadcast protocols. Wei-Lung Dustin Tseng, David G. Kirkpatrick. SODA 2007, 834-842. Web SearchBibTeXDownload
117Finding curvature-constrained paths that avoid polygonal obstacles. Jonathan Backer, David G. Kirkpatrick. Symposium on Computational Geometry 2007, 66-73. Web SearchBibTeXDownload
2006
116Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. William S. Evans, David G. Kirkpatrick. ACM Transactions on Algorithms (2): 661-678 (2006). Web SearchBibTeXDownload
115Bounded-Curvature Path Normalization. Jonathan Backer, David G. Kirkpatrick. CCCG 2006. Web SearchBibTeXDownload
114Equitable subdivisions within polygonal regions. Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick. Comput. Geom. (34): 20-27 (2006). Web SearchBibTeXDownload
113The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. Stephane Durocher, David G. Kirkpatrick. Int. J. Comput. Geometry Appl. (16): 345-372 (2006). Web SearchBibTeXDownload
112Distance Trisector Curves in Regular Convex Distance Me. Tetsuo Asano, David G. Kirkpatrick. ISVD 2006, 8-17. Web SearchBibTeXDownload
111Competitive Algorithms for Maintaining a Mobile Center. Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. MONET (11): 177-186 (2006). Web SearchBibTeXDownload
110On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick. SIAM J. Discrete Math. (20): 412-427 (2006). Web SearchBibTeXDownload
2005
109The Projection Median of a Set of Points in R2. Stephane Durocher, David G. Kirkpatrick. CCCG 2005, 47-51. Web SearchBibTeXDownload
108Computing the Set of all the Distant Horizons of a Terrain. Daniel Archambault, William S. Evans, David G. Kirkpatrick. Int. J. Comput. Geometry Appl. (15): 547-564 (2005). Web SearchBibTeXDownload
107Curvature-bounded traversals of narrow corridors. Sergey Bereg, David G. Kirkpatrick. Symposium on Computational Geometry 2005, 278-287. Web SearchBibTeXDownload
2004
106The gaussian centre and the projection centre of a set of points in r3. Stephane Durocher, David G. Kirkpatrick. CCCG 2004, 140-144. Web SearchBibTeXDownload
105Computing the set of all distant horizons of a terrain. William S. Evans, Daniel Archambault, David G. Kirkpatrick. CCCG 2004, 76-79. Web SearchBibTeXDownload
104Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Discrete & Computational Geometry (31): 139-171 (2004). Web SearchBibTeXDownload
103Restructuring ordered binary trees. William S. Evans, David G. Kirkpatrick. J. Algorithms (50): 168-193 (2004). Web SearchBibTeXDownload
102Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. William S. Evans, David G. Kirkpatrick. SODA 2004, 1041-1049. Web SearchBibTeXDownload
2003
101Minimizing 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, 10-13. Web SearchBibTeX
100The Gaussian Centre of a Set of Mobile Points. Stephane Durocher, David G. Kirkpatrick. CCCG 2003, 123-127. Web SearchBibTeX
99Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li. Comput. Geom. (26): 209-219 (2003). Web SearchBibTeXDownload
98Tight degree bounds for pseudo-triangulations of points. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi. Comput. Geom. (25): 3-12 (2003). Web SearchBibTeXDownload
2002
97An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. Francois Anton, David G. Kirkpatrick, Darka Mioc. CCCG 2002, 72-76. Web SearchBibTeXDownload
96On the hardness of turn-angle-restricted rectilinear cycle cover problems. Stephane Durocher, David G. Kirkpatrick. CCCG 2002, 13-16. Web SearchBibTeXDownload
95Lower and Upper Bounds for Tracking Mobile Users. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. IFIP TCS 2002, 47-58. Web SearchBibTeX
94Kinetic Collision Detection for Simple Polygons. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann. Int. J. Comput. Geometry Appl. (12): 3-27 (2002). Web SearchBibTeXDownload
93Constrained Equitable 3-Cuttings. Sergei Bespamyatnikh, David G. Kirkpatrick. JCDCG 2002, 72-83. Web SearchBibTeXDownload
92On the Spanning Ratio of Gabriel Graphs and beta-skeletons. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick. LATIN 2002, 479-493. Web SearchBibTeXDownload
91Efficient algorithms for centers and medians in interval and circular-arc graphs. Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. Networks (39): 144-152 (2002). Web SearchBibTeXDownload
90Pseudo approximation algorithms, with applications to optimal motion planning. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Symposium on Computational Geometry 2002, 170-178. Web SearchBibTeXDownload
89Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. David G. Kirkpatrick, Bettina Speckmann. Symposium on Computational Geometry 2002, 179-188. Web SearchBibTeXDownload
2001
88Right-Triangulated Irregular Networks. William S. Evans, David G. Kirkpatrick, G. Townsend. Algorithmica (30): 264-286 (2001). Web SearchBibTeXDownload
87Tight degree bounds for pseudo-triangulations of points. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi. CCCG 2001, 117-120. Web SearchBibTeXDownload
2000
86Guarding Alcove-Free Galleries . David G. Kirkpatrick. CCCG 2000. Web SearchBibTeXDownload
85Mobile facility location. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. DIAL-M 2000, 46-53. Web SearchBibTeXDownload
84Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink. Discrete & Computational Geometry (24): 605-622 (2000). Web SearchBibTeXDownload
83Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. ESA 2000, 100-111. Web SearchBibTeXDownload
82Separation Sensitive Kinetic Separation Structures for Convex Polygons. David G. Kirkpatrick, Bettina Speckmann. JCDCG 2000, 222-236. Web SearchBibTeXDownload
81Restructuring ordered binary trees. William S. Evans, David G. Kirkpatrick. SODA 2000, 477-486. Web SearchBibTeXDownload
80Kinetic collision detection for simple polygons. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann. Symposium on Computational Geometry 2000, 322-330. Web SearchBibTeXDownload
1999
79Rectilinear 2-center problems. Sergei Bespamyatnikh, David G. Kirkpatrick. CCCG 1999. Web SearchBibTeXDownload
78Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. David G. Kirkpatrick, Jack Snoeyink. Int. J. Comput. Geometry Appl. (9): 53-62 (1999). Web SearchBibTeXDownload
77Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink. Symposium on Computational Geometry 1999, 49-58. Web SearchBibTeXDownload
1998
76Unit disk graph recognition is NP-hard. Heinz Breu, David G. Kirkpatrick. Comput. Geom. (9): 3-24 (1998). Web SearchBibTeXDownload
75Partial and Perfect Path Covers of Cographs. David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan. Discrete Applied Mathematics (89): 143-153 (1998). Web SearchBibTeXDownload
1997
74Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler. J. Algorithms (23): 291-328 (1997). Web SearchBibTeXDownload
1996
73Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. David G. Kirkpatrick, Teresa M. Przytycka. Algorithmica (15): 172-192 (1996). Web SearchBibTeXDownload
72Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li. CCCG 1996, 217-222. Web SearchBibTeX
71Approximating Shortest Paths in Arrangements of Lines. Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink. CCCG 1996, 143-148. Web SearchBibTeX
70Determining Bar-representability for Ordered Weighted Graphs. David G. Kirkpatrick, Stephen K. Wismath. Comput. Geom. (6): 99-122 (1996). Web SearchBibTeXDownload
69A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink. Discrete & Computational Geometry (15): 73-105 (1996). Web SearchBibTeXDownload
68Rounding in Symmetric Matrices and Undirected Graphs. Pavol Hell, David G. Kirkpatrick, Brenda Li. Discrete Applied Mathematics (70): 1-21 (1996). Web SearchBibTeXDownload
67d1-Optimal Motion for a Rod (Extended Abstract). Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Symposium on Computational Geometry 1996, 252-263. Web SearchBibTeXDownload
1995
66Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. David G. Kirkpatrick, Jack Snoeyink. Fundam. Inform. (22): 353-370 (1995). Web SearchBibTeXDownload
65On the Complexity of Recognizing Intersection and Touching Graphs of Disks. Heinz Breu, David G. Kirkpatrick. Graph Drawing 1995, 88-98. Web SearchBibTeXDownload
64Linear Time Euclidean Distance Algorithms. Heinz Breu, Joseph Gil, David G. Kirkpatrick, Michael Werman. IEEE Trans. Pattern Anal. Mach. Intell. (17): 529-533 (1995). Web SearchBibTeXDownload
63Computing Common Tangents Without a Separating Line. David G. Kirkpatrick, Jack Snoeyink. WADS 1995, 183-193. Web SearchBibTeXDownload
1994
62Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. J. ACM (41): 277-310 (1994). Web SearchBibTeXDownload
1993
61Finding Extrema with Unary Predicates. David G. Kirkpatrick, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe. Algorithmica (9): 591-600 (1993). Web SearchBibTeXDownload
60Computing the Intersection-Depth of Polyhedra. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. Algorithmica (9): 518-533 (1993). Web SearchBibTeXDownload
59Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. David G. Kirkpatrick, Jack Snoeyink. CCCG 1993, 163-168. Web SearchBibTeX
58A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink. FOCS 1993, 573-582. Web SearchBibTeXDownload
57Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. Pavol Hell, David G. Kirkpatrick. J. Algorithms (14): 115-138 (1993). Web SearchBibTeXDownload
56Tentative Prune-and-Search for Computing Voronoi Vertices. David G. Kirkpatrick, Jack Snoeyink. Symposium on Computational Geometry 1993, 133-142. Web SearchBibTeXDownload
1992
55Polygon Triangulation in O (n log log n) Time with Simple Data Structures. David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan. Discrete & Computational Geometry (7): 329-346 (1992). Web SearchBibTeXDownload
54Quantitative Steinitz's Theorems Applications to Multifingered Grasping. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap. Discrete & Computational Geometry (7): 295-318 (1992). Web SearchBibTeXDownload
1991
53Probabilistic Leader Election on Rings of Known Size. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. WADS 1991, 481-495. Web SearchBibTeXDownload
1990
52Parallel recognition of complement reducible graphs and cotree construction. David G. Kirkpatrick, Teresa M. Przytycka. Discrete Applied Mathematics (29): 79-96 (1990). Web SearchBibTeXDownload
51Parallel algorithms for fractional and maximal independent sets in planar graphs. Norm Dadoun, David G. Kirkpatrick. Discrete Applied Mathematics (27): 69-83 (1990). Web SearchBibTeXDownload
50A simple existence criterion for (g<f)- factors. Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu. Discrete Mathematics (85): 313-317 (1990). Web SearchBibTeXDownload
49Determining the Separation of Preprocessed Polyhedra - A Unified Approach. David P. Dobkin, David G. Kirkpatrick. ICALP 1990, 400-413. Web SearchBibTeXDownload
48Finding Extrema with Unary Predicates. David G. Kirkpatrick, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe. SIGAL International Symposium on Algorithms 1990, 156-164. Web SearchBibTeXDownload
47Implicitly Searching Convolutions and Computing Depth of Collision. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. SIGAL International Symposium on Algorithms 1990, 165-180. Web SearchBibTeXDownload
46Parallel Construction of near Optimal binary Trees. David G. Kirkpatrick, Teresa M. Przytycka. SPAA 1990, 234-243. Web SearchBibTeXDownload
45An optimal parallel minimax tree algorithm. David G. Kirkpatrick, Teresa M. Przytycka. SPDP 1990, 293-300. Web SearchBibTeXDownload
44Quantitative Steinitz's Theorems with Applications to Multifingered Grasping. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap. STOC 1990, 341-351. Web SearchBibTeXDownload
43Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan. Symposium on Computational Geometry 1990, 34-43. Web SearchBibTeXDownload
1989
42Randomized Function Evaluation on a Ring. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. Distributed Computing (3): 107-117 (1989). Web SearchBibTeXDownload
41A Simple Parallel Tree Contraction Algorithm. Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka. J. Algorithms (10): 287-302 (1989). Web SearchBibTeXDownload
40Parallel Construction of Subdivision Hierarchies. N. Dadoun, David G. Kirkpatrick. J. Comput. Syst. Sci. (39): 153-165 (1989). Web SearchBibTeXDownload
39The Bit Complexity of Randomized Leader Election on a Ring. Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick. SIAM J. Comput. (18): 12-29 (1989). Web SearchBibTeXDownload
38Determining Sector Visibility of a Polygon. Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint. Symposium on Computational Geometry 1989, 247-253. Web SearchBibTeXDownload
37Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). David G. Kirkpatrick, Stephen K. Wismath. WADS 1989, 325-334. Web SearchBibTeX
1988
36Establishing Order in Planar Subdivisions. David G. Kirkpatrick. Discrete &amp; Computational Geometry (3): 267-280 (1988). Web SearchBibTeXDownload
35Addition Requirements for Matrix and Transposed Matrix Products. Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty. J. Algorithms (9): 354-364 (1988). Web SearchBibTeXDownload
34On Restricted Two-Factors. Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz. SIAM J. Discrete Math. (1): 472-484 (1988). Web SearchBibTeXDownload
1987
33Establishing Order in Planar Subdivisions. David G. Kirkpatrick. Symposium on Computational Geometry 1987, 316-321. Web SearchBibTeXDownload
32Parallel Processing for Efficient Subdivision Search. N. Dadoun, David G. Kirkpatrick. Symposium on Computational Geometry 1987, 205-214. Web SearchBibTeXDownload
31Randomized Function on a Ring (Preliminary Version). Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. WDAG 1987, 324-331. Web SearchBibTeXDownload
1986
30A note onf-factors in directed and undirected multigraphs. Pierre Fraisse, Pavol Hell, David G. Kirkpatrick. Graphs and Combinatorics (2): 61-66 (1986). Web SearchBibTeXDownload
29Probabilistic Solitude Verification on a Ring. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick. PODC 1986, 161-173. Web SearchBibTeXDownload
28The Ultimate Planar Convex Hull Algorithm?. David G. Kirkpatrick, Raimund Seidel. SIAM J. Comput. (15): 287-299 (1986). Web SearchBibTeXDownload
1985
27A Linear Algorithm for Determining the Separation of Convex Polyhedra. David P. Dobkin, David G. Kirkpatrick. J. Algorithms (6): 381-392 (1985). Web SearchBibTeXDownload
26Alphabetic Minimax Trees. David G. Kirkpatrick, Maria M. Klawe. SIAM J. Comput. (14): 514-526 (1985). Web SearchBibTeXDownload
25Output-size sensitive algorithms for finding maximal vectors. David G. Kirkpatrick, Raimund Seidel. Symposium on Computational Geometry 1985, 89-96. Web SearchBibTeXDownload
24The geometry of beam tracing. Norm Dadoun, David G. Kirkpatrick, John P. Walsh. Symposium on Computational Geometry 1985, 55-61. Web SearchBibTeXDownload
1984
23Packings by cliques and by finite families of graphs. Pavol Hell, David G. Kirkpatrick. Discrete Mathematics (49): 45-59 (1984). Web SearchBibTeXDownload
22Upper Bounds for Sorting Integers on Random Access Machines. David G. Kirkpatrick, Stefan Reisch. Theor. Comput. Sci. (28): 263-276 (1984). Web SearchBibTeXDownload
1983
21On the shape of a set of points in the plane. Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel. IEEE Transactions on Information Theory (29): 551-558 (1983). Web SearchBibTeXDownload
20Dynamic Voronoi diagrams. I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad. IEEE Transactions on Information Theory (29): 724-730 (1983). Web SearchBibTeXDownload
19On pseudosimilarity in trees. David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil. J. Comb. Theory, Ser. B (34): 323-339 (1983). Web SearchBibTeXDownload
18Optimal Search in Planar Subdivisions. David G. Kirkpatrick. SIAM J. Comput. (12): 28-35 (1983). Web SearchBibTeXDownload
17On the Complexity of General Graph Factor Problems. David G. Kirkpatrick, Pavol Hell. SIAM J. Comput. (12): 601-609 (1983). Web SearchBibTeXDownload
16Fast Detection of Polyhedral Intersection. David P. Dobkin, David G. Kirkpatrick. Theor. Comput. Sci. (27): 241-253 (1983). Web SearchBibTeXDownload
1982
15Fast Detection of Polyhedral Intersections. David P. Dobkin, David G. Kirkpatrick. ICALP 1982, 154-165. Web SearchBibTeXDownload
14Polygonal Intersection Searching. Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick. Inf. Process. Lett. (14): 74-79 (1982). Web SearchBibTeXDownload
13Foundations for Multifile Design by Application Partitioning. Doron Rotem, Frank Wm. Tompa, David G. Kirkpatrick. PODS 1982, 262-267. Web SearchBibTeXDownload
1981
12On Generalized Matching Problems. Pavol Hell, David G. Kirkpatrick. Inf. Process. Lett. (12): 33-35 (1981). Web SearchBibTeXDownload
11A Unified Lower Bound for Selection and Set Partitioning Problems. David G. Kirkpatrick. J. ACM (28): 150-165 (1981). Web SearchBibTeXDownload
10Forest embeddings in regular graphs of large girth. David G. Kirkpatrick, Derek G. Corneil. J. Comb. Theory, Ser. B (30): 45-60 (1981). Web SearchBibTeXDownload
9A 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. (22): 351-364 (1981). Web SearchBibTeXDownload
1980
8A Note on Delaunay and Optimal Triangulations. David G. Kirkpatrick. Inf. Process. Lett. (10): 127-128 (1980). Web SearchBibTeXDownload
7A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. Derek G. Corneil, David G. Kirkpatrick. SIAM J. Comput. (9): 281-297 (1980). Web SearchBibTeXDownload
1979
6A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa. FOCS 1979, 319-327. Web SearchBibTeXDownload
5Efficient Computation of Continuous Skeletons. David G. Kirkpatrick. FOCS 1979, 18-27. Web SearchBibTeXDownload
1978
4On the Completeness of a Generalized Matching Problem. David G. Kirkpatrick, Pavol Hell. STOC 1978, 240-245. Web SearchBibTeXDownload
1977
3Adequate Requirements for Rational Functions. David G. Kirkpatrick, Zvi M. Kedem. SIAM J. Comput. (6): 188-199 (1977). Web SearchBibTeXDownload
1974
2Determining Graph Properties from Matrix Representations. David G. Kirkpatrick. STOC 1974, 84-90. Web SearchBibTeXDownload
1972
1On the Additions Necessary to Compute Certain Functions. David G. Kirkpatrick. STOC 1972, 94-101. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research