Gabriele Neyer

According to our database, Gabriele Neyer authored at least 6 papers between 1997 and 2001.

Collaborative distances:

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

2001

On the Complexity of Train Assignment Problems.

Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Labeling Downtown.

Gabriele Neyer, Frank Wagner

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

1999

A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.

Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe

Discret. Appl. Math., 1999

Line Simplification with Restricted Orientations.

Gabriele Neyer

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Map Labeling with Application to Graph Drawing.

Gabriele Neyer

Proceedings of the Drawing Graphs, 1999

1997

Singularities Make Spatial Join Scheduling Hard.

Gabriele Neyer, Peter Widmayer

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997