Frank Geraets

Frank Wagner

2007
31		Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis: Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers Springer 2007
2003
30		Frank Wagner, Jochen Eichert, Roman Schirra: Management Of Virtual Enterprises: A Case Study Of German Rapid Prototyping SMES. PRO-VE 2003: 493-500
2001
29	EE	Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk: Three Rules Suffice for Good Label Placement. Algorithmica 30(2): 334-349 (2001)
28	EE	Frank Wagner: A Complete Model of the Deutsche Bahn - Prosim and Beyond. Electr. Notes Theor. Comput. Sci. 50(1): (2001)
27	EE	Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner: Locating New Stops in a Railway Network. Electr. Notes Theor. Comput. Sci. 50(1): (2001)
26		Frank Wagner: Fields of Finite Morley Rank. J. Symb. Log. 66(2): 703-706 (2001)
2000
25	EE	Gabriele Neyer, Frank Wagner: Labeling Downtown. CIAC 2000: 113-124
24	EE	Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)
23		Oleg V. Belegradek, Ya'acov Peterzil, Frank Wagner: Quasi-O-Minimal Structures. J. Symb. Log. 65(3): 1115-1132 (2000)
1998
22	EE	Frank Wagner, Alexander Wolff: A Combinatorial Framework for Map Labeling. Graph Drawing 1998: 316-331
21	EE	Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. ICALP 1998: 556-567
1997
20		Frank Wagner, Alexander Wolff: A Practical Map Labeling Algorithm. Comput. Geom. 7: 387-404 (1997)
19	EE	Mechthild Stoer, Frank Wagner: A simple min-cut algorithm. J. ACM 44(4): 585-591 (1997)
1996
18		Ruth Kuchem, Dorothea Wagner, Frank Wagner: Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996)
1995
17		Frank Wagner, Alexander Wolff: An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA 1995: 420-433
16	EE	Frank Wagner, Alexander Wolff: Map Labeling Heuristics: Provably Good and Practically Useful. Symposium on Computational Geometry 1995: 109-118
1994
15		Mechthild Stoer, Frank Wagner: A Simple Min Cut Algorithm. ESA 1994: 141-147
14	EE	Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner: Faster Isometric Embedding in Products of Complete Graphs. Discrete Applied Mathematics 52(1): 17-28 (1994)
13		Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994)
12		Frank Wagner: Approximate Map Labeling is in Omega (n log n). Inf. Process. Lett. 52(3): 161-165 (1994)
1993
11		Dorothea Wagner, Frank Wagner: Between Min Cut and Graph Bisection. MFCS 1993: 744-750
10		Edmund Ihler, Dorothea Wagner, Frank Wagner: Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993)
9		Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993)
1992
8		Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399
7		Dorothea Wagner, Frank Wagner: An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discrete Applied Mathematics 40(1): 73-81 (1992)
1991
6		Frank Wagner, Barbara Wolfers: Short Wire Routing in Convex Grids. ISA 1991: 72-82
5		Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482
4	EE	Michael Formann, Frank Wagner: A Packing Problem with Applications to Lettering of Maps. Symposium on Computational Geometry 1991: 281-288
1990
3		Michael Formann, Frank Wagner: The VLSI layout in various embedding models. WG 1990: 130-139
1989
2		Ruth Kuchem, Dorothea Wagner, Frank Wagner: Area-Optimal Three-Layer Channel Routing FOCS 1989: 506-511
1986
1		Frank Wagner: Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. CONPAR 1986: 345-352

Coauthor Index

1	Franz Aurenhammer	[14]
2	Oleg V. Belegradek	[23]
3	Shiva Chaudhuri	[21] [24]
4	Jochen Eichert	[30]
5	Michael Formann	[3] [4] [5] [9] [14]
6	Horst W. Hamacher	[27]
7	Ramana M. Idury	[14]
8	Edmund Ihler	[10]
9	Vikas Kapoor	[29]
10	Leo G. Kroon	[31]
11	Ruth Kuchem	[2] [18]
12	Annegret Liebers	[27]
13	Gabriele Neyer	[25]
14	Ya'acov Peterzil	[23]
15	Majid Sarrafzadeh	[8] [13]
16	Alejandro A. Schäffer	[14]
17	Roman Schirra	[30]
18	Anita Schöbel	[27] [31]
19	Mechthild Stoer	[15] [19]
20	Tycho Strijk	[29]
21	K. V. Subrahmanyam	[21] [24]
22	Dorothea Wagner	[2] [5] [7] [8] [9] [10] [11] [13] [18] [27] [31]
23	Karsten Weihe	[8] [13]
24	Barbara Wolfers	[6]
25	Alexander Wolff	[16] [17] [20] [22] [29]
26	Christos D. Zaroliagis	[21] [24] [31]

Colors in the list of coauthors