Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform. - Frank Wagner 001 (CONPAR, 1986)

Graphenzerlegung mit minimalem Schnitt: ein Grundproblem des VLSI-Layout. - Frank Wagner 001 (1988)

Area-Optimal Three-Layer Channel Routing - Ruth Kuchem; Dorothea Wagner; Frank Wagner 001 (FOCS, 1989)

The VLSI layout in various embedding models. - Michael Formann; Frank Wagner 001 (WG, 1990)

A Packing Problem with Applications to Lettering of Maps. - Michael Formann; Frank Wagner 001 (SCG, 1991)

Short Wire Routing in Convex Grids. - Frank Wagner 001; Barbara Wolfers (ISA, 1991)

A generalization of the zero-one principle for sorting algorithms. - Dorothea Wagner; Frank Wagner 001 (Discret. Appl. Math., 1991)

Wiring Knock-Knee Layouts: A Global Appoach. - Majid Sarrafzadeh; Dorothea Wagner; Frank Wagner 001; Karsten Weihe (ISAAC, 1992)

An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. - Dorothea Wagner; Frank Wagner 001 (Discret. Appl. Math., 1992)

Book review. - Frank Wagner 001 (ZOR Methods Model. Oper. Res., 1992)

Between Min Cut and Graph Bisection. - Dorothea Wagner; Frank Wagner 001 (MFCS, 1993)

Modeling Hypergraphs by Graphs with the Same Mincut Properties. - Edmund Ihler; Dorothea Wagner; Frank Wagner 001 (Inf. Process. Lett., 1993)

Routing through a Dense Channel with Minimum Total Wire Length. - Michael Formann; Dorothea Wagner; Frank Wagner 001 (J. Algorithms, 1993)

Faster Isometric Embedding in Products of Complete Graphs. - Franz Aurenhammer; Michael Formann; Ramana M. Idury; Alejandro A. Schäffer; Frank Wagner 001 (Discret. Appl. Math., 1994)

Approximate Map Labeling is in Omega (n log n). - Frank Wagner 001 (Inf. Process. Lett., 1994)

Wiring Knock-Knee Layouts: A Global Approach. - Majid Sarrafzadeh; Dorothea Wagner; Frank Wagner 001; Karsten Weihe (IEEE Trans. Computers, 1994)

Map Labeling Heuristics: Provably Good and Practically Useful. - Frank Wagner 001; Alexander Wolff 001 (SCG, 1995)

An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. - Frank Wagner 001; Alexander Wolff 001 (ESA, 1995)

Optimizing Area for Three-Layer Knock-Knee Channel Routing. - Ruth Kuchem; Dorothea Wagner; Frank Wagner 001 (Algorithmica, 1996)

A Practical Map Labeling Algorithm. - Frank Wagner 001; Alexander Wolff 001 (Comput. Geom., 1997)

A simple min-cut algorithm. - Mechthild Stoer; Frank Wagner 001 (J. ACM, 1997)

A Combinatorial Framework for Map Labeling. - Frank Wagner 001; Alexander Wolff 001 (GD, 1998)

Labeling Downtown. - Gabriele Neyer; Frank Wagner 001 (CIAC, 2000)

Computing Mimicking Networks. - Shiva Chaudhuri; K. V. Subrahmanyam 001; Frank Wagner 001; Christos D. Zaroliagis (Algorithmica, 2000)

Three Rules Suffice for Good Label Placement. - Frank Wagner 001; Alexander Wolff 001; Vikas Kapoor; Tycho Strijk (Algorithmica, 2001)

Locating New Stops in a Railway Network. - Horst W. Hamacher; Annegret Liebers; Anita Schöbel; Dorothea Wagner; Frank Wagner 001 (ATMOS, 2001)

A Complete Model of the Deutsche Bahn - Prosim and Beyond. - Frank Wagner 001 (ATMOS, 2001)

04261 Abstracts Collection - Algorithmic Methods for Railway Optimization. - Leo G. Kroon; Dorothea Wagner; Frank Geraets; Christos D. Zaroliagis (Algorithmic Methods for Railway Optimization, 2004)