Frank Wagner

Publication Activity (10 Years)

Years Active: 1986-2001
Publications (10 Years): 0

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk
Three Rules Suffice for Good Label Placement. Algorithmica 30 (2) (2001)
Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner
Locating New Stops in a Railway Network. Electron. Notes Theor. Comput. Sci. 50 (1) (2001)
Frank Wagner
A Complete Model of the Deutsche Bahn - Prosim and Beyond. Electron. Notes Theor. Comput. Sci. 50 (1) (2001)
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. Algorithmica 26 (1) (2000)
Gabriele Neyer, Frank Wagner
Labeling Downtown. CIAC (2000)
Frank Wagner, Alexander Wolff
A Combinatorial Framework for Map Labeling. Graph Drawing (1998)
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. ICALP (1998)
Mechthild Stoer, Frank Wagner
A simple min-cut algorithm. J. ACM 44 (4) (1997)
Frank Wagner, Alexander Wolff
A Practical Map Labeling Algorithm. Comput. Geom. 7 (1997)
Ruth Kuchem, Dorothea Wagner, Frank Wagner
Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15 (5) (1996)
Frank Wagner, Alexander Wolff
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA (1995)
Frank Wagner, Alexander Wolff
Map Labeling Heuristics: Provably Good and Practically Useful. SCG (1995)
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43 (5) (1994)
Frank Wagner
Approximate Map Labeling is in Omega (n log n). Inf. Process. Lett. 52 (3) (1994)
Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
Faster Isometric Embedding in Products of Complete Graphs. Discret. Appl. Math. 52 (1) (1994)
Mechthild Stoer, Frank Wagner
A Simple Min Cut Algorithm. ESA (1994)
Michael Formann, Dorothea Wagner, Frank Wagner
Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15 (2) (1993)
Dorothea Wagner, Frank Wagner
Between Min Cut and Graph Bisection. MFCS (1993)
Edmund Ihler, Dorothea Wagner, Frank Wagner
Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45 (4) (1993)
Dorothea Wagner, Frank Wagner
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discret. Appl. Math. 40 (1) (1992)
Frank Wagner
Book review. ZOR Methods Model. Oper. Res. 36 (3) (1992)
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Appoach. ISAAC (1992)
Frank Wagner, Barbara Wolfers
Short Wire Routing in Convex Grids. ISA (1991)
Dorothea Wagner, Frank Wagner
A generalization of the zero-one principle for sorting algorithms. Discret. Appl. Math. 30 (2-3) (1991)
Michael Formann, Frank Wagner
A Packing Problem with Applications to Lettering of Maps. SCG (1991)
Michael Formann, Dorothea Wagner, Frank Wagner
Routing through a Dense Channel with Minimum Total Wire Length. SODA (1991)
Michael Formann, Frank Wagner
The VLSI layout in various embedding models. WG (1990)
Ruth Kuchem, Dorothea Wagner, Frank Wagner
Area-Optimal Three-Layer Channel Routing FOCS (1989)
Frank Wagner
Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. CONPAR (1986)

Frank Wagner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Frank Wagner