Dorothea Wagner

According to our database1, Dorothea Wagner authored at least 244 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Engineering Negative Cycle Canceling for Wind Farm Cabling.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Shaving Peaks by Augmenting the Dependency Graph.
Proceedings of the Tenth ACM International Conference on Future Energy Systems, 2019

Industrial Demand-Side Flexibility: A Benchmark Data Set.
Proceedings of the Tenth ACM International Conference on Future Energy Systems, 2019

2018
Benchmarking for Graph Clustering and Partitioning.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark.
ACM Journal of Experimental Algorithmics, 2018

Connection Scan Algorithm.
ACM Journal of Experimental Algorithmics, 2018

Poster abstract: graph-theoretic model for observability in multi-carrier energy distribution networks.
Computer Science - R&D, 2018

Exploiting flexibility in smart grids at scale.
Computer Science - R&D, 2018

Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Distributed Graph Clustering Using Modularity and Map Equation.
Proceedings of the Euro-Par 2018: Parallel Processing, 2018

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

The Maximum Transmission Switching Flow Problem.
Proceedings of the Ninth International Conference on Future Energy Systems, 2018

How much demand side flexibility do we need?: Analyzing where to exploit flexibility in industrial processes.
Proceedings of the Ninth International Conference on Future Energy Systems, 2018

An equal opportunity concept for the coordinated research effort AESC.
Proceedings of the 12th European Conference on Software Architecture: Companion Proceedings, 2018

A Geometric Heuristic for Rectilinear Crossing Minimization.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Local Community Detection Based on Small Cliques.
Algorithms, 2017

Efficient Traffic Assignment for Public Transit Networks.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Multimodal route and tour planning in urban environments.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Eco-aware vehicle routing in urban environments.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Benchmark Generator for Dynamic Overlapping Communities in Networks.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

Time-Dependent Route Planning for Truck Drivers.
Proceedings of the Computational Logistics - 8th International Conference, 2017

Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

A Simulated-Annealing-Based Approach for Wind Farm Cabling.
Proceedings of the Eighth International Conference on Future Energy Systems, 2017

Public Transit Routing with Unrestricted Walking.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

Improved Oracles for Time-Dependent Road Networks.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

Integrating public transport into mobiTopp.
Proceedings of the 8th International Conference on Ambient Systems, 2017

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Clustering Evolving Networks.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Route Planning in Transportation Networks.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Structure-preserving sparsification methods for social networks.
Social Netw. Analys. Mining, 2016

Towards route planning algorithms for electric vehicles with realistic constraints.
Computer Science - R&D, 2016

Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171).
Dagstuhl Reports, 2016

Dynamic Time-Dependent Route Planning in Road Networks with User Preferences.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Fast Exact Computation of Isochrones in Road Networks.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Hierarchical Time-Dependent Oracles.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Engineering Oracles for Time-Dependent Road Networks.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

Fast exact shortest path and distance queries on road networks with parametrized costs.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Shortest feasible paths with charging stops for battery electric vehicles.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Fast Quasi-Threshold Editing.
Proceedings of the Algorithms - ESA 2015, 2015

Towards Realistic Flow Control in Power Grid Operation.
Proceedings of the Energy Informatics, 2015

Operating Power Grids with Few Flow Control Buses.
Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

Towards Realistic Pedestrian Route Planning.
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

Structure-Preserving Sparsification of Social Networks.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
Benchmarking for Graph Clustering and Partitioning.
Encyclopedia of Social Network Analysis and Mining, 2014

Column-Based Graph Layouts.
J. Graph Algorithms Appl., 2014

Experiments on Density-Constrained Graph Clustering.
ACM Journal of Experimental Algorithmics, 2014

User-Constrained Multimodal Route Planning.
ACM Journal of Experimental Algorithmics, 2014

EATCS Fellows 2015 - Call for Nominations.
Bulletin of the EATCS, 2014

Erratum: Customizable Contraction Hierarchies.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Customizable Contraction Hierarchies.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Online Dynamic Power Management with Hard Real-Time Guarantees.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Graph Clustering with Surprise: Complexity and Exact Solutions.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Local Broadcasting with Arbitrary Transmission Power in the SINR Model.
Proceedings of the Structural Information and Communication Complexity, 2014

Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Speed-Consumption Tradeoff for Electric Vehicle Route Planning.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Connection Scan Accelerated.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
Social Networks.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Dynamic graph clustering combining modularity and smoothness.
ACM Journal of Experimental Algorithmics, 2013

Algorithm Engineering.
Informatik Spektrum, 2013

Algorithm Engineering.
Informatik Spektrum, 2013

Identifikation von Clustern in Graphen.
Informatik Spektrum, 2013

Algorithm Engineering (Dagstuhl Seminar 13391).
Dagstuhl Reports, 2013

Efficient Computation of Jogging Routes.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Intriguingly Simple and Fast Transit Routing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Computing Multimodal Journeys in Practice.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Hierarchies of Predominantly Connected Communities.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Optimal Orthogonal Graph Drawing with Convex Bend Costs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Search-Space Size in Contraction Hierarchies.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2013

Energy-optimal routes for electric vehicles.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
The Shortcut Problem - Complexity and Algorithms.
J. Graph Algorithms Appl., 2012

Higher Order City Voronoi Diagrams.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

An Efficient Generator for Clustered Dynamic Random Networks.
Proceedings of the Design and Analysis of Algorithms, 2012

Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks.
Proceedings of the Design and Analysis of Algorithms, 2012

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Fast and Simple Fully-Dynamic Cut Tree Construction.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Force-directed tracking in wireless networks using signal strength and step recognition.
Proceedings of the International Conference on Localization and GNSS, 2012

Column-Based Graph Layouts.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Complete hierarchical cut-clustering: A case study on expansion and modularity.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

On the Complexity of Partitioning Graphs for Arc-Flags.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

Static and Dynamic Aspects of Scientific Collaboration Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

Experiments on Density-Constrained Graph Clustering.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

User-Constrained Multi-Modal Route Planning.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011
Experimental study of speed up techniques for timetable information systems.
Networks, 2011

Algorithm Engineering.
it - Information Technology, 2011

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Generating Time Dependencies in Road Networks.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Density-Constrained Graph Clustering.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Algorithm Engineering for Route Planning - An Update -.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Generalizing Geometric Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

The Density Maximization Problem in Graphs.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Connecting Two Trees with Optimal Routing Cost.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An Experimental Study on Generating Planar Graphs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

Maximum Flows - Towards the Stadium During Rush Hour.
Proceedings of the Algorithms Unplugged, 2011

2010
Computational Aspects of Lucidity-Driven Graph Clustering.
J. Graph Algorithms Appl., 2010

Determining and interpreting correlations in lipidomic networks found in glioblastoma cells.
BMC Systems Biology, 2010

Energy efficient scheduling with power control for wireless networks.
Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010

Gateway Decompositions for Constrained Reachability Problems.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Modularity-Driven Clustering of Dynamic Graphs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Space-Efficient SHARC-Routing.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Orthogonal Graph Drawing with Flexibility Constraints.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Preprocessing Speed-Up Techniques Is Hard.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Enumerating and Generating Labeled k-degenerate Graphs.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Synthetic Road Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Time-Dependent Route Planning.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Preface.
ACM Journal of Experimental Algorithmics, 2009

Engineering planar separator algorithms.
ACM Journal of Experimental Algorithmics, 2009

The Continuous Stop Location Problem in Public Transportation Networks.
APJOR, 2009

Pareto Paths with SHARC.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Dynamic Graph Clustering Using Minimum-Cut Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The Shortcut Problem - Complexity and Approximation.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Accelerating Multi-modal Route Planning by Access-Nodes.
Proceedings of the Algorithms, 2009

Engineering Route Planning Algorithms.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Group-Level Analysis and Visualization of Social Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Efficient Route Planning in Flight Networks.
Proceedings of the ATMOS 2009, 2009

Orca Reduction and ContrAction Graph Clustering.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Maximale Flüsse - Die ganze Stadt will zum Stadion.
Proceedings of the Taschenbuch der Algorithmen, 2008

On Modularity Clustering.
IEEE Trans. Knowl. Data Eng., 2008

Augmenting k-core generation with preferential attachment.
NHM, 2008

Guest Editor's Foreword.
J. Graph Algorithms Appl., 2008

Engineering multilevel overlay graphs for shortest-path queries.
ACM Journal of Experimental Algorithmics, 2008

Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

08191 Working Group Report - Visualization of Trajectories.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

Engineering Time-Expanded Graphs for Faster Timetable Information.
Proceedings of the ATMOS 2008, 2008

Link Scheduling in Local Interference Models.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

Efficient Scheduling of Data-Harvesting Trees.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

Engineering Comparators for Graph Clusterings.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

Engineering Label-Constrained Shortest-Path Algorithms.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Efficient models for timetable information in public transportation systems.
ACM Journal of Experimental Algorithmics, 2007

Engineering graph clustering: Models and experimental evaluation.
ACM Journal of Experimental Algorithmics, 2007

On Finding Graph Clusterings with Maximum Modularity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Landmark-Based Routing in Dynamic Graphs.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Speed-Up Techniques for Shortest-Path Computations.
Proceedings of the STACS 2007, 2007

Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Minimizing the Area for Planar Straight-Line Grid Drawings.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

LunarVis - Analytic Visualizations of Large Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Experimental Study on Speed-Up Techniques for Timetable Information Systems.
Proceedings of the ATMOS 2007, 2007

Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

Significance-Driven Graph Clustering.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Partitioning graphs to speedup Dijkstra's algorithm.
ACM Journal of Experimental Algorithmics, 2006

Highway Hierarchies Star.
Proceedings of the Shortest Path Problem, 2006

High-Performance Multi-Level Routing.
Proceedings of the Shortest Path Problem, 2006

Engineering Label-Constrained Shortest-Path Algorithms.
Proceedings of the Shortest Path Problem, 2006

06091 Abstracts Collection -- Data Structures.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

06091 Executive Summary -- Data Structures.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Approximating Clustering Coefficient and Transitivity.
J. Graph Algorithms Appl., 2005

Geometric containers for efficient shortest-path computation.
ACM Journal of Experimental Algorithmics, 2005

Combining speed-up techniques for shortest-path computations.
ACM Journal of Experimental Algorithmics, 2005

Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Partitioning Graphs to Speed Up Dijkstra's Algorithm.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

A Hybrid Model for Drawing Dynamic and Evolving Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Engineering Planar Separator Algorithms.
Proceedings of the Algorithms, 2005

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

A Hybrid Model for Drawing Dynamic and Evolving Graphs.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

Station Location - Complexity and Approximation.
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005

Drawing Graphs to Speed Up Shortest-Path Computations.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Generating node coordinates for shortest-path computations in transportation networks.
ACM Journal of Experimental Algorithmics, 2004

Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany.
J. Discrete Algorithms, 2004

Netzwerkvisualisierung.
it - Information Technology, 2004

Dynamic Shortest Paths Containers.
Electr. Notes Theor. Comput. Sci., 2004

Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
Electr. Notes Theor. Comput. Sci., 2004

The Station Location Problem on Two Intersecting Lines.
Electr. Notes Theor. Comput. Sci., 2004

How to draw the minimum cuts of a planar graph.
Comput. Geom., 2004

Drawing the AS Graph in 2.5 Dimensions.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Solving Geometric Covering Problems by Data Reduction.
Proceedings of the Algorithms, 2004

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

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

Timetable Information: Models and Algorithms.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

Experimental Comparison of Shortest Path Approaches for Timetable Information.
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.
Proceedings of the Graph Drawing Software, 2004

2003
Communicating Centrality in Policy Network Drawings.
IEEE Trans. Vis. Comput. Graph., 2003

DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke".
it - Information Technology, 2003

Completely Connected Clustered Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Analysis and Visualization of Social Networks.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Algorithms and Models for Railway Optimization.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
Proceedings of the Algorithms, 2003

Experiments on Graph Clustering Algorithms.
Proceedings of the Algorithms, 2003

2002
Preface.
Electr. Notes Theor. Comput. Sci., 2002

Drawing Graphs on Two and Three Lines.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Sketch-Driven Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Using Multi-level Graphs for Timetable Information in Railway Systems.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections.
Journal of Social Structure, 2001

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2001

Locating New Stops in a Railway Network.
Electr. Notes Theor. Comput. Sci., 2001

Planarity of the 2-Level Cactus Model.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

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

Travel Planning with Self-Made Maps.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Editorial: Discrete algorithm engineering.
Softw., Pract. Exper., 2000

On the Complexity of Partial Order Properties.
Order, 2000

Dynamic WWW Structures in 3D.
J. Graph Algorithms Appl., 2000

Foreword.
Algorithmica, 2000

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

Contextual Visualization of Actor Status in Social Networks.
Proceedings of the 2000 Joint Eurographics and IEEE TCVG Symposium on Visualization, 2000

Fast Layout Methods for Timetable Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract).
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.
Discrete Applied Mathematics, 1999

On the Hardness of Recognizing Bundles in Time Table Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
Proceedings of the Algorithm Engineering, 1999

Centrality in Policy Network Drawings.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Empirical Design of Geometric Algorithms.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Über das Zeichnen von Graphen.
Proceedings of the Angewandte Mathematik, 1999

1998
Dynamic Grid Embedding with Few Bends and Changes.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Using Graph Layout to Visualize Train Interconnection Data.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
A Bayesian Paradigm for Dynamic Graph Layout.
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).
Proceedings of the Algorithms, 1997

1996
Efficient Parallel Matrix Inversion on Interconnection Networks.
J. Parallel Distrib. Comput., 1996

C++ im Nebenfachstudium: Konzepte und Erfahrungen.
Informatik Spektrum, 1996

Optimizing Area for Three-Layer Knock-Knee Channel Routing.
Algorithmica, 1996

Wiring Edge-Disjoint Layouts.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
An Animated Library of Combinatorial VLSI-Routing Algorithms.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Wiring Knock-Knee Layouts: A Global Approach.
IEEE Trans. Computers, 1994

Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated.
Proceedings of the Seventh International Conference on VLSI Design, 1994

1993
Modeling Hypergraphs by Graphs with the Same Mincut Properties.
Inf. Process. Lett., 1993

Optimal routing through dense chanels.
Int. J. Comput. Geometry Appl., 1993

The Vertex-Disjoint Menger Problem in Planar Graphs.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Between Min Cut and Graph Bisection.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Efficient algorithms for disjoint paths in planar graphs.
Proceedings of the Combinatorial Optimization, 1993

1992
Book review.
ZOR - Meth. & Mod. of OR, 1992

An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.
Discrete Applied Mathematics, 1992

On the Complexity of Partial Order Properties.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Wiring Knock-Knee Layouts: A Global Appoach.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
A generalization of the zero-one principle for sorting algorithms.
Discrete Applied Mathematics, 1991

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

Routing through a Dense Channel with Minimum Total Wire Length.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A New Approach to Knock-Knee Channel Routing.
Proceedings of the ISA '91 Algorithms, 1991

1990
Decomposition of k-ary relations.
Discrete Mathematics, 1990

1989
Area-Optimal Three-Layer Channel Routing
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989


  Loading...