Frank Geraets

According to our database, Frank Geraets authored at least 28 papers between 1986 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

04261 Abstracts Collection - Algorithmic Methods for Railway Optimization.

Leo G. Kroon, Dorothea Wagner, Frank Geraets, Christos D. Zaroliagis

Proceedings of the Algorithmic Methods for Railway Optimization, 20.06. - 25.06.2004, 2004

2001

A Complete Model of the Deutsche Bahn - Prosim and Beyond.

Frank Wagner

Proceedings of the Workshop on Algorithmic MeThods and Models for Optimization of RailwayS, 2001

Locating New Stops in a Railway Network.

Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner

Proceedings of the Workshop on Algorithmic MeThods and Models for Optimization of RailwayS, 2001

Three Rules Suffice for Good Label Placement.

Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk

Algorithmica, 2001

2000

Computing Mimicking Networks.

Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis

Algorithmica, 2000

Labeling Downtown.

Gabriele Neyer, Frank Wagner

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1998

A Combinatorial Framework for Map Labeling.

Frank Wagner, Alexander Wolff

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

A simple min-cut algorithm.

Mechthild Stoer, Frank Wagner

J. ACM, 1997

A Practical Map Labeling Algorithm.

Frank Wagner, Alexander Wolff

Comput. Geom., 1997

1996

Optimizing Area for Three-Layer Knock-Knee Channel Routing.

Ruth Kuchem, Dorothea Wagner, Frank Wagner

Algorithmica, 1996

1995

An Efficient and Effective Approximation Algorithm for the Map Labeling Problem.

Frank Wagner, Alexander Wolff

Proceedings of the Algorithms, 1995

Map Labeling Heuristics: Provably Good and Practically Useful.

Frank Wagner, Alexander Wolff

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Wiring Knock-Knee Layouts: A Global Approach.

Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe

IEEE Trans. Computers, 1994

Approximate Map Labeling is in Omega (n log n).

Frank Wagner

Inf. Process. Lett., 1994

Faster Isometric Embedding in Products of Complete Graphs.

Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner

Discret. Appl. Math., 1994

1993

Routing through a Dense Channel with Minimum Total Wire Length.

Michael Formann, Dorothea Wagner, Frank Wagner

J. Algorithms, 1993

Modeling Hypergraphs by Graphs with the Same Mincut Properties.

Edmund Ihler, Dorothea Wagner, Frank Wagner

Inf. Process. Lett., 1993

Between Min Cut and Graph Bisection.

Dorothea Wagner, Frank Wagner

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Book review.

Frank Wagner

ZOR Methods Model. Oper. Res., 1992

An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.

Dorothea Wagner, Frank Wagner

Discret. Appl. Math., 1992

Wiring Knock-Knee Layouts: A Global Appoach.

Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

A generalization of the zero-one principle for sorting algorithms.

Dorothea Wagner, Frank Wagner

Discret. Appl. Math., 1991

Short Wire Routing in Convex Grids.

Frank Wagner, Barbara Wolfers

Proceedings of the ISA '91 Algorithms, 1991

A Packing Problem with Applications to Lettering of Maps.

Michael Formann, Frank Wagner

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

The VLSI layout in various embedding models.

Michael Formann, Frank Wagner

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1989

Area-Optimal Three-Layer Channel Routing

Ruth Kuchem, Dorothea Wagner, Frank Wagner

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Graphenzerlegung mit minimalem Schnitt: ein Grundproblem des VLSI-Layout.

Frank Wagner

PhD thesis, 1988

1986

Shuffle/Exchange is the Natural Interconnection Scheme for the Parallel Fast Fourier Transform.

Frank Wagner

Proceedings of the CONPAR 86: Conference on Algorithms and Hardware for Parallel Processing, 1986