Dorothea Wagner

J. Discrete Algorithms, 2004

Netzwerkvisualisierung.

[BibT_eX]

[DOI]

it Inf. Technol., 2004

How to draw the minimum cuts of a planar graph.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Drawing the AS Graph in 2.5 Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Solving Geometric Covering Problems by Data Reduction.

[BibT_eX]

[DOI]

Steffen Mecke

Proceedings of the Algorithms, 2004

04261 Abstracts Collection - Algorithmic Methods for Railway Optimization.

[BibT_eX]

[DOI]

Leo G. Kroon

Frank Geraets

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

04091 Abstracts Collection - Data Structures.

[BibT_eX]

[DOI]

Susanne Albers

Robert Sedgewick

Matthias Müller-Hannemann

Proceedings of the Data Structures, 22.-27. February 2004, 2004

Timetable Information: Models and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

Experimental Comparison of Shortest Path Approaches for Timetable Information.

[BibT_eX]

Evangelia Pyrga

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

Analysis and Visualization of Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

2003

Communicating Centrality in Policy Network Drawings.

[BibT_eX]

[DOI]

Patrick Kenis

IEEE Trans. Vis. Comput. Graph., 2003

DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke".

[BibT_eX]

[DOI]

it Inf. Technol., 2003

Dynamic Shortest Paths Containers.

[BibT_eX]

[DOI]

Thomas Willhalm

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.

[BibT_eX]

[DOI]

Evangelia Pyrga

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

The Station Location Problem on Two Intersecting Lines.

[BibT_eX]

[DOI]

Maria Flavia Mammana

Steffen Mecke

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

Analysis and Visualization of Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Algorithms and Models for Railway Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.

[BibT_eX]

[DOI]

Thomas Willhalm

Proceedings of the Algorithms, 2003

Experiments on Graph Clustering Algorithms.

[BibT_eX]

[DOI]

Marco Gaertler

Proceedings of the Algorithms, 2003

2002

Preface.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

Sketch-Driven Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Using Multi-level Graphs for Timetable Information in Railway Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001

Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections.

[BibT_eX]

[DOI]

Jörg Raab

J. Soc. Struct., 2001

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Takao Nishizeki

Roberto Tamassia

J. Graph Algorithms Appl., 2001

Locating New Stops in a Railway Network.

[BibT_eX]

[DOI]

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

Planarity of the 2-Level Cactus Model.

[BibT_eX]

[DOI]

Sabine Cornelsen

Yefim Dinitz

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

Visone.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Travel Planning with Self-Made Maps.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Editorial: Discrete algorithm engineering.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2000

On the Complexity of Partial Order Properties.

[BibT_eX]

[DOI]

Order, 2000

Using Graph Layout to Visualize Train Interconnection Data.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

Dynamic WWW Structures in 3D.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2000

On the Hardness of Recognizing Bundles in Time Table Graphs.

[BibT_eX]

[DOI]

Annegret Liebers

Int. J. Found. Comput. Sci., 2000

Foreword.

[BibT_eX]

[DOI]

Takao Nishizeki

Roberto Tamassia

Algorithmica, 2000

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2000

Contextual Visualization of Actor Status in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2nd Joint Eurographics - IEEE TCVG Symposium on Visualization, 2000

Fast Layout Methods for Timetable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract).

[BibT_eX]

[DOI]

Sabine Cornelsen

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

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

[BibT_eX]

[DOI]

Wolfram Schlickenrieder

Gabriele Neyer

Discret. Appl. Math., 1999

Wiring edge-disjoint layouts.

[BibT_eX]

[DOI]

Ruth Kuchem

Comput. Geom., 1999

Centrality in Policy Network Drawings.

[BibT_eX]

[DOI]

Patrick Kenis

Proceedings of the Graph Drawing, 7th International Symposium, 1999

Empirical Design of Geometric Algorithms.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Annegret Liebers

Thomas Willhalm

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Über das Zeichnen von Graphen.

[BibT_eX]

[DOI]

Proceedings of the Angewandte Mathematik, 1999

1998

Dynamic Grid Embedding with Few Bends and Changes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

The Vertex-Disjoint Menger Problem in Planar Graphs.

[BibT_eX]

[DOI]

Heike Ripphausen-Lipa

SIAM J. Comput., 1997

A Bayesian Paradigm for Dynamic Graph Layout.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Efficient Parallel Matrix Inversion on Interconnection Networks.

[BibT_eX]

[DOI]

Andreas Schikarski

J. Parallel Distributed Comput., 1996

C++ im Nebenfachstudium: Konzepte und Erfahrungen.

[BibT_eX]

[DOI]

Annegret Liebers

Inform. Spektrum, 1996

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.

[BibT_eX]

[DOI]

Heike Ripphausen-Lipa

Int. J. Found. Comput. Sci., 1996

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

[BibT_eX]

[DOI]

Ruth Kuchem

Algorithmica, 1996

1995

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.

[BibT_eX]

[DOI]

Comb., 1995

An Animated Library of Combinatorial VLSI-Routing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Wiring Knock-Knee Layouts: A Global Approach.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated.

[BibT_eX]

[DOI]

Paul Molitor

Uwe Sparmann

Proceedings of the Seventh International Conference on VLSI Design, 1994

1993

Routing through a Dense Channel with Minimum Total Wire Length.

[BibT_eX]

[DOI]

Michael Formann

J. Algorithms, 1993

Modeling Hypergraphs by Graphs with the Same Mincut Properties.

[BibT_eX]

[DOI]

Edmund Ihler

Inf. Process. Lett., 1993

Optimal routing through dense chanels.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1993

Between Min Cut and Graph Bisection.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Efficient algorithms for disjoint paths in planar graphs.

[BibT_eX]

[DOI]

Heike Ripphausen-Lipa

Proceedings of the Combinatorial Optimization, 1993

1992

Book review.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1992

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

On the Complexity of Partial Order Properties.

[BibT_eX]

[DOI]

Stefan Felsner

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

Wiring Knock-Knee Layouts: A Global Appoach.

[BibT_eX]

[DOI]

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

1991

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

α-Vertex separator is NP-hard even for 3-regular graphs.

[BibT_eX]

[DOI]

Rudolf Müller

Computing, 1991

A New Approach to Knock-Knee Channel Routing.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

1990

Decomposition of k-ary relations.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

Area-Optimal Three-Layer Channel Routing

[BibT_eX]

[DOI]

Ruth Kuchem