David G. Kirkpatrick

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

Coauthor Index

1	Karl R. Abrahamson	[30] [31] [37] [39] [40] [53] [62] [74]
2	Andrew Adler	[30] [31] [37] [40] [53] [62] [74]
3	Victor Alvarez	[134]
4	Francois Anton (François Anton)	[96]
5	Daniel Archambault	[105] [107]
6	Tetsuo Asano	[71] [92] [101] [103] [115] [124]
7	Jonathan Backer	[116] [117] [120]
8	Sergey Bereg (Sergei Bespamyatnikh)	[78] [79] [80] [84] [85] [89] [94] [95] [108] [111] [113] [124] [126]
9	Binay K. Bhattacharya	[42] [84] [85] [89] [95] [111]
10	Allan Borodin	[5] [9]
11	Prosenjit Bose	[72] [73] [93] [98] [110] [113]
12	Heinz Breu	[63] [66] [76]
13	Nader H. Bshouty	[35]
14	Derek G. Corneil	[7] [10] [19]
15	Norm Dadoun	[27] [33] [38] [39] [45]
16	Luc Devroye	[93] [110]
17	David P. Dobkin	[15] [16] [25] [50] [52] [58]
18	Stephane Durocher	[97] [100] [106] [109] [112] [119] [121] [123] [127]
19	Herbert Edelsbrunner	[13] [21]
20	William S. Evans	[73] [82] [87] [93] [102] [104] [105] [107] [110] [114] [129]
21	Michael J. Fischer	[5] [9]
22	Pierre Fraisse	[29]
23	Feng Gao	[51] [57]
24	Rachel Gelbart	[37]
25	Ellen Gethner	[139]
26	Joseph Gil (Yossi Gil)	[63]
27	I. G. Gowda	[20]
28	Leonidas J. Guibas	[57]
29	Katherine Heinrich	[43]
30	Pavol Hell	[4] [12] [17] [23] [29] [34] [43] [56] [67] [122]
31	John Hershberger	[50] [58]
32	Lisa Higham	[30] [31] [37] [40] [53] [62] [74]
33	Zohreh Jabbari	[129]
34	Michael Kaminski	[35]
35	Zvi M. Kedem	[3]
36	J. Mark Keil	[84] [89]
37	Lutz Kettner	[88] [99]
38	James King	[128] [131]
39	Maria M. Klawe	[19] [24] [46] [54]
40	Irina Kostitsyna	[135]
41	Jan Kratochvíl	[34]
42	Igor Kríz	[34]
43	William T. Laaser	[57]
44	D. T. Lee (Der-Tsai Lee)	[20]
45	Brenda Li	[67]
46	Zaiqing Li	[72] [98]
47	Guizhen Liu	[43]
48	Nancy A. Lynch	[5] [9]
49	Andrea Mantler	[99]
50	Hermann A. Maurer	[13]
51	Michael McAllister	[60] [68] [73]
52	Darka Mioc	[96]
53	Bud Mishra (Bhubaneswar Mishra)	[47] [55]
54	Amnon Naamad	[20]
55	Lata Narayanan	[121] [127]
56	Nicholas Pippenger	[139]
57	Valentin Polishchuk	[135]
58	Teresa M. Przytycka	[39] [44] [48] [49] [70]
59	C. Pandu Rangan (Chandrasekaran Pandu Rangan)	[75]
60	Madhukar K. Reddy	[75]
61	Stefan Reisch	[22]
62	Doron Rotem	[14]
63	James B. Saxe	[57]
64	Michael Segal	[84] [85] [89] [95] [111]
65	Raimund Seidel	[21] [26] [28] [134]
66	Jack Snoeyink	[59] [60] [61] [64] [65] [68] [73] [77] [78] [80] [81] [90] [99]
67	Bettina Speckmann	[81] [83] [88] [90] [91] [99]
68	Anand Srinivasan	[75]
69	Subhash Suri	[50] [58]
70	Fumihiko Takeuchi	[99]
71	Robert Endre Tarjan	[46] [54]
72	Frank Wm. Tompa	[14]
73	Martin Tompa	[5] [9]
74	Godfried T. Toussaint	[42]
75	G. Townsend	[87]
76	Kuan-Chieh Robert Tseng	[133] [136]
77	Wei-Lung Dustin Tseng	[118]
78	John P. Walsh	[27]
79	Michael Werman	[63]
80	Stephen K. Wismath	[41] [69]
81	Chee-Keng Yap (Chee Yap)	[47] [55] [71] [92] [101] [103]
82	Sandra Zilles	[132]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page