| 2012 | ||
|---|---|---|
| j67 | ||
| j66 | David G. Kirkpatrick: Guest Editor's Foreword. Discrete & Computational Geometry 47(4): 659-660 (2012) | |
| c72 | David Yu Cheng Chan, David G. Kirkpatrick: Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors. ALGOSENSORS 2012: 42-53 | |
| c71 | Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger: M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. FUN 2012: 198-209 | |
| i2 | Sylvester David Eriksson-Bique, David G. Kirkpatrick, Valentin Polishchuk: Discrete Dubins Paths. CoRR abs/1211.2365 (2012) | |
| 2011 | ||
| j65 | James King, David G. Kirkpatrick: Improved Approximation for Guarding Simple Galleries from the Perimeter. Discrete & Computational Geometry 46(2): 252-269 (2011) | |
| c70 | Kuan-Chieh Robert Tseng, David G. Kirkpatrick: On Barrier Resilience of Sensor Networks. ALGOSENSORS 2011: 130-144 | |
| c69 | David G. Kirkpatrick, Irina Kostitsyna, Valentin Polishchuk: Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning. CCCG 2011 | |
| c68 | Victor Alvarez, David G. Kirkpatrick, Raimund Seidel: Can Nearest Neighbor Searching Be Simple and Always Fast? ESA 2011: 82-92 | |
| c67 | ||
| c66 | ||
| 2010 | ||
| j64 | Stephane Durocher, David G. Kirkpatrick, Lata Narayanan: On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wireless Networks 16(1): 227-235 (2010) | |
| c65 | Zohreh Jabbari, William S. Evans, David G. Kirkpatrick: Multi-guard covers for polygonal regions. CCCG 2010: 5-8 | |
| c64 | ||
| i1 | James King, David G. Kirkpatrick: Improved Approximation for Guarding Simple Galleries from the Perimeter. CoRR abs/1001.4231 (2010) | |
| 2009 | ||
| j63 | Stephane Durocher, David G. Kirkpatrick: The projection median of a set of points. Comput. Geom. 42(5): 364-375 (2009) | |
| j62 | Pavol Hell, David G. Kirkpatrick: Linear-time certifying algorithms for near-graphical sequences. Discrete Mathematics 309(18): 5703-5713 (2009) | |
| c63 | Sergey Bereg, David G. Kirkpatrick: Approximating Barrier Resilience in Wireless Sensor Networks. ALGOSENSORS 2009: 29-40 | |
| c62 | Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick: Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260 | |
| c61 | ||
| 2008 | ||
| j61 | Stephane Durocher, David G. Kirkpatrick: Bounded-Velocity Approximation of Mobile Euclidean 2-Centres. Int. J. Comput. Geometry Appl. 18(3): 161-183 (2008) | |
| c60 | Stephane Durocher, David G. Kirkpatrick, Lata Narayanan: On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. ICDCN 2008: 546-557 | |
| c59 | Jonathan Backer, David G. Kirkpatrick: A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. ISAAC 2008: 628-643 | |
| 2007 | ||
| c58 | Jonathan Backer, David G. Kirkpatrick: Finding curvature-constrained paths that avoid polygonal obstacles. Symposium on Computational Geometry 2007: 66-73 | |
| c57 | Wei-Lung Dustin Tseng, David G. Kirkpatrick: Lower bounds on average-case delay for video-on-demand broadcast protocols. SODA 2007: 834-842 | |
| 2006 | ||
| j60 | Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick: Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006) | |
| j59 | Stephane Durocher, David G. Kirkpatrick: The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. Int. J. Comput. Geometry Appl. 16(4): 345-372 (2006) | |
| j58 | Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006) | |
| j57 | Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discrete Math. 20(2): 412-427 (2006) | |
| j56 | William S. Evans, David G. Kirkpatrick: Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. ACM Transactions on Algorithms 2(4): 661-678 (2006) | |
| c56 | ||
| c55 | Tetsuo Asano, David G. Kirkpatrick: Distance Trisector Curves in Regular Convex Distance Me. ISVD 2006: 8-17 | |
| 2005 | ||
| j55 | Daniel Archambault, William S. Evans, David G. Kirkpatrick: Computing the Set of all the Distant Horizons of a Terrain. Int. J. Comput. Geometry Appl. 15(6): 547-564 (2005) | |
| c54 | Stephane Durocher, David G. Kirkpatrick: The Projection Median of a Set of Points in R2. CCCG 2005: 47-51 | |
| c53 | Sergey Bereg, David G. Kirkpatrick: Curvature-bounded traversals of narrow corridors. Symposium on Computational Geometry 2005: 278-287 | |
| 2004 | ||
| j54 | Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discrete & Computational Geometry 31(1): 139-171 (2004) | |
| j53 | William S. Evans, David G. Kirkpatrick: Restructuring ordered binary trees. J. Algorithms 50(2): 168-193 (2004) | |
| c52 | William S. Evans, Daniel Archambault, David G. Kirkpatrick: Computing the set of all distant horizons of a terrain. CCCG 2004: 76-79 | |
| c51 | Stephane Durocher, David G. Kirkpatrick: The gaussian centre and the projection centre of a set of points in r3. CCCG 2004: 140-144 | |
| c50 | William S. Evans, David G. Kirkpatrick: Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. SODA 2004: 1041-1049 | |
| 2003 | ||
| j52 | Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi: Tight degree bounds for pseudo-triangulations of points. Comput. Geom. 25(1-2): 3-12 (2003) | |
| j51 | Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Comput. Geom. 26(3): 209-219 (2003) | |
| c49 | Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG 2003: 10-13 | |
| c48 | Stephane Durocher, David G. Kirkpatrick: The Gaussian Centre of a Set of Mobile Points. CCCG 2003: 123-127 | |
| 2002 | ||
| j50 | David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann: Kinetic Collision Detection for Simple Polygons. Int. J. Comput. Geometry Appl. 12(1-2): 3-27 (2002) | |
| j49 | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002) | |
| c47 | Stephane Durocher, David G. Kirkpatrick: On the hardness of turn-angle-restricted rectilinear cycle cover problems. CCCG 2002: 13-16 | |
| c46 | Francois Anton, David G. Kirkpatrick, Darka Mioc: An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. CCCG 2002: 72-76 | |
| c45 | Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo approximation algorithms, with applications to optimal motion planning. Symposium on Computational Geometry 2002: 170-178 | |
| c44 | David G. Kirkpatrick, Bettina Speckmann: Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. Symposium on Computational Geometry 2002: 179-188 | |
| c43 | Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58 | |
| c42 | ||
| c41 | Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick: On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN 2002: 479-493 | |
| 2001 | ||
| j48 | William S. Evans, David G. Kirkpatrick, G. Townsend: Right-Triangulated Irregular Networks. Algorithmica 30(2): 264-286 (2001) | |
| c40 | Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann: Tight degree bounds for pseudo-triangulations of points. CCCG 2001: 117-120 | |
| 2000 | ||
| j47 | Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete & Computational Geometry 24(4): 605-622 (2000) | |
| c39 | ||
| c38 | David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann: Kinetic collision detection for simple polygons. Symposium on Computational Geometry 2000: 322-330 | |
| c37 | Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53 | |
| c36 | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111 | |
| c35 | David G. Kirkpatrick, Bettina Speckmann: Separation Sensitive Kinetic Separation Structures for Convex Polygons. JCDCG 2000: 222-236 | |
| c34 | ||
| 1999 | ||
| j46 | David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. Int. J. Comput. Geometry Appl. 9(1): 53-62 (1999) | |
| c33 | ||
| c32 | Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Symposium on Computational Geometry 1999: 49-58 | |
| 1998 | ||
| j45 | Heinz Breu, David G. Kirkpatrick: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1-2): 3-24 (1998) | |
| j44 | David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan: Partial and Perfect Path Covers of Cographs. Discrete Applied Mathematics 89(1-3): 143-153 (1998) | |
| 1997 | ||
| j43 | Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler: Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. J. Algorithms 23(2): 291-328 (1997) | |
| 1996 | ||
| j42 | David G. Kirkpatrick, Teresa M. Przytycka: Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. Algorithmica 15(2): 172-192 (1996) | |
| j41 | David G. Kirkpatrick, Stephen K. Wismath: Determining Bar-representability for Ordered Weighted Graphs. Comput. Geom. 6: 99-122 (1996) | |
| j40 | Pavol Hell, David G. Kirkpatrick, Brenda Li: Rounding in Symmetric Matrices and Undirected Graphs. Discrete Applied Mathematics 70(1): 1-21 (1996) | |
| j39 | Michael McAllister, David G. Kirkpatrick, Jack Snoeyink: A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. Discrete & Computational Geometry 15(1): 73-105 (1996) | |
| c31 | Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink: Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148 | |
| c30 | Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li: Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. CCCG 1996: 217-222 | |
| c29 | Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: d1-Optimal Motion for a Rod (Extended Abstract). Symposium on Computational Geometry 1996: 252-263 | |
| 1995 | ||
| j38 | David G. Kirkpatrick, Jack Snoeyink: Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. Fundam. Inform. 22(4): 353-370 (1995) | |
| j37 | Heinz Breu, Joseph Gil, David G. Kirkpatrick, Michael Werman: Linear Time Euclidean Distance Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 17(5): 529-533 (1995) | |
| c28 | Heinz Breu, David G. Kirkpatrick: On the Complexity of Recognizing Intersection and Touching Graphs of Disks. Graph Drawing 1995: 88-98 | |
| c27 | David G. Kirkpatrick, Jack Snoeyink: Computing Common Tangents Without a Separating Line. WADS 1995: 183-193 | |
| 1994 | ||
| j36 | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. J. ACM 41(2): 277-310 (1994) | |
| 1993 | ||
| j35 | David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993) | |
| j34 | Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe: Finding Extrema with Unary Predicates. Algorithmica 9(6): 591-600 (1993) | |
| j33 | Pavol Hell, David G. Kirkpatrick: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. J. Algorithms 14(1): 115-138 (1993) | |
| c26 | David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. CCCG 1993: 163-168 | |
| c25 | David G. Kirkpatrick, Jack Snoeyink: Tentative Prune-and-Search for Computing Voronoi Vertices. Symposium on Computational Geometry 1993: 133-142 | |
| c24 | Michael McAllister, David G. Kirkpatrick, Jack Snoeyink: A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. FOCS 1993: 573-582 | |
| 1992 | ||
| j32 | David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap: Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discrete & Computational Geometry 7: 295-318 (1992) | |
| j31 | David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan: Polygon Triangulation in O (n log log n) Time with Simple Data Structures. Discrete & Computational Geometry 7: 329-346 (1992) | |
| 1991 | ||
| c23 | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Leader Election on Rings of Known Size. WADS 1991: 481-495 | |
| 1990 | ||
| j30 | Norm Dadoun, David G. Kirkpatrick: Parallel algorithms for fractional and maximal independent sets in planar graphs. Discrete Applied Mathematics 27(1-2): 69-83 (1990) | |
| j29 | David G. Kirkpatrick, Teresa M. Przytycka: Parallel recognition of complement reducible graphs and cotree construction. Discrete Applied Mathematics 29(1): 79-96 (1990) | |
| j28 | Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu: A simple existence criterion for (g<f)- factors. Discrete Mathematics 85(3): 313-317 (1990) | |
| c22 | David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan: Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. Symposium on Computational Geometry 1990: 34-43 | |
| c21 | David P. Dobkin, David G. Kirkpatrick: Determining the Separation of Preprocessed Polyhedra - A Unified Approach. ICALP 1990: 400-413 | |
| c20 | David G. Kirkpatrick, Feng Gao: Finding Extrema with Unary Predicates. SIGAL International Symposium on Algorithms 1990: 156-164 | |
| c19 | David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri: Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms 1990: 165-180 | |
| c18 | David G. Kirkpatrick, Teresa M. Przytycka: Parallel Construction of near Optimal binary Trees. SPAA 1990: 234-243 | |
| c17 | David G. Kirkpatrick, Teresa M. Przytycka: An optimal parallel minimax tree algorithm. SPDP 1990: 293-300 | |
| c16 | David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap: Quantitative Steinitz's Theorems with Applications to Multifingered Grasping. STOC 1990: 341-351 | |
| 1989 | ||
| j27 | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Randomized Function Evaluation on a Ring. Distributed Computing 3(3): 107-117 (1989) | |
| j26 | Karl R. Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M. Przytycka: A Simple Parallel Tree Contraction Algorithm. J. Algorithms 10(2): 287-302 (1989) | |
| j25 | Norm Dadoun, David G. Kirkpatrick: Parallel Construction of Subdivision Hierarchies. J. Comput. Syst. Sci. 39(2): 153-165 (1989) | |
| j24 | Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick: The Bit Complexity of Randomized Leader Election on a Ring. SIAM J. Comput. 18(1): 12-29 (1989) | |
| c15 | Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint: Determining Sector Visibility of a Polygon. Symposium on Computational Geometry 1989: 247-253 | |
| c14 | David G. Kirkpatrick, Stephen K. Wismath: Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). WADS 1989: 325-334 | |
| 1988 | ||
| j23 | David G. Kirkpatrick: Establishing Order in Planar Subdivisions. Discrete & Computational Geometry 3: 267-280 (1988) | |
| j22 | Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty: Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms 9(3): 354-364 (1988) | |
| j21 | Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz: On Restricted Two-Factors. SIAM J. Discrete Math. 1(4): 472-484 (1988) | |
| 1987 | ||
| c13 | Norm Dadoun, David G. Kirkpatrick: Parallel Processing for Efficient Subdivision Search. Symposium on Computational Geometry 1987: 205-214 | |
| c12 | David G. Kirkpatrick: Establishing Order in Planar Subdivisions. Symposium on Computational Geometry 1987: 316-321 | |
| c11 | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Randomized Function on a Ring (Preliminary Version). WDAG 1987: 324-331 | |
| 1986 | ||
| j20 | Pierre Fraisse, Pavol Hell, David G. Kirkpatrick: A note onf-factors in directed and undirected multigraphs. Graphs and Combinatorics 2(1): 61-66 (1986) | |
| j19 | David G. Kirkpatrick, Raimund Seidel: The Ultimate Planar Convex Hull Algorithm? SIAM J. Comput. 15(1): 287-299 (1986) | |
| c10 | Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick: Probabilistic Solitude Verification on a Ring. PODC 1986: 161-173 | |
| 1985 | ||
| j18 | David P. Dobkin, David G. Kirkpatrick: A Linear Algorithm for Determining the Separation of Convex Polyhedra. J. Algorithms 6(3): 381-392 (1985) | |
| j17 | David G. Kirkpatrick, Maria M. Klawe: Alphabetic Minimax Trees. SIAM J. Comput. 14(3): 514-526 (1985) | |
| c9 | Norm Dadoun, David G. Kirkpatrick, John P. Walsh: The geometry of beam tracing. Symposium on Computational Geometry 1985: 55-61 | |
| c8 | David G. Kirkpatrick, Raimund Seidel: Output-size sensitive algorithms for finding maximal vectors. Symposium on Computational Geometry 1985: 89-96 | |
| 1984 | ||
| j16 | Pavol Hell, David G. Kirkpatrick: Packings by cliques and by finite families of graphs. Discrete Mathematics 49(1): 45-59 (1984) | |
| j15 | David G. Kirkpatrick, Stefan Reisch: Upper Bounds for Sorting Integers on Random Access Machines. Theor. Comput. Sci. 28: 263-276 (1984) | |
| 1983 | ||
| j14 | David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil: On pseudosimilarity in trees. J. Comb. Theory, Ser. B 34(3): 323-339 (1983) | |
| j13 | ||
| j12 | David G. Kirkpatrick, Pavol Hell: On the Complexity of General Graph Factor Problems. SIAM J. Comput. 12(3): 601-609 (1983) | |
| j11 | David P. Dobkin, David G. Kirkpatrick: Fast Detection of Polyhedral Intersection. Theor. Comput. Sci. 27: 241-253 (1983) | |
| j10 | Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel: On the shape of a set of points in the plane. IEEE Transactions on Information Theory 29(4): 551-558 (1983) | |
| j9 | I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad: Dynamic Voronoi diagrams. IEEE Transactions on Information Theory 29(5): 724-730 (1983) | |
| 1982 | ||
| j8 | Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick: Polygonal Intersection Searching. Inf. Process. Lett. 14(2): 74-79 (1982) | |
| c7 | David P. Dobkin, David G. Kirkpatrick: Fast Detection of Polyhedral Intersections. ICALP 1982: 154-165 | |
| c6 | Doron Rotem, Frank Wm. Tompa, David G. Kirkpatrick: Foundations for Multifile Design by Application Partitioning. PODS 1982: 262-267 | |
| 1981 | ||
| j7 | Pavol Hell, David G. Kirkpatrick: On Generalized Matching Problems. Inf. Process. Lett. 12(1): 33-35 (1981) | |
| j6 | David G. Kirkpatrick: A Unified Lower Bound for Selection and Set Partitioning Problems. J. ACM 28(1): 150-165 (1981) | |
| j5 | Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa: A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. 22(3): 351-364 (1981) | |
| j4 | David G. Kirkpatrick, Derek G. Corneil: Forest embeddings in regular graphs of large girth. J. Comb. Theory, Ser. B 30(1): 45-60 (1981) | |
| 1980 | ||
| j3 | David G. Kirkpatrick: A Note on Delaunay and Optimal Triangulations. Inf. Process. Lett. 10(3): 127-128 (1980) | |
| j2 | Derek G. Corneil, David G. Kirkpatrick: A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. SIAM J. Comput. 9(2): 281-297 (1980) | |
| 1979 | ||
| c5 | ||
| c4 | Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa: A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. FOCS 1979: 319-327 | |
| 1978 | ||
| c3 | David G. Kirkpatrick, Pavol Hell: On the Completeness of a Generalized Matching Problem. STOC 1978: 240-245 | |
| 1977 | ||
| j1 | David G. Kirkpatrick, Zvi M. Kedem: Adequate Requirements for Rational Functions. SIAM J. Comput. 6(1): 188-199 (1977) | |
| 1974 | ||
| c2 | ||
| 1972 | ||
| c1 | ||
Colors in the list of coauthors
Last update Thu May 23 22:51:02 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page