Karsten Weihe

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

On the cardinality of the Pareto set in bicriteria shortest path problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

Workload Balancing in Multi-stage Production Processes.

[BibT_eX]

[DOI]

Siamak Tazari

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005

Weak Symmetries in Problem Formulations.

[BibT_eX]

[DOI]

Roland Martin

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Edge-disjoint routing in plane switch graphs in linear time.

[BibT_eX]

[DOI]

Jan M. Hochstein

J. ACM, 2004

Moving Policies in Cyclic Assembly-Line Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2002

Getting Train Timetables into the Main Storage.

[BibT_eX]

[DOI]

Mathias Schnee

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

2001

A software engineering perspective on algorithmics.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2001

Pareto Shortest Paths is Often Feasible in Practice.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2001

2000

Editorial: Discrete algorithm engineering.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2000

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

On the Differences between "Practical" and "Applied".

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2000

Recognizing Bundles in Time Table Graphs - A Structural Approach.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2000

1999

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

[BibT_eX]

[DOI]

Ulrik Brandes

Wolfram Schlickenrieder

Gabriele Neyer

Discret. Appl. Math., 1999

On the Hardness of Recognizing Bundles in Time Table Graphs.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Frank Schulz

Proceedings of the Algorithm Engineering, 1999

Edge-Disjoint Routing in Plane Switch Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Empirical Design of Geometric Algorithms.

[BibT_eX]

[DOI]

Ulrik Brandes

Thomas Willhalm

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Iterators Evaluate Table Queries (C++ Toolbox).

[BibT_eX]

[DOI]

Dieter Gluche

Dietmar Kühl

ACM SIGPLAN Notices, 1998

Laufzeitdynamische Evaluierung tabellarischer Daten.

[BibT_eX]

[DOI]

Inform. Forsch. Entwickl., 1998

Why CAD Data Repair Requires Discrete Algorithmic Techniques.

[BibT_eX]

Thomas Willhalm

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

The STL Model in the Geometric Domain.

[BibT_eX]

[DOI]

Ullrich Köthe

Proceedings of the Generic Programming, 1998

1997

Mesh refinement via bidirected flows: modeling, complexity, and computational results.

[BibT_eX]

[DOI]

Rolf H. Möhring

J. ACM, 1997

Efficient, Adaptable Implementations of Graph Algorithms.

[BibT_eX]

Dietmar Kühl

Marco Nissen

Proceedings of the Workshop on Algorithm Engineering, 1997

Reuse of Algorithms: Still a Challenge to Object-Oriented Programming.

[BibT_eX]

[DOI]

Proceedings of the 1997 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1997

Reconstructing the Topology of a CAD Model: A Discrete Approach.

[BibT_eX]

[DOI]

Thomas Willhalm

Proceedings of the Algorithms, 1997

Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

Minimum Strictly Convex Quadrangulations of Convex Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

C++ im Nebenfachstudium: Konzepte und Erfahrungen.

[BibT_eX]

[DOI]

Inform. Spektrum, 1996

1995

Book reviews.

[BibT_eX]

[DOI]

M. Seetharama Gowda

Math. Methods Oper. Res., 1995

Using Network Flows for Surface Modeling.

[BibT_eX]

[DOI]

Rolf H. Möhring

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Book reviews.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

The Vertex-Disjoint Menger Problem in Planar Graphs.

[BibT_eX]

[DOI]

Heike Ripphausen-Lipa

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Multicommodity Flows in Even, Planar Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

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

[BibT_eX]

[DOI]

Heike Ripphausen-Lipa

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Efficient algorithms for disjoint paths in planar graphs.

[BibT_eX]

[DOI]

Heike Ripphausen-Lipa