Ekkehard Köhler

Martin Strehler

Transp. Sci., 2019

Recognizing Graph Search Trees.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the End-Vertex Problem of Graph Searches.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

2017

Eccentricity approximating trees.

[BibT_eX]

[DOI]

Hend Alrasheed

Discret. Appl. Math., 2017

Line-Distortion, Bandwidth and Path-Length of a Graph.

[BibT_eX]

[DOI]

Ashkan Mansouri Yarahmadi

Arne Leitert

Algorithmica, 2017

A Graph Theoretic Approach for Shape from Shading.

[BibT_eX]

[DOI]

Robert Scheffler

Michael Breuß

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2017

2016

On the Power of Graph Searching for Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs.

[BibT_eX]

[DOI]

Lalla Mouatadid

Inf. Process. Lett., 2016

Eccentricity Approximating Trees - Extended Abstract.

[BibT_eX]

[DOI]

Hend Alrasheed

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

2015

Traffic signal optimization using cyclically expanded networks.

[BibT_eX]

[DOI]

Martin Strehler

Networks, 2015

Linear Structure of Graphs and the Knotting Graph.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2014

Linear Time LexDFS on Cocomparability Graphs.

[BibT_eX]

[DOI]

Lalla Mouatadid

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2012

Collective additive tree spanners for circle graphs and polygonal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2010

Length-bounded cuts and flows.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

On end-vertices of Lexicographic Breadth First Searches.

[BibT_eX]

[DOI]

Jean-Marc Lanlignel

Discret. Appl. Math., 2010

2009

Lower bounds for strictly fundamental cycle bases in grid graphs.

[BibT_eX]

[DOI]

Networks, 2009

Traffic Networks and Flows over Time.

[BibT_eX]

[DOI]

Rolf H. Möhring

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Additive Spanners for Circle Graphs and Polygonal Graphs.

[BibT_eX]

[DOI]

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

The Maximum Energy-Constrained Dynamic Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

2007

Approximating earliest arrival flows with flow-dependent transit times.

[BibT_eX]

[DOI]

Nadine Baumann

Discret. Appl. Math., 2007

Benchmarks for Strictly Fundamental Cycle Bases.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006

Higher-Dimensional Packing with Order Constraints.

[BibT_eX]

[DOI]

Sándor P. Fekete

Jürgen Teich

SIAM J. Discret. Math., 2006

Linear Orderings of Subfamilies of AT-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Length-Bounded Cuts and Flows.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Fast Point-to-Point Shortest Path Computations with Arc-Flags.

[BibT_eX]

[DOI]

Proceedings of the Shortest Path Problem, 2006

2005

Flows over Time with Load-Dependent Transit Times.

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

The k-Splittable Flow Problem.

[BibT_eX]

[DOI]

Georg Baier

Algorithmica, 2005

Collective Tree 1-Spanners for Interval Graphs.

[BibT_eX]

[DOI]

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

Acceleration of Shortest Path and Constrained Shortest Path Computation.

[BibT_eX]

[DOI]

Rolf H. Möhring

Heiko Schilling

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004

Recognizing graphs without asteroidal triples.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Hereditary dominating pair graphs.

[BibT_eX]

[DOI]

Natasa Przulj

Discret. Appl. Math., 2004

Conflict-free Real-time AGV Routing.

[BibT_eX]

[DOI]

Proceedings of the Operations Research, 2004

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks.

[BibT_eX]

[DOI]

Rolf H. Möhring

Gregor Wünsch

Proceedings of the Operations Research, 2004

2003

On the power of BFS to determine a graph's diameter.

[BibT_eX]

[DOI]

Networks, 2003

2002

On the Power of BFS to Determine a Graphs Diameter.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Time-Expanded Graphs for Flow-Dependent Transit Times.

[BibT_eX]

[DOI]

Katharina Langkau

Proceedings of the Algorithms, 2002

2001

Extending Partial Suborders.

[BibT_eX]

[DOI]

Sándor P. Fekete

Jürgen Teich

Electron. Notes Discret. Math., 2001

On Subfamilies of AT-Free Graphs.

[BibT_eX]

[DOI]

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

Optimal FPGA module placement with temporal precedence constraints.

[BibT_eX]

[DOI]

Sándor P. Fekete

Jürgen Teich

Proceedings of the Conference on Design, Automation and Test in Europe, 2001

2000

Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.

[BibT_eX]

[DOI]

Andreas Brandstädt

SIAM J. Comput., 2000

Connected Domination and Dominating Clique in Trapezoid Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Edge-Dominating Trails in AT-free Graphs (Extended Abstract).

[BibT_eX]

[DOI]