Frank Geraets

Frank Wagner

2008
34	EE	Frank Wagner, Kathleen Krebs, Cataldo Mega, Bernhard Mitschang, Norbert Ritter: Towards the Design of a Scalable Email Archiving and Discovery Solution. ADBIS 2008: 305-320
33	EE	Frank Wagner, Kathleen Krebs, Cataldo Mega, Bernhard Mitschang, Norbert Ritter: Email Archiving and Discovery as a Service. IDC 2008: 197-206
2007
32		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
31		Frank Wagner, Jochen Eichert, Roman Schirra: Management Of Virtual Enterprises: A Case Study Of German Rapid Prototyping SMES. PRO-VE 2003: 493-500
2001
30	EE	Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk: Three Rules Suffice for Good Label Placement. Algorithmica 30(2): 334-349 (2001)
29	EE	Frank Wagner: A Complete Model of the Deutsche Bahn - Prosim and Beyond. Electr. Notes Theor. Comput. Sci. 50(1): (2001)
28	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)
27		Frank Wagner: Fields of Finite Morley Rank. J. Symb. Log. 66(2): 703-706 (2001)
2000
26	EE	Gabriele Neyer, Frank Wagner: Labeling Downtown. CIAC 2000: 113-124
25	EE	Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)
24		Oleg V. Belegradek, Ya'acov Peterzil, Frank Wagner: Quasi-O-Minimal Structures. J. Symb. Log. 65(3): 1115-1132 (2000)
1998
23	EE	Frank Wagner, Alexander Wolff: A Combinatorial Framework for Map Labeling. Graph Drawing 1998: 316-331
22	EE	Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. ICALP 1998: 556-567
1997
21		Frank Wagner, Alexander Wolff: A Practical Map Labeling Algorithm. Comput. Geom. 7: 387-404 (1997)
20	EE	Mechthild Stoer, Frank Wagner: A simple min-cut algorithm. J. ACM 44(4): 585-591 (1997)
1996
19		Ruth Kuchem, Dorothea Wagner, Frank Wagner: Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996)
1995
18		Frank Wagner, Alexander Wolff: An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA 1995: 420-433
17	EE	Frank Wagner, Alexander Wolff: Map Labeling Heuristics: Provably Good and Practically Useful. Symposium on Computational Geometry 1995: 109-118
1994
16		Mechthild Stoer, Frank Wagner: A Simple Min Cut Algorithm. ESA 1994: 141-147
15	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)
14		Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994)
13		Frank Wagner: Approximate Map Labeling is in Omega (n log n). Inf. Process. Lett. 52(3): 161-165 (1994)
1993
12		Dorothea Wagner, Frank Wagner: Between Min Cut and Graph Bisection. MFCS 1993: 744-750
11		Edmund Ihler, Dorothea Wagner, Frank Wagner: Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993)
10		Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993)
1992
9		Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399
8		Dorothea Wagner, Frank Wagner: An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discrete Applied Mathematics 40(1): 73-81 (1992)
1991
7		Frank Wagner, Barbara Wolfers: Short Wire Routing in Convex Grids. ISA 1991: 72-82
6		Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482
5	EE	Michael Formann, Frank Wagner: A Packing Problem with Applications to Lettering of Maps. Symposium on Computational Geometry 1991: 281-288
4	EE	Dorothea Wagner, Frank Wagner: A generalization of the zero-one principle for sorting algorithms. Discrete Applied Mathematics 30(2-3): 265-273 (1991)
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	[15]
2	Oleg V. Belegradek	[24]
3	Shiva Chaudhuri	[22] [25]
4	Jochen Eichert	[31]
5	Michael Formann	[3] [5] [6] [10] [15]
6	Horst W. Hamacher	[28]
7	Ramana M. Idury	[15]
8	Edmund Ihler	[11]
9	Vikas Kapoor	[30]
10	Kathleen Krebs	[33] [34]
11	Leo G. Kroon	[32]
12	Ruth Kuchem	[2] [19]
13	Annegret Liebers	[28]
14	Cataldo Mega	[33] [34]
15	Bernhard Mitschang	[33] [34]
16	Gabriele Neyer	[26]
17	Ya'acov Peterzil	[24]
18	Norbert Ritter	[33] [34]
19	Majid Sarrafzadeh	[9] [14]
20	Alejandro A. Schäffer	[15]
21	Roman Schirra	[31]
22	Anita Schöbel	[28] [32]
23	Mechthild Stoer	[16] [20]
24	Tycho Strijk	[30]
25	K. V. Subrahmanyam	[22] [25]
26	Dorothea Wagner	[2] [4] [6] [8] [9] [10] [11] [12] [14] [19] [28] [32]
27	Karsten Weihe	[9] [14]
28	Barbara Wolfers	[7]
29	Alexander Wolff	[17] [18] [21] [23] [30]
30	Christos D. Zaroliagis	[22] [25] [32]

Colors in the list of coauthors