Frank Geraets

Frank Wagner

other persons with the same name:

• Frank Wagner 0002
• Frank Wagner 0003

	2011
j19		Frank Wagner: Propriétés résiduelles dans les groupes supersimples. J. Symb. Log. 76(2): 361-367 (2011)
	2008
c18		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
c17		Frank Wagner, Kathleen Krebs, Cataldo Mega, Bernhard Mitschang, Norbert Ritter: Email Archiving and Discovery as a Service. IDC 2008: 197-206
	2007
c16		Juan Luis Guerrero-Rascado, Hassan Lyamani, Lucas Alados-Arboledas, Ana María Silva, Frank Wagner, Sergio Pereira: Atmospheric vertical profiles obtained by Lidar over Évora during CAPEX project. IGARSS 2007: 1709-1712
e1		Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis (Eds.): 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. Lecture Notes in Computer Science 4359, Springer 2007, isbn 978-3-540-74245-6
	2005
j18		Frank Wagner: Subsimple groups. J. Symb. Log. 70(4): 1365-1370 (2005)
	2003
c15		Frank Wagner, Jochen Eichert, Roman Schirra: Management Of Virtual Enterprises: A Case Study Of German Rapid Prototyping SMES. PRO-VE 2003: 493-500
	2001
j17		Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk: Three Rules Suffice for Good Label Placement. Algorithmica 30(2): 334-349 (2001)
j16		Frank Wagner: A Complete Model of the Deutsche Bahn - Prosim and Beyond. Electr. Notes Theor. Comput. Sci. 50(1): 11-12 (2001)
j15		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): 13-23 (2001)
j14		Frank Wagner: Fields of Finite Morley Rank. J. Symb. Log. 66(2): 703-706 (2001)
	2000
j13		Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)
j12		Oleg V. Belegradek, Ya'acov Peterzil, Frank Wagner: Quasi-O-Minimal Structures. J. Symb. Log. 65(3): 1115-1132 (2000)
c14		Gabriele Neyer, Frank Wagner: Labeling Downtown. CIAC 2000: 113-124
	1998
c13		Frank Wagner, Alexander Wolff: A Combinatorial Framework for Map Labeling. Graph Drawing 1998: 316-331
c12		Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis: Computing Mimicking Networks. ICALP 1998: 556-567
	1997
j11		Frank Wagner, Alexander Wolff: A Practical Map Labeling Algorithm. Comput. Geom. 7: 387-404 (1997)
j10		Mechthild Stoer, Frank Wagner: A simple min-cut algorithm. J. ACM 44(4): 585-591 (1997)
	1996
j9		Ruth Kuchem, Dorothea Wagner, Frank Wagner: Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996)
	1995
c11		Frank Wagner, Alexander Wolff: Map Labeling Heuristics: Provably Good and Practically Useful. Symposium on Computational Geometry 1995: 109-118
c10		Frank Wagner, Alexander Wolff: An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA 1995: 420-433
	1994
j8		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)
j7		Frank Wagner: Approximate Map Labeling is in Omega (n log n). Inf. Process. Lett. 52(3): 161-165 (1994)
j6		Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994)
c9		Mechthild Stoer, Frank Wagner: A Simple Min Cut Algorithm. ESA 1994: 141-147
	1993
j5		Edmund Ihler, Dorothea Wagner, Frank Wagner: Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993)
j4		Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993)
c8		Dorothea Wagner, Frank Wagner: Between Min Cut and Graph Bisection. MFCS 1993: 744-750
	1992
j3		Dorothea Wagner, Frank Wagner: An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discrete Applied Mathematics 40(1): 73-81 (1992)
j2		Frank Wagner: Book review. Math. Meth. of OR 36(3): 226 (1992)
c7		Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399
	1991
j1		Dorothea Wagner, Frank Wagner: A generalization of the zero-one principle for sorting algorithms. Discrete Applied Mathematics 30(2-3): 265-273 (1991)
c6		Michael Formann, Frank Wagner: A Packing Problem with Applications to Lettering of Maps. Symposium on Computational Geometry 1991: 281-288
c5		Frank Wagner, Barbara Wolfers: Short Wire Routing in Convex Grids. ISA 1991: 72-82
c4		Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482
	1990
c3		Michael Formann, Frank Wagner: The VLSI layout in various embedding models. WG 1990: 130-139
	1989
c2		Ruth Kuchem, Dorothea Wagner, Frank Wagner: Area-Optimal Three-Layer Channel Routing. FOCS 1989: 506-511
	1986
c1		Frank Wagner: Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. CONPAR 1986: 345-352

Coauthor Index

Colors in the list of coauthors

Last update Mon May 20 02:49:14 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page