Raimund Seidel

	2009
72		Raimund Seidel: Maintaining Ideally Distributed Random Search Trees without Extra Space. Efficient Algorithms 2009: 134-142
	2008
71		Sascha A. Parduhn, Raimund Seidel, Reinhard Wilhelm: Algorithm visualization using concrete and abstract shape graphs. SOFTVIS 2008: 33-36
70		Raimund Seidel: Faires Teilen: Eine Weihnachtsstollengeschichte. Taschenbuch der Algorithmen 2008: 331-340
	2007
69		Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel: On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107
68		Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel: Between umbra and penumbra. Symposium on Computational Geometry 2007: 265-274
67		Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary: On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS 2007: 519-528
	2006
66		Raimund Seidel: Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). SWAT 2006: 1
65		Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. Inf. Process. Lett. 100(2): 69-71 (2006)
	2005
64		Raimund Seidel: Developments in Data Structure Research During the First 25 Years of FSTTCS. FSTTCS 2005: 48-59
63		Dierk Johannes, Raimund Seidel, Reinhard Wilhelm: Algorithm animation using shape analysis: visualising abstract executions. SOFTVIS 2005: 17-26
62		Raimund Seidel, Nicola Wolpert: On the exact computation of the topology of real algebraic curves. Symposium on Computational Geometry 2005: 107-115
61		Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices CoRR abs/cs/0507038: (2005)
60		Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel: Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geometry Appl. 15(5): 463-476 (2005)
59		Raimund Seidel, Micha Sharir: Top-Down Analysis of Path Compression. SIAM J. Comput. 34(3): 515-525 (2005)
	2003
58		Francisco Santos, Raimund Seidel: A better upper bound on the number of triangulations of a planar point set. J. Comb. Theory, Ser. A 102(1): 186-193 (2003)
	2002
57		Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel: Maximizing a Voronoi Region: The Convex Case. ISAAC 2002: 624-634
	2001
56		Reinhard Wilhelm, Tomasz Müldner, Raimund Seidel: Algorithm Explanation: Visualizing Abstract States and Invariants. Software Visualization 2001: 381-394
	2000
55		Raimund Seidel, Udo Adamy: On the Exact Worst Case Query Complexity of Planar Point Location. J. Algorithms 37(1): 189-217 (2000)
	1999
54		Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig: Checking geometric programs or verification of geometric structures. Comput. Geom. 12(1-2): 85-103 (1999)
	1998
53		Udo Adamy, Raimund Seidel: On the Exact Worst Case Query Complexity of Planar Point Location. SODA 1998: 609-618
52		Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl: Results on k-Sets and j-Facets via Continuous Motion. Symposium on Computational Geometry 1998: 192-199
51		Raimund Seidel: On the Number of Triangulations of Planar Point Sets. Combinatorica 18(2): 297-299 (1998)
50		Raimund Seidel: The Nature and Meaning of Perturbations in Geometric Computing. Discrete & Computational Geometry 19(1): 1-17 (1998)
49		Raimund Seidel: Guest Editor's Foreword. Discrete & Computational Geometry 20(3): 285-285 (1998)
	1997
48		Ioannis Z. Emiris, John F. Canny, Raimund Seidel: Efficient Perturbations for Handling Geometric Degeneracies. Algorithmica 19(1/2): 219-242 (1997)
47		David Avis, David Bremner, Raimund Seidel: How Good Are Convex Hull Algorithms?. Comput. Geom. 7: 265-301 (1997)
46		Jeff Erickson, Raimund Seidel: Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 18(2): 239-240 (1997)
	1996
45		Kurt Mehlhorn, Stefan Näher, Thomas Schilz, Stefan Schirra, Michael Seel, Raimund Seidel, Christian Uhrig: Checking Geometric Programs or Verification of Geometric Structures. Symposium on Computational Geometry 1996: 159-165
44		Raimund Seidel, Cecilia R. Aragon: Randomized Search Trees. Algorithmica 16(4/5): 464-497 (1996)
	1995
43		Raimund Seidel: The Upper Bound Theorem for Polytopes: an Easy Proof of Its Asymptotic Version. Comput. Geom. 5: 115-116 (1995)
42		Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies. Discrete & Computational Geometry 13: 41-57 (1995)
41		Raimund Seidel: On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci. 51(3): 400-403 (1995)
	1994
40		Raimund Seidel: The Nature and Meaning of Perturbations in Geometric Computing. STACS 1994: 3-17
39		Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994)
	1993
38		Raimund Seidel: Teaching Computational Geometry. CCCG 1993: 272-272
37		Jeff Erickson, Raimund Seidel: Better Lower Bounds on Detecting Affine and Spherical Degeneracies FOCS 1993: 528-536
36		Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993)
35		Boris Aronov, Raimund Seidel, Diane L. Souvaine: On Compatible Triangulations of Simple Polygons. Comput. Geom. 3: 27-35 (1993)
34		Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993)
	1992
33		Jirí Matousek, Raimund Seidel: A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP 1992: 427-438
32		Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel: Four Results on Randomized Incremental Constructions. STACS 1992: 463-474
31		Raimund Seidel: On the All-Pairs-Shortest-Path Problem STOC 1992: 745-749
30		Jim Ruppert, Raimund Seidel: On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra. Discrete & Computational Geometry 7: 227-253 (1992)
29		Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992)
	1991
28		Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science 1991: 108-123
27		Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991)
26		Raimund Seidel: A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. Comput. Geom. 1: 51-64 (1991)
25		Raimund Seidel: Small-Dimensional Linear Programming and Convex Hulls Made Easy. Discrete & Computational Geometry 6: 423-434 (1991)
24		Ziv Gigus, John F. Canny, Raimund Seidel: Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects. IEEE Trans. Pattern Anal. Mach. Intell. 13(6): 542-551 (1991)
	1990
23		Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space FOCS 1990: 242-251
22		Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Slimming Down by Adding: Selecting Heavily Covered Points. Symposium on Computational Geometry 1990: 116-127
21		Raimund Seidel: Linear Programming and Convex Hulls Made Easy. Symposium on Computational Geometry 1990: 211-215
	1989
20		Cecilia R. Aragon, Raimund Seidel: Randomized Search Trees FOCS 1989: 540-545
19		Jim Ruppert, Raimund Seidel: On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. Symposium on Computational Geometry 1989: 380-392
18		Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989)
17		Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangement of Jordan Arcs with Three Intersection per Pair. Discrete & Computational Geometry 4: 523-539 (1989)
	1988
16		Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229
15		Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangements of Jordan Arcs with Three Intersections per Pair. Symposium on Computational Geometry 1988: 258-265
14		Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69
13		William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3: 281-293 (1988)
	1987
12		William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987: 1-10
11		Raimund Seidel: On the Number of Faces in Higher-Dimensional Voronoi Diagrams. Symposium on Computational Geometry 1987: 181-185
10		Leonidas J. Guibas, Raimund Seidel: Computing Convolutions by Reciprocal Search. Discrete & Computational Geometry 2: 175-193 (1987)
	1986
9		Raimund Seidel: Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face STOC 1986: 404-413
8		Leonidas J. Guibas, Raimund Seidel: Computing Convolutions by Reciprocal Search. Symposium on Computational Geometry 1986: 90-99
7		Herbert Edelsbrunner, Raimund Seidel: Voronoi Diagrams and Arrangements. Discrete & Computational Geometry 1: 25-44 (1986)
6		David G. Kirkpatrick, Raimund Seidel: The Ultimate Planar Convex Hull Algorithm? SIAM J. Comput. 15(1): 287-299 (1986)
5		Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel: Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15(2): 341-363 (1986)
	1984
4		Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel: Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing 28(1): 92-108 (1984)
	1983
3		Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel: Constructing Arrangements of Lines and Hyperplanes with Applications FOCS 1983: 83-91
2		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)
	1981
1		Raimund Seidel: A New Method for Solving Constraint Satisfaction Problems. IJCAI 1981: 338-342

Coauthor Index

1	Udo Adamy	[53] [55]
2	Deepak Ajwani	[67]
3	Artur Andrzejak	[52]
4	Cecilia R. Aragon	[20] [44]
5	Boris Aronov	[35] [52]
6	David Avis	[47]
7	David Bremner	[47]
8	Kevin Buchin	[69]
9	John F. Canny (John Canny)	[24] [48]
10	Bernard Chazelle	[22] [23] [27] [39]
11	Kenneth L. Clarkson	[32] [36]
12	Frank K. H. A. Dehne	[57] [60]
13	Julien Demouth	[68]
14	Olivier Devillers	[68]
15	Herbert Edelsbrunner	[2] [3] [4] [5] [7] [14] [15] [16] [17] [18] [22] [23] [27] [28] [29] [34] [39]
16	Khaled M. Elbassioni	[61] [65]
17	Ioannis Z. Emiris	[48]
18	Jeff Erickson	[37] [42] [46]
19	Hazel Everett	[68]
20	Ziv Gigus	[24]
21	Marc Glisse	[68]
22	Leonidas J. Guibas	[8] [10] [14] [15] [16] [17] [18] [22] [23] [27] [29] [39]
23	Sariel Har-Peled	[52]
24	John Hershberger	[14] [15] [17] [18] [22] [39]
25	Dierk Johannes	[63]
26	David G. Kirkpatrick	[2] [6]
27	Rolf Klein	[57] [60]
28	Christian Knauer	[69]
29	Klaus Kriegel	[69]
30	Sylvain Lazard	[68]
31	William J. Lenhart (William Lenhart)	[12] [13]
32	Zvi Lotker	[61] [65]
33	Jirí Matousek	[33]
34	Kurt Mehlhorn	[32] [36] [45] [54]
35	Tomasz Müldner	[56]
36	Stefan Näher	[45] [54]
37	Joseph O'Rourke	[3] [5]
38	Mark H. Overmars	[4]
39	János Pach	[15] [16] [17] [29]
40	Sascha A. Parduhn	[71]
41	Richard Pollack	[12] [13] [15] [16] [17] [23] [27] [29]
42	Saurabh Ray	[67]
43	Jim Ruppert	[19] [30]
44	Jörg-Rüdiger Sack	[12] [13]
45	Francisco Santos	[58]
46	Thomas Schilz	[45] [54]
47	Stefan Schirra	[45] [54]
48	André Schulz	[69]
49	Michael Seel	[45] [54]
50	Micha Sharir	[12] [13] [14] [15] [16] [17] [18] [22] [23] [27] [28] [29] [34] [39] [59]
51	Jack Snoeyink	[14] [15] [17] [18] [23] [27]
52	Diane L. Souvaine	[35]
53	Subhash Suri	[12] [13]
54	Hans Raj Tiwary	[67]
55	Godfried T. Toussaint	[12] [13]
56	Christian Uhrig	[45] [54]
57	Emo Welzl	[14] [18] [52]
58	Sue Whitesides	[12] [13]
59	Reinhard Wilhelm	[56] [63] [71]
60	Nicola Wolpert (Nicola Geismann)	[62]
61	Chee-Keng Yap (Chee Yap)	[12] [13]

Colors in the list of coauthors