Stefan Näher

2008
40		Stefan Näher, Daniel Schmitt: A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem. CCCG 2008
39	EE	Stefan Näher: Das Travelling Salesman Problem. Taschenbuch der Algorithmen 2008: 413-422
2007
38		Stefan Näher, Martin Taphorn: Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. CCCG 2007: 41-44
2005
37	EE	Stefan Funke, Kurt Mehlhorn, Stefan Näher: Structural filtering: a paradigm for efficient and exact geometric programs. Comput. Geom. 31(3): 179-194 (2005)
2002
36	EE	Stefan Näher, Oliver Zlotowski: Design and Implementation of Efficient Data Types for Static Graphs. ESA 2002: 748-759
2001
35		Stefan Näher, Dorothea Wagner: Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings Springer 2001
34	EE	Matthias Bäsken, Stefan Näher: GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms. Software Visualization 2001: 88-100
2000
33	EE	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher: Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50
1999
32		Kurt Mehlhorn, Stefan Näher: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press 1999
31	EE	Stefan Funke, Kurt Mehlhorn, Stefan Näher: Structural filtering: A paradigm for efficient and exact geometric programs. CCCG 1999
30		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
29	EE	Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert: A Library of Algorithms for Graph Drawing. Graph Drawing 1998: 456-457
28		Kurt Mehlhorn, Stefan Näher: From Algorithms to Working Programs on the Use of Program Checking in LEDA. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 81-88
27	EE	Kurt Mehlhorn, Stefan Näher: From Algorithms to Working Programs: On the Use of Program Checking in LEDA. MFCS 1998: 84-93
26		Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler: A computational basis for higher-dimensional computational geometry and applications. Comput. Geom. 10(4): 289-303 (1998)
1997
25		Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform of Combinatorial and Geometric Computing. ICALP 1997: 7-16
24	EE	Kurt Mehlhorn, Michael Müller, Stefan Näher, Stefan Schirra, Michael Seel, Christian Uhrig, Joachim Ziegler: A Computational Basis for Higher-Dimensional Computational Geometry and Applications. Symposium on Computational Geometry 1997: 254-263
1996
23		Kurt Mehlhorn, Stefan Näher, Christian Uhrig: The LEDA Platform for Combinatorial and Geometric Computing. GI Jahrestagung 1996: 43-50
22	EE	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
1995
21	EE	Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Exact Geometric Computation in LEDA. Symposium on Computational Geometry 1995: C18-C19
20		Kurt Mehlhorn, Stefan Näher: LEDA: A Platform for Combinatorial and Geometric Computing. Commun. ACM 38(1): 96-102 (1995)
1994
19		Kurt Mehlhorn, Stefan Näher: The Implementation of Geometric Algorithms. IFIP Congress (1) 1994: 223-231
1993
18		Stefan Näher: LEDA: A Library of Efficient Data Types and Algorithms. STACS 1993: 710-711
1992
17		Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig: Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms 1992: 25-43
16		Kurt Mehlhorn, Stefan Näher: Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. IFIP Congress (1) 1992: 493-505
15		Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992)
1990
14		Stefan Näher, Kurt Mehlhorn: LEDA - A Library of Efficient Data Types and Algorithms. GI Jahrestagung (1) 1990: 35-39
13		Stefan Näher, Kurt Mehlhorn: LEDA: A Library of Efficient Data Types and Algorithms. ICALP 1990: 1-5
12	EE	Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Symposium on Computational Geometry 1990: 281-289
11		Kurt Mehlhorn, Stefan Näher: Dynamic Fractional Cascading. Algorithmica 5(2): 215-241 (1990)
10	EE	Kurt Mehlhorn, Stefan Näher: A faster compaction algorithm with automatic jog insertion. IEEE Trans. on CAD of Integrated Circuits and Systems 9(2): 158-166 (1990)
9		Kurt Mehlhorn, Stefan Näher, Christian Uhrig: Hidden Line Elimination for Isooriented Rectangels. Inf. Process. Lett. 35(3): 137-143 (1990)
8		Kurt Mehlhorn, Stefan Näher: Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. Inf. Process. Lett. 35(4): 183-189 (1990)
7		Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19(5): 902-906 (1990)
1989
6		Kurt Mehlhorn, Stefan Näher, Monika Rauch: On the Complexity of a Game Related to the Dictionary Problem FOCS 1989: 546-548
5		Kurt Mehlhorn, Stefan Näher: LEDA: A Library of Efficient Data Types and Algorithms. MFCS 1989: 88-106
1988
4		Kurt Mehlhorn, Stefan Näher, Helmut Alt: A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM J. Comput. 17(6): 1093-1102 (1988)
1987
3		Kurt Mehlhorn, Stefan Näher, Helmut Alt: A Lower Bound for the Complexity of the Union-Split-Find Problem. ICALP 1987: 479-488
2		Otfried Fries, Kurt Mehlhorn, Stefan Näher, Athanasios K. Tsakalidis: A log log n Data Structure for Three-Sided Range Queries. Inf. Process. Lett. 25(4): 269-273 (1987)
1982
1		Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter: A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. 15(3): 135-136 (1982)

Coauthor Index

1	David Alberts	[29]
2	Helmut Alt	[3] [4] [12] [15]
3	Dirk Ambras	[29]
4	Matthias Bäsken	[34]
5	Michael Becker	[1]
6	Ralf Brockenauer	[29]
7	Christoph Buchheim	[29]
8	Christoph Burnikel	[21]
9	W. Degenhardt	[1]
10	Camil Demetrescu	[33]
11	Jürgen Doenhardt	[1]
12	Sergej Fialko	[29]
13	Irene Finocchi	[33]
14	Rudolf Fleischer	[12] [15] [17]
15	Otfried Fries	[2] [17]
16	Stefan Funke	[31] [37]
17	Carsten Gutwenger	[29]
18	Monika Rauch Henzinger (Monika Rauch)	[6] [7]
19	Stefan Hertel	[1]
20	Giuseppe F. Italiano	[33]
21	Michael Jünger	[29]
22	Gerd Kaninke	[1]
23	Michael Kaufmann	[12] [15]
24	W. Kerber	[1]
25	Gunnar W. Klau	[29]
26	Gunter Koch	[29]
27	Jochen Könemann	[21]
28	Michael Krüger	[29]
29	Sebastian Leipert	[29]
30	Kurt Mehlhorn	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [30] [31] [32] [37]
31	Stefan Meiser	[17]
32	Michael Müller	[24] [26]
33	Petra Mutzel	[29]
34	Hans Rohnert	[1] [17]
35	Thomas Schilz	[22] [30]
36	Stefan Schirra	[12] [15] [17] [21] [22] [24] [26] [30]
37	Daniel Schmitt	[40]
38	Michael Seel	[22] [24] [26] [30]
39	Raimund Seidel	[22] [30]
40	Klaus Simon	[17]
41	Martin Taphorn	[38]
42	Athanasios K. Tsakalidis	[2] [17]
43	Christian Uhrig	[9] [12] [15] [17] [21] [22] [23] [24] [25] [26] [30]
44	Dorothea Wagner	[35]
45	Thomas Winter	[1]
46	Joachim Ziegler	[24] [26]
47	Thomas Ziegler	[29]
48	Oliver Zlotowski	[36]

Colors in the list of coauthors