The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David G. Kirkpatrick: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David G. Kirkpatrick
    Optimal Search in Planar Subdivisions. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:28-35 [Journal]
  2. Doron Rotem, Frank Wm. Tompa, David G. Kirkpatrick
    Foundations for Multifile Design by Application Partitioning. [Citation Graph (2, 4)][DBLP]
    PODS, 1982, pp:262-267 [Conf]
  3. David G. Kirkpatrick, Raimund Seidel
    The Ultimate Planar Convex Hull Algorithm? [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:287-299 [Journal]
  4. Sergei Bespamyatnikh, David Kirkpatrick
    Rectilinear 2-center problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  5. Francois Anton, David G. Kirkpatrick, Darka Mioc
    An exact algebraic predicate for maintaining the topology of the voronoi diagram for circles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:72-76 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:10-13 [Conf]
  7. Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
    Approximating Shortest Paths in Arrangements of Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:143-148 [Conf]
  8. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
    Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:217-222 [Conf]
  9. Stephane Durocher, David G. Kirkpatrick
    On the hardness of turn-angle-restricted rectilinear cycle cover problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:13-16 [Conf]
  10. Stephane Durocher, David G. Kirkpatrick
    The Gaussian Centre of a Set of Mobile Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:123-127 [Conf]
  11. Stephane Durocher, David G. Kirkpatrick
    The gaussian centre and the projection centre of a set of points in r3. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:140-144 [Conf]
  12. Stephane Durocher, David G. Kirkpatrick
    The Projection Median of a Set of Points in R2. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:47-51 [Conf]
  13. William S. Evans, Daniel Archambault, David G. Kirkpatrick
    Computing the set of all distant horizons of a terrain. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:76-79 [Conf]
  14. Lutz Kettner, David G. Kirkpatrick, Bettina Speckmann
    Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:117-120 [Conf]
  15. David G. Kirkpatrick
    Guarding Alcove-Free Galleries . [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  16. David G. Kirkpatrick, Jack Snoeyink
    Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:163-168 [Conf]
  17. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    Pseudo approximation algorithms, with applications to optimal motion planning. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:170-178 [Conf]
  18. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    d1-Optimal Motion for a Rod (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:252-263 [Conf]
  19. Sergey Bereg, David G. Kirkpatrick
    Curvature-bounded traversals of narrow corridors. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:278-287 [Conf]
  20. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:49-58 [Conf]
  21. Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
    Determining Sector Visibility of a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:247-253 [Conf]
  22. N. Dadoun, David G. Kirkpatrick
    Parallel Processing for Efficient Subdivision Search. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:205-214 [Conf]
  23. David G. Kirkpatrick
    Establishing Order in Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:316-321 [Conf]
  24. David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan
    Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:34-43 [Conf]
  25. David G. Kirkpatrick, Bettina Speckmann
    Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:179-188 [Conf]
  26. David G. Kirkpatrick, Jack Snoeyink
    Tentative Prune-and-Search for Computing Voronoi Vertices. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:133-142 [Conf]
  27. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
    Kinetic collision detection for simple polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:322-330 [Conf]
  28. Jonathan Backer, David Kirkpatrick
    Finding curvature-constrained paths that avoid polygonal obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:66-73 [Conf]
  29. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
    Mobile facility location. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:46-53 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:100-111 [Conf]
  31. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
    A Time-Space Tradeoff for Sorting on Non-Oblivious Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:319-327 [Conf]
  32. David G. Kirkpatrick
    Efficient Computation of Continuous Skeletons [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:18-27 [Conf]
  33. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
    A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:573-582 [Conf]
  34. Heinz Breu, David G. Kirkpatrick
    On the Complexity of Recognizing Intersection and Touching Graphs of Disks. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:88-98 [Conf]
  35. David P. Dobkin, David G. Kirkpatrick
    Fast Detection of Polyhedral Intersections. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:154-165 [Conf]
  36. David P. Dobkin, David G. Kirkpatrick
    Determining the Separation of Preprocessed Polyhedra - A Unified Approach. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:400-413 [Conf]
  37. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
    Lower and Upper Bounds for Tracking Mobile Users. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:47-58 [Conf]
  38. Sergei Bespamyatnikh, David G. Kirkpatrick
    Constrained Equitable 3-Cuttings. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:72-83 [Conf]
  39. David G. Kirkpatrick, Bettina Speckmann
    Separation Sensitive Kinetic Separation Structures for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:222-236 [Conf]
  40. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
    On the Spanning Ratio of Gabriel Graphs and beta-skeletons. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:479-493 [Conf]
  41. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
    Probabilistic Solitude Verification on a Ring. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:161-173 [Conf]
  42. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Implicitly Searching Convolutions and Computing Depth of Collision. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:165-180 [Conf]
  43. David G. Kirkpatrick, Feng Gao
    Finding Extrema with Unary Predicates. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:156-164 [Conf]
  44. William S. Evans, David G. Kirkpatrick
    Restructuring ordered binary trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:477-486 [Conf]
  45. William S. Evans, David G. Kirkpatrick
    Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1041-1049 [Conf]
  46. David G. Kirkpatrick, Teresa M. Przytycka
    Parallel Construction of near Optimal binary Trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:234-243 [Conf]
  47. David G. Kirkpatrick, Teresa M. Przytycka
    An optimal parallel minimax tree algorithm. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:293-300 [Conf]
  48. David G. Kirkpatrick
    On the Additions Necessary to Compute Certain Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:94-101 [Conf]
  49. David G. Kirkpatrick
    Determining Graph Properties from Matrix Representations [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:84-90 [Conf]
  50. David G. Kirkpatrick, Pavol Hell
    On the Completeness of a Generalized Matching Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:240-245 [Conf]
  51. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
    Quantitative Steinitz's Theorems with Applications to Multifingered Grasping [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:341-351 [Conf]
  52. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
    Probabilistic Leader Election on Rings of Known Size. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:481-495 [Conf]
  53. David G. Kirkpatrick, Jack Snoeyink
    Computing Common Tangents Without a Separating Line. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:183-193 [Conf]
  54. David G. Kirkpatrick, Stephen K. Wismath
    Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:325-334 [Conf]
  55. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
    Randomized Function on a Ring (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:324-331 [Conf]
  56. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Computing the Intersection-Depth of Polyhedra. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:518-533 [Journal]
  57. William S. Evans, David G. Kirkpatrick, G. Townsend
    Right-Triangulated Irregular Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:2, pp:264-286 [Journal]
  58. Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe
    Finding Extrema with Unary Predicates. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:591-600 [Journal]
  59. David G. Kirkpatrick, Teresa M. Przytycka
    Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:2, pp:172-192 [Journal]
  60. Sergey Bereg, Prosenjit Bose, J. David Kirkpatrick
    Equitable subdivisions within polygonal regions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:20-27 [Journal]
  61. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
    Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:3, pp:209-219 [Journal]
  62. Heinz Breu, David G. Kirkpatrick
    Unit disk graph recognition is NP-hard. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:1-2, pp:3-24 [Journal]
  63. Lutz Kettner, David G. Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
    Tight degree bounds for pseudo-triangulations of points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:3-12 [Journal]
  64. David G. Kirkpatrick, Stephen K. Wismath
    Determining Bar-representability for Ordered Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:99-122 [Journal]
  65. Pavol Hell, David G. Kirkpatrick, Brenda Li
    Rounding in Symmetric Matrices and Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:1, pp:1-21 [Journal]
  66. David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan
    Partial and Perfect Path Covers of Cographs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:143-153 [Journal]
  67. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
    Randomized Function Evaluation on a Ring. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1989, v:3, n:3, pp:107-117 [Journal]
  68. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap
    Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:139-171 [Journal]
  69. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:605-622 [Journal]
  70. David G. Kirkpatrick
    Establishing Order in Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:267-280 [Journal]
  71. David G. Kirkpatrick, Maria M. Klawe, Robert Endre Tarjan
    Polygon Triangulation in O (n log log n) Time with Simple Data Structures. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:329-346 [Journal]
  72. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap
    Quantitative Steinitz's Theorems Applications to Multifingered Grasping. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:295-318 [Journal]
  73. Michael McAllister, David G. Kirkpatrick, Jack Snoeyink
    A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:73-105 [Journal]
  74. David G. Kirkpatrick, Jack Snoeyink
    Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:4, pp:353-370 [Journal]
  75. Daniel Archambault, William S. Evans, David G. Kirkpatrick
    Computing the Set of all the Distant Horizons of a Terrain. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:547-564 [Journal]
  76. David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann
    Kinetic Collision Detection for Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:3-27 [Journal]
  77. David G. Kirkpatrick, Jack Snoeyink
    Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:53-0 [Journal]
  78. Stephane Durocher, David G. Kirkpatrick
    The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:345-372 [Journal]
  79. Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick
    Polygonal Intersection Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:2, pp:74-79 [Journal]
  80. Pavol Hell, David G. Kirkpatrick
    On Generalized Matching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:33-35 [Journal]
  81. David G. Kirkpatrick
    A Note on Delaunay and Optimal Triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:3, pp:127-128 [Journal]
  82. Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick
    Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:277-310 [Journal]
  83. David G. Kirkpatrick
    A Unified Lower Bound for Selection and Set Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:150-165 [Journal]
  84. Karl R. Abrahamson, N. Dadoun, David G. Kirkpatrick, Teresa M. Przytycka
    A Simple Parallel Tree Contraction Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:287-302 [Journal]
  85. David P. Dobkin, David G. Kirkpatrick
    A Linear Algorithm for Determining the Separation of Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:381-392 [Journal]
  86. William S. Evans, David G. Kirkpatrick
    Restructuring ordered binary trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:168-193 [Journal]
  87. Pavol Hell, David G. Kirkpatrick
    Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:1, pp:115-138 [Journal]
  88. Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler
    Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:291-328 [Journal]
  89. Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty
    Addition Requirements for Matrix and Transposed Matrix Products. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:354-364 [Journal]
  90. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
    A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:351-364 [Journal]
  91. N. Dadoun, David G. Kirkpatrick
    Parallel Construction of Subdivision Hierarchies. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:2, pp:153-165 [Journal]
  92. David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil
    On pseudosimilarity in trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:323-339 [Journal]
  93. David G. Kirkpatrick, Derek G. Corneil
    Forest embeddings in regular graphs of large girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:45-60 [Journal]
  94. Heinz Breu, Joseph Gil, David G. Kirkpatrick, Michael Werman
    Linear Time Euclidean Distance Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1995, v:17, n:5, pp:529-533 [Journal]
  95. Karl R. Abrahamson, Andrew Adler, Rachel Gelbart, Lisa Higham, David G. Kirkpatrick
    The Bit Complexity of Randomized Leader Election on a Ring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:1, pp:12-29 [Journal]
  96. Derek G. Corneil, David G. Kirkpatrick
    A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:281-297 [Journal]
  97. David G. Kirkpatrick, Pavol Hell
    On the Complexity of General Graph Factor Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:601-609 [Journal]
  98. David G. Kirkpatrick, Zvi M. Kedem
    Adequate Requirements for Rational Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:188-199 [Journal]
  99. David G. Kirkpatrick, Maria M. Klawe
    Alphabetic Minimax Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:514-526 [Journal]
  100. Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz
    On Restricted Two-Factors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:4, pp:472-484 [Journal]
  101. David P. Dobkin, David G. Kirkpatrick
    Fast Detection of Polyhedral Intersection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:241-253 [Journal]
  102. David G. Kirkpatrick, Stefan Reisch
    Upper Bounds for Sorting Integers on Random Access Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:28, n:, pp:263-276 [Journal]
  103. Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel
    On the shape of a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:551-558 [Journal]
  104. I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad
    Dynamic Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:724-730 [Journal]
  105. Jonathan Backer, David Kirkpatrick
    Bounded-Curvature Path Normalization. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  106. Wei-Lung Dustin Tseng, David Kirkpatrick
    Lower bounds on average-case delay for video-on-demand broadcast protocols. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:834-842 [Conf]
  107. Pavol Hell, David G. Kirkpatrick
    Packings by cliques and by finite families of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:1, pp:45-59 [Journal]
  108. Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu
    A simple existence criterion for (g<f)- factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:3, pp:313-317 [Journal]

  109. Approximating Barrier Resilience in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  110. Finding Nearest Larger Neighbors. [Citation Graph (, )][DBLP]


  111. Determining the robustness of sensor barriers. [Citation Graph (, )][DBLP]


  112. Multi-guard covers for polygonal regions. [Citation Graph (, )][DBLP]


  113. Output-size sensitive algorithms for finding maximal vectors. [Citation Graph (, )][DBLP]


  114. The geometry of beam tracing. [Citation Graph (, )][DBLP]


  115. Hyperbolic Dovetailing. [Citation Graph (, )][DBLP]


  116. A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths. [Citation Graph (, )][DBLP]


  117. On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. [Citation Graph (, )][DBLP]


  118. Distance Trisector Curves in Regular Convex Distance Me. [Citation Graph (, )][DBLP]


  119. The projection median of a set of points. [Citation Graph (, )][DBLP]


  120. Improved Approximation for Guarding Simple Galleries from the Perimeter [Citation Graph (, )][DBLP]


  121. Parallel algorithms for fractional and maximal independent sets in planar graphs. [Citation Graph (, )][DBLP]


  122. Parallel recognition of complement reducible graphs and cotree construction. [Citation Graph (, )][DBLP]


  123. Linear-time certifying algorithms for near-graphical sequences. [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002