BTU Publication Database (UBICO)

Recognizing LBFS trees of bipartite graphs

Author(s)
Scheffler, Robert
Type
Scientific Article ref.
Year of publication
2024
Source
Information Processing Letters
Volume
186
ISSN
0020-0190
DOI
https://doi.org/10.1016/j.ipl.2024.106483

Graph Search Trees and Their Leaves

Author(s)
Scheffler, Robert
Type
Conference Proceeding refering
Year of publication
2023
Publisher name
Cham : Springer
Source
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, S. 462 - 476
ISBN
978-3-031-43379-5
978-3-031-43380-1
DOI
https://doi.org/10.1007/978-3-031-43380-1_33
LNCS - Lecture Notes in Computer Science ; Band 14093

Optimal Bicycle Routes with Few Signal Stops

Author(s)
Köhler, Ekkehard, Rogge, Markus, Scheffler, Robert, Strehler, Martin
Type
Conference Proceeding refering
Year of publication
2023
Publisher name
Dagstuhl : Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Source
23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), S. 11 - 114
DOI
https://doi.org/10.4230/OASIcs.ATMOS.2023.1

Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs

Author(s)
Beisegel, Jesse, Köhler, Ekkehard, Scheffler, Robert, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2023
Source
Algorithmica, S. 2454 - 2481
Volume
85
Issue/Journal number
8
ISSN
0178-4617
DOI
https://doi.org/10.1007/s00453-023-01107-1

On the recognition of search trees generated by BFS and DFS

Author(s)
Scheffler, Robert
Type
Scientific Article ref.
Year of publication
2022
Source
Theoretical Computer Science, S. 116 - 128
Volume
936
ISSN
0304-3975
DOI
https://doi.org/https://doi.org/10.1016/j.tcs.2022.09.018

Routing Games with Edge Priorities

Author(s)
Scheffler, Robert, Strehler, Martin, Vargas Koch, Laura
Type
Scientific Article ref.
Year of publication
2022
Source
ACM Transactions on Economics and Computation, S. 11 - 127
Volume
10
Issue/Journal number
1
ISSN
2167-8375
DOI
https://doi.org/10.1145/3488268

The Distance Orientation Problem

Author(s)
Scheffler, Robert
Type
Scientific Article ref.
Year of publication
2022
Source
Discrete Applied Mathematics, S. 324 - 342
Volume
323
ISSN
0166-218X
DOI
https://doi.org/10.1016/j.dam.2022.06.009

Linearizing Partial Search Orders

Author(s)
Scheffler, Robert
Type
Conference Proceeding refering
Year of publication
2022
Publisher name
Cham : Springer
Source
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, S. 425 - 438
ISBN
978-3-031-15913-8
DOI
https://doi.org/10.1007/978-3-031-15914-5_31

The Recognition Problem of Graph Search Trees

Author(s)
Beisegel, Jesse, Denkert, Carolin, Köhler, Ekkehard, Krnc, Matjaž, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2021
Source
SIAM Journal on Discrete Mathematics, S. 1418 - 1446
Volume
35
Issue/Journal number
2
ISSN
1095-7146
0895-4801
DOI
https://doi.org/10.1137/20M1313301

Edge Elimination and Weighted Graph Classes

Author(s)
Beisegel, Jesse, Chiarelli, Nina, Köhler, Ekkehard, Krnc, Matjaž, Milanič, Martin, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Editor(s)
Adler, Isolde, Müller, Haiko
Type
Conference Proceeding refering
Year of publication
2020
Publisher name
Cham : Springer
Source
Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, S. 134 - 147
ISBN
978-3-030-60439-4
978-3-030-60440-0
DOI
https://doi.org/10.1007/978-3-030-60440-0_11
Lecture Notes in Computer Science ; 12301

Linear Time LexDFS on Chordal Graphs

Author(s)
Beisegel, Jesse, Köhler, Ekkehard, Scheffler, Robert, Strehler, Martin
Type
Conference Proceeding refering
Year of publication
2020
Publisher name
Schloss Dagstuhl, Leibnitz Zentrum für Informatik
Source
28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy), S. 131 - 1313
URL
https://drops.dagstuhl.de/opus/volltexte/2020/12879
URN
urn:nbn:de:0030-drops-128790
DOI
https://doi.org/10.4230/LIPIcs.ESA.2020.13

Optimization and simulation of fixed-time traffic signal control in real-world applications

Author(s)
Thunig, Theresa, Scheffler, Robert, Strehler, Martin, Nagel, Kai
Type
Conference Proceeding refering
Year of publication
2019
Publisher name
Amsterdam : Elsevier
Source
8th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications ABMTRANS'19, S. 826 - 833
DOI
https://doi.org/10.1016/j.procs.2019.04.113
Procedia Computer Science ; 151

Avoidable Vertices and Edges in Graphs

Author(s)
Beisegel, Jesse, Chudnovsky, Maria, Gurvich, Vladimir, Milanič, Martin, Servatius, Mary
Editor(s)
Friggstad, Zachary, Sack, Jörg-Rüdiger, Salavatipour, Mohammad
Type
Conference Proceeding refering
Year of publication
2019
Publisher name
Cham : Springer
Source
Algorithms and Data Structures : 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings, S. 126 - 139
ISBN
978-3-030-24765-2
978-3-030-24766-9
DOI
https://doi.org/10.1007/978-3-030-24766-9_10
Lecture Notes in Computer Science ; 11646

Recognizing Graph Search Trees

Author(s)
Beisegel, Jesse, Denkert, Carolin, Köhler, Ekkehard, Krnc, Matjaž, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Editor(s)
Coutinho, Gabriel, Kohayakawa, Yoshiharu, dos Santos, Vinicius, Urrutia, Sebastián
Type
Conference Proceeding refering
Year of publication
2019
Publisher name
Elsevier
Source
The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil, S. 99 - 110
DOI
https://doi.org/10.1016/j.entcs.2019.08.010
Electronic Notes in Theoretical Computer Science ; 346

On the End-Vertex Problem of Graph Searches

Author(s)
Beisegel, Jesse, Denkert, Carolin, Köhler, Ekkehard, Krnc, Matjaž, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2019
Source
Discrete Mathematics & Theoretical Computer Science
Volume
21
Issue/Journal number
1
ISSN
1365-8050
1462-7264

Traffic Signal Optimization: Combining Static and Dynamic Models

Author(s)
Köhler, Ekkehard, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2019
Source
Transportation Science, S. 21 - 41
Volume
53
Issue/Journal number
1
ISSN
1526-5447
DOI
https://doi.org/10.1287/trsc.2017.0760

Equilibria in Routing Games with Edge Priorities

Author(s)
Scheffler, Robert, Strehler, Martin, Vargas Koch, Laura
Editor(s)
Christodoulou, George, Harks, Tobias
Type
conference publication
Year of publication
2018
Publisher name
Cham : Springer International Publishing
Source
14th International Conference, WINE 2018, Oxford, UK, December 15–17, 2018, Proceedings, S. 408 - 422
ISBN
978-3-030-04612-5
DOI
https://doi.org/10.1007/978-3-030-04612-5_27

A Graph Theoretic Approach for Shape from Shading

Author(s)
Scheffler, Robert, Mansouri Yarahmadi, Ashkan, Breuß, Michael, Köhler, Ekkehard
Editor(s)
Pelillo, Marcello, Hancock, Edwin
Type
conference publication
Year of publication
2018
Publisher name
Cham : Springer
Shape from shading; Ambiguity; Configuration graph; Cycle basis
Source
Energy minimization methods in computer vision and pattern recognition, 11th International Conference, EMMCVPR 2017, Venice, Italy, October 30 – November 1, 2017, S. 328 - 341
ISBN
978-3-319-78198-3
DOI
https://doi.org/10.1007/978-3-319-78199-0_22
Lecture Notes in Computer Science ; volume 10746

Graph-theoretic concepts in computer science : 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018

Editor(s)
Brandstädt, Andreas, Köhler, Ekkehard, Meer, Klaus
Type
book (editor)
Year of publication
2018
Publisher name
Cham, Switzerland : Springer International Publishing
ISBN
978-3-030-00255-8
978-3-030-00256-5
Lecture Notes in Computer Science ; 11159

Recognizing Graph Search Trees

Author(s)
Beisegel, Jesse, Denkert, Carolin, Köhler, Ekkehard, Krnc, Matjaž, Pivač, Nevena, Scheffler, Robert, Strehler, Martin
Type
Scientific Article not ref.
Year of publication
2018
Source
arXiv.org
URL
https://arxiv.org/abs/1811.09249v2

Characterising AT-free Graphs with BFS

Author(s)
Beisegel, Jesse
Editor(s)
Brandstädt, Andreas, Köhler, Ekkehard, Meer, Klaus
Type
Conference Proceeding refering
Year of publication
2018
Publisher name
Cham : Springer
Source
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings, S. 15 - 26
ISBN
978-3-030-00255-8
978-3-030-00256-5
DOI
https://doi.org/10.1007/978-3-030-00256-5_2
Lecture Notes in Computer Science ; 11159

Two FPTAS for the Constrained Shortest Path Problem Applied to Hybrid Vehicle Routing

Author(s)
Schwan, Christian, Strehler, Martin
Editor(s)
Bock, Hans Georg, Phu, Hoang Xuan, Rannacher, Rolf, Schlöder, Johannes
Type
conference publication
Year of publication
2017
Publisher name
Springer International Publishing
Source
Proceedings of the Sixth International Conference on High Performance Scientific Computing, March 16-20, 2015, Hanoi, Vietnam, S. 223 - 234
ISBN
978-3-319-67167-3
DOI
https://doi.org/10.1007/978-3-319-67168-0

Optimizing Traffic Signal Settings for Public Transport Priority

Author(s)
Strehler, Martin, Scheffler, Robert
Editor(s)
D'Angelo, Gianlorenzo, Dollevoet, Twan
Type
conference publication
Year of publication
2017
Publisher name
Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
transit signal priority; traffic flow; traffic signal optimization; cyclically time-expanded network; public transport
Source
17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), September 7–8, 2017, Vienna, Austria, S. 9-1 - 9-15
ISBN
978-3-95977-042-2
URL
http://www.dagstuhl.de/dagpub/978-3-95977-042-2
URN
urn:nbn:de:0030-drops-79109
OASIcs - OpenAccess Series in Informatics ; Volume 59

Line-distortion, Bandwidth and Path-length of a graph

Author(s)
Dragan, Feodor F., Köhler, Ekkehard, Leitert, Arne
Type
Scientific Article ref.
Year of publication
2017
Source
Algorithmica, S. 686 - 713
Volume
77
Issue/Journal number
3
ISSN
0178-4617
1432-0541
DOI
https://doi.org/10.1007/s00453-015-0094-7

Eccentricity approximating trees

Author(s)
Dragan, Feodor F., Köhler, Ekkehard, Alrasheed, Hend
Type
Scientific Article ref.
Year of publication
2017
Source
Discrete Applied Mathematics, S. 142 - 156
Volume
232
ISSN
0166-218X
DOI
https://doi.org/10.1016/j.dam.2017.07.017

Energy-efficient shortest routes for electric and hybrid vehicles

Author(s)
Strehler, Martin, Merting, Sören, Schwan, Christian
Type
Scientific Article ref.
Year of publication
2017
Source
Transportation Research Part B: Methodological, S. 111 - 135
Volume
Vol. 103
ISSN
0191-2615
DOI
https://doi.org/10.1016/j.trb.2017.03.007

On the Power of Graph Searching for Cocomparability Graphs

Author(s)
Corneil, Derek G., Dusart, Jérémie, Habib, Michel, Köhler, Ekkehard
Type
Scientific Article ref.
Year of publication
2016
Source
SIAM Journal on Discrete Mathematics (SIDMA), S. 569 - 591
Volume
30
Issue/Journal number
1
ISSN
1095-7146
0895-4801
DOI
https://doi.org/10.1137/15M1012396

Eccentricity Approximating Trees

Author(s)
Dragan, Feodor F., Köhler, Ekkehard, Alrasheed, Hend
Editor(s)
Heggernes, Pinar
Type
conference publication
Year of publication
2016
Publisher name
Berlin [u.a.] : Springer
Source
Graph-Theoretic Concepts in Computer Science, 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, S. 145 - 157
ISBN
978-3-662-53536-3
978-3-662-53535-6
DOI
https://doi.org/10.1007/978-3-662-53536-3_13
Lecture Notes in Computer Science ; 9941

Optimizing Traffic Signal Timings for Mega Events

Author(s)
Scheffler, Robert, Strehler, Martin
Editor(s)
Goerigk, Marc, Werneck, Renato
Type
conference publication
Year of publication
2016
Publisher name
Dagstuhl, Germany : Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Source
16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016),ATMOS’16, August 25, 2016, Aarhus, Denmark, S. 81 - 816
ISBN
978-3-95977-021-7
URL
http://drops.dagstuhl.de/opus/volltexte/2016/6532
URN
urn:nbn:de:0030-drops-66724
DOI
https://doi.org/10.4230/OASIcs.ATMOS.2016.8
OASIcs - OpenAccess Series in Informatics ; 54

Complexity of the maximum leaf spanning tree problem on planar and regular graphs

Author(s)
Reich, Alexander
Type
Scientific Article ref.
Year of publication
2016
Source
Theoretical Computer Science, S. 134 - 143
Volume
626
ISSN
0304-3975
DOI
https://doi.org/10.1016/j.tcs.2016.02.011

Minimum strictly fundamental cycle bases of planar graphs are hard to find

Author(s)
Reich, Alexander
Type
Scientific Article ref.
Year of publication
2016
Source
Discrete Applied Mathematics, S. 150 - 159
Volume
205
ISSN
0166-218X
DOI
https://doi.org/10.1016/j.dam.2015.12.001

The Maximum Flow Problem for Oriented Flows

Author(s)
Schade, Stanley, Strehler, Martin
Editor(s)
Goerigk, Marc, Werneck, Renato
Type
conference publication
Year of publication
2016
Publisher name
Dagstuhl, Germany : Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
network flow with orientation, graph expansion, approximation, container logistics, train routing
Source
16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), S. 1 - 13
ISBN
978-3-95977-021-7
URL
http://drops.dagstuhl.de/opus/volltexte/2016/6531
URN
urn:nbn:de:0030-drops-65318
DOI
https://doi.org/10.4230/OASIcs.ATMOS.2016.7
OASIcs - OpenAccess Series in Informatics ; 54

Traffic signal optimization: combining static and dynamic models

Author(s)
Köhler, Ekkehard, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2015
Discrete Mathematics
Source
arXiv.org
URL
http://arxiv.org/abs/1509.08709

Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes

Author(s)
Merting, Sören, Schwan, Christian, Strehler, Martin
Editor(s)
Italiano, Giuseppe F., Schmidt, Marie
Type
conference publication
Year of publication
2015
Publisher name
Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
routing of electric vehicles, constrained shortest paths, FPTAS, con- strained network flow
Source
15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015), S. 29 - 41
ISBN
978-3-939897-99-6
URL
http://drops.dagstuhl.de/opus/volltexte/2015/5455
URN
urn:nbn:de:0030-drops-54559
DOI
https://doi.org/10.4230/OASIcs.ATMOS.2015.29
OASIcs - OpenAccess Series in Informatics ; 48

Linear Structure of Graphs and the Knotting Graph

Author(s)
Köhler, Ekkehard
Type
part of book (chapter)
Year of publication
2015
Publisher name
Cham [u.a.] : Springer International Publishing
Source
Gems of Combinatorial Optimization and Graph Algorithms, S. 13 - 27
ISBN
978-3-319-24971-1
978-3-319-24970-4
DOI
https://doi.org/10.1007/978-3-319-24971-1_2

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

Author(s)
Köhler, Ekkehard, Mouatadid, Lalla
Type
Scientific Article ref.
Year of publication
2015
Source
Information Processing Letters, S. 391 - 395
Volume
116
Issue/Journal number
6
ISSN
0020-0190
DOI
https://doi.org/10.1016/j.ipl.2015.12.001

Traffic signal optimization using cyclically expanded networks

Author(s)
Köhler, Ekkehard, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2015
Source
Networks, S. 244 - 261
Volume
65
Issue/Journal number
3
DOI
https://doi.org/10.1002/net.21601

Polynomial-Time Algorithms for Special Cases of the Maximum Confluent Flow Problem

Author(s)
Dressler, Daniel, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2014
Source
Discrete Applied Mathematics, S. 142 - 154
Volume
163
Issue/Journal number
2
ISSN
0166-218X

Linear Time LexDFS on Cocomparability Graphs

Author(s)
Köhler, Ekkehard, Mouatadid, Lalla
Editor(s)
Ravi, R., Gortz, Inge Li
Type
conference publication
Year of publication
2014
Publisher name
Cham : Springer
Source
Algorithm Theory – SWAT 2014, 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014, S. 319 - 330
ISBN
978-3-319-08404-6
URL
http://link.springer.com/chapter/10.1007%2F978-3-319-08404-6_28
DOI
https://doi.org/10.1007/978-3-319-08404-6_28
Lecture Notes in Computer Science ; 8503

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

Author(s)
Dragan, Feodor F., Köhler, Ekkehard, Leitert, Arne
Type
conference publication
Year of publication
2014
Publisher name
Springer International Publ.
Source
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014, S. 158 - 169
ISBN
978-3-319-08404-6
978-3-319-08403-9
DOI
https://doi.org/10.1007/978-3-319-08404-6_14
Lecture Notes in Computer Science ; 8503

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

Author(s)
Dragan, Feodor F., Köhler, Ekkehard
Type
Scientific Article ref.
Year of publication
2014
Source
Algorithmica, S. 884 - 905
Volume
69
Issue/Journal number
4
DOI
https://doi.org/10.1007/s00453-013-9765-4

Combining Static and Dynamic Models for Traffic Signal Optimization Inherent Load-dependent Travel Times in a Cyclically Time-expanded Network Model

Author(s)
Köhler, Ekkehard, Strehler, Martin
Type
Scientific Article ref.
Year of publication
2012
Source
Procedia - Social and Behavioral Science, S. 1125 - 1134
Volume
54
ISSN
1877-0428
URL
http://www.sciencedirect.com/science/article/pii/S1877042812042899
DOI
https://doi.org/10.1016/j.sbspro.2012.09.827

Signalized Flows – optimizing traffic signals and guideposts and related network flow problems

Author(s)
Strehler, Martin
Type
doctoralthesis
Year of publication
2012
URN
urn:nbn:de:kobv:co1-opus-23637

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

Author(s)
Dragan, Feodor F., Köhler, Ekkehard
Type
conference publication
Year of publication
2012
Publisher name
Berlin [u.a.] : Springer
Source
Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings, S. 171 - 183
ISBN
978-3-642-22934-3
978-3-642-22935-0
DOI
https://doi.org/10.1007/978-3-642-22935-0_15
Lecture Notes in Computer Science ; 6845

Collective additive tree spanners for circle graphs and polygonal graphs

Author(s)
Dragan, Feodor F., Corneil, Derek G., Köhler, Ekkehard, Xiang, Yang
Type
Scientific Article ref.
Year of publication
2012
Source
Discrete Applied Mathematics, S. 1717 - 1729
Volume
160
Issue/Journal number
12
DOI
https://doi.org/10.1016/j.dam.2012.03.036

Signalanlagenoptimierung mit zyklisch expandierten Netzwerken

Author(s)
Köhler, Ekkehard, Strehler, Martin
Type
conference publication
Year of publication
2011
Publisher name
Köln : FGSV-Verlag
Source
Optimierung in Verkehr und Transport, 16./17. 03. 2011, Stuttgart, Tagungsband Heureka '11, S. 314 - 333
ISBN
978-3-941790-72-8

An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs

Author(s)
Dragan, Feodor F., Köhler, Ekkehard
Type
conference publication
Year of publication
2011
Publisher name
Heidelberg [u.a.] : Springer
Source
Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, S. 171 - 183
ISBN
978-3-642-22934-3
Lecture Notes in Computer Science ; 6845

Capacitated Confluent Flows: Complexity and Algorithms

Author(s)
Strehler, Martin, Dressler, Daniel
Type
conference publication
Year of publication
2010
Publisher name
Springer : Berlin
Source
Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, 2010, S. 347 - 358
ISBN
978-3-642-13073-1
Lecture Notes in Computer Science ; 6078

Length-bounded cuts and flows

Author(s)
Baier, Georg, Erlebach, Thomas, Hall, Alexander, Köhler, Ekkehard, Schilling, Heiko, Skutella, Martin
Type
Scientific Article ref.
Year of publication
2010
Source
ACM Transactions on Algorithms 7(2010)1, S. 4:1 - 4:27, 1549-6325

Traffic signal optimization using cyclically expanded networks

Author(s)
Köhler, Ekkehard, Strehler, Martin
Type
conference publication
Year of publication
2010
Publisher name
Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Source
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), September 9, 2010, Liverpool, United Kingdom, S. 114 - 129
ISBN
978-3-939897-20-0
OASIcs - OpenAccess Seriesin Informatics ; 14

On end-vertices of Lexicographic Breadth First Searches

Author(s)
Corneil, Derek G., Köhler, Ekkehard, Lanlignel, Jean-Marc
Type
Scientific Article ref.
Year of publication
2010
Source
Discrete Applied Mathematics, S. 434 - 443
Volume
158
Issue/Journal number
5
ISSN
0166-218X
DOI
https://doi.org/10.1016/j.dam.2009.10.001

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

Author(s)
Hilger, Moritz, Köhler, Ekkehard, Möhring, Rolf H., Schilling, Heiko
Type
part of book (chapter)
Year of publication
2009
Source
Demetrescu, Camil (Hrsg.): The shortest path problem. - Providence, R.I : American Mathematical Society, 2009, S. 41 - 72, 978-0-8218-4383-3 (DIMACS Series in discrete mathematics and theoretical computer science ; 74)

Traffic networks and flows over time

Author(s)
Köhler, Ekkehard, Möhring, Rolf H., Skutella, Martin
Type
part of book (chapter)
Year of publication
2009
Source
Lerner, Jürgen (Hrsg.): Algorithmics of large and complex networks. - Berlin : Springer, 2009, S. 166 -196, 978-3-642-02093-3 (Lecture notes in computer science ; 5515)

Lower bounds for strictly fundamental cycle bases in grid graphs

Author(s)
Köhler, Ekkehard, Liebchen, Christian, Wünsch, Gregor, Rizzi, Romeo
Type
Scientific Article ref.
Year of publication
2009
Source
Networks : an international journal, S. 191 - 205
Volume
53
Issue/Journal number
2
ISSN
1097-0037
DOI
https://doi.org/10.1002/net.20283

Additive Spanners for Circle Graphs and Polygonal Graphs

Author(s)
Dragan, Feodor F., Corneil, Derek G., Köhler, Ekkehard, Xiang, Yang
Type
conference publication
Year of publication
2008
Publisher name
Berlin [u.a.] : Springer
Source
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008, S. 110 - 121
ISBN
978-3-540-92247-6
DOI
https://doi.org/10.1007/978-3-540-92248-3_11
Lecture Notes in Computer Science ; 5344

The Maximum Energy-Constrained Dynamic Flow Problem

Author(s)
Fekete, Sándor P., Hall, Alexander, Köhler, Ekkehard, Kröller, Alexander
Type
conference publication
Year of publication
2008
Source
Algorithm Theory - SWAT 2008/11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden. - Berlin : Springer, 2008, S. 114-126, 978-3-540-69900-2 (Lecture notes in computer science ; 5124)

Dynamic Routing of Automated Guided Vehicles in Real-time

Author(s)
Gawrilow, Ewgenij, Köhler, Ekkehard, Möhring, Rolf H., Stenzel, Björn
Type
part of book (chapter)
Year of publication
2008
Source
Jäger, Hans-Joachim (Hrsg.): Mathematics - Key Technology for the Future. - Berlin: Springer, 2008, S. 165-178, 978-3-642-09590-0

Optimization of signalized traffic networks

Author(s)
Köhler, Ekkehard, Möhring, Rolf H., Nökel, K., Wünsch, Gregor
Type
part of book (chapter)
Year of publication
2008
Source
Jäger, Willi (Hrsg.): Mathematics - key technology for the future. - Berlin : Springer, 2008, S. 179 - 188, 978-3-540-77202-6

Approximating earliest arrival flows with flow-dependent transit times

Author(s)
Baumann, Nadine, Köhler, Ekkehard
Type
Scientific Article ref.
Year of publication
2007
Source
Discrete Applied Mathematics 155(2007)2, S. 161 - 171, 0166-218x

Benchmarks for strictly fundamental cycle bases

Author(s)
Liebchen, Christian, Wünsch, Gregor, Köhler, Ekkehard, Reich, Alexander, Rizzi, Romeo
Type
conference publication
Year of publication
2007
Source
Experimental Algorithms / 6th International Workshop, WEA 2007, Rome, 2007, S. 365-378, 978-3-540-72845-0 (Lecture Notes in Computer Science; 4525)

Length-bounded cuts and flows

Author(s)
Baier, Georg, Erlebach, Thomas, Hall, Alexander, Köhler, Ekkehard, Schilling, Heiko, Skutella, Martin
Type
conference publication
Year of publication
2006
Source
Bugliesi, Michele (Hrsg.): Automata, Languages and Programming. - Berlin : Springer, 2006, S. 679 - 690, 978-3-540-35905-0 (Lecture notes in computer science ; 4051)

Linear Orderings of Subfamilies of AT-Free Graphs

Author(s)
Corneil, Derek G., Köhler, Ekkehard, Olariu, Stephan, Stewart, Lorna
Type
Scientific Article ref.
Year of publication
2006
Source
SIAM Journal on Discrete Mathematics 20(2006)1, S. 105-118, 0895-4801

Higher-Dimensional Packing with Order Constraints

Author(s)
Fekete, Sándor P., Köhler, Ekkehard, Teich, Jürgen
Type
Scientific Article ref.
Year of publication
2006
Source
SIAM Journal on Discrete Mathematics 20(2006)4, S. 1056-1078, 0895-4801

The k-Splittable Flow Problem

Author(s)
Baier, Georg, Köhler, Ekkehard, Skutella, Martin
Type
Scientific Article ref.
Year of publication
2005
Source
Algorithmica 42(2005) 3/4, S. 231-248, 0178-4617

Collective tree 1-spanners for interval graphs

Author(s)
Corneil, Derek G., Dragan, Feodor F., Köhler, Ekkehard, Yan, Chenyu
Editor(s)
Kratsch, Dieter
Type
conference publication
Year of publication
2005
Publisher name
Berlin [u.a.] : Springer
Source
Graph theoretic concepts in computer science, 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005, S. 151 - 162
ISBN
3-540-31000-2
978-3-540-31000-6
Lecture notes in computer science ; 3787

Flows over Time with Load-Dependent Transit Times

Author(s)
Köhler, Ekkehard, Skutella, Martin
Type
article
Year of publication
2005
Source
SIAM Journal on Optimization 15(2005)4, S. 1185-1202, 1052-6234

Acceleration of shortest path and constrained shortest path computation

Author(s)
Köhler, Ekkehard, Möhring, Rolf H., Schilling, Heiko
Type
conference publication
Year of publication
2005
Source
Experimental and efficient algorithms / 4th International Workshop, WEA 2005, Santorini Island, Greece, 2005, S. 126-138, 3-540-25920-1 ( Lecture Notes in Computer Science ; 3503)

Conflict-free Real-time AGV Routing

Author(s)
Möhring, Rolf H., Köhler, Ekkehard, Gawrilow, Ewgenij, Stenzel, Björn
Type
conference publication
Year of publication
2005
Publisher name
Berlin [u.a.] : Springer
Source
Operations Research Proceedings 2004, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Jointly Organized with the Netherlands Society for Operations Research (NGB) Tilburg, September 1–3, 2004, S. 18 - 24
ISBN
978-3-540-24274-1
978-3-540-27679-1
DOI
https://doi.org/10.1007/3-540-27679-3_3

Approximating earliest arrival flows with flow-dependent transit times

Author(s)
Baumann, Nadine, Köhler, Ekkehard
Type
conference publication
Year of publication
2004
Source
Fiala, Jiri (Hrsg.): 29. Mathematical foundations of computer science. - Berlin : Springer, 2004, S. 599 - 690, 3-540-22823-3 (Lecture notes in computer science ; 3153)

Color sequencing

Author(s)
Epping, Thomas
Type
doctoralthesis
Year of publication
2004
Publisher name
Cottbus : Brandenburgische Techn. Univ.
APX-hardness; binary matroids; dynamic programming; flexible manufacturing systems; MexFlow-MinCut; multiple sequence alignment; NP-completenes; paint shop; project management and scheduling; sequencing
URN
urn:nbn:de:kobv:co1-000000572

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks

Author(s)
Köhler, Ekkehard, Möhring, Rolf H., Wünsch, Gregor
Type
conference publication
Year of publication
2004
Source
Operations Research Proceedings 2004 / International Conference of the German Operations Research Society (GOR), Tilburg, 2004, S. 192-199, 3-540-27679-3

Hereditary dominating pair graphs

Author(s)
Przulj, Natasha, Corneil, Derek G., Köhler, Ekkehard
Type
Scientific Article ref.
Year of publication
2004
Source
Discrete Applied Mathematics 134(2004)1-3, S. 239-261, 0166-218X

Recognizing graphs without asteroidal triples

Author(s)
Köhler, Ekkehard
Type
article
Year of publication
2004
Source
Journal of Discrete Algorithms 2( 2004)4, S. 439-452, 1570-8667 (Lecture Notes in Computer Science; 2000)

Flows over Time with Load-Dependent Transit Times

Author(s)
Köhler, Ekkehard, Skutella, Martin
Type
conference publication
Year of publication
2003
Source
Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2002. - New York : ACM-Press, 2002, S. 174-183, 0-89871-513-X

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

Author(s)
Köhler, Ekkehard, Corneil, Derek G., Dragan, Feodor F.
Type
article
Year of publication
2003
Source
Networks 42 (2003)4, S. 209-223, 2190-5428

MaxFlow-MinCut Duality for a Paint Shop Problem

Author(s)
Epping, Thomas, Hochstättler, Winfried, Lübbecke, Marco E.
Type
report
Year of publication
2002
Publisher name
Cottbus : BTU
URL
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2981

On the power of BFS to determine a graphs diameter

Author(s)
Corneil, Derek G., Dragan, Feodor F., Köhler, Ekkehard
Editor(s)
Rajsbaum, Sergio
Type
conference publication
Year of publication
2002
Publisher name
Berlin [u.a.] : Springer
Source
LATIN 2002, theoretical informatics, proceedings, 5th Latin American Symposium, Cancun, Mexico, April 3 - 6, 2002, S. 209 - 223
ISBN
3-540-43400-3
Lecture notes in computer science ; 2286

Time-Expanded Graphs for Flow-Dependent Transit Times

Author(s)
Köhler, Ekkehard, Langkau, Katharina, Skutella, Martin
Type
conference publication
Year of publication
2002
Source
Algorithms - ESA 2002 / 10th Annual European Symposium, Rome, Italy, 2002, S. 49-56, 3-540-45749-6 (Lecture Notes in Computer Science ; 2461)

On the k-Splittable Flow Problem

Author(s)
Baier, Georg, Köhler, Ekkehard, Skutella, Martin
Type
conference publication
Year of publication
2002
Source
Algorithms - ESA 2002 / 10th Annual European Symposium Rome, Italy, 2002, S. 229-236, 3-540-45749-6 (Lecture Notes in Computer Science ; 2461)

Flows over time with load-dependent transit times

Author(s)
Köhler, Ekkehard, Skutella, Martin
Type
conference publication
Year of publication
2002
Publisher name
New York [u.a.] : ACM Press [u.a.]
Source
Proceeding SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, S. 174 - 183
ISBN
0-89871-513-X

Storage and retrieval of car bodies by the use of line storage systems

Author(s)
Epping, Thomas, Hochstättler, Winfried
Type
report
Year of publication
2002
Publisher name
Cottbus : BTU, Lehrstuhl für Mathematische Grundlagen der Informatik
Dynamic programming; Line storage systems; Paint shop
URL
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.4011

Sorting with Line Storage Systems

Author(s)
Epping, Thomas, Hochstättler, Winfried
Type
report
Year of publication
2002
Publisher name
Cottbus : BTU
URL
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2510

Higher-Dimensional Packing with Order Constraints

Author(s)
Fekete, Sándor P., Köhler, Ekkehard, Teich, Jürgen
Type
conference publication
Year of publication
2001
Source
Algorithms and Data Structures / 7th International Workshop, WADS 2001 Providence, RI, USA . - Berlin : Springer, 2001, S. 300-312, 3-540-42423-7 (Lecture notes in computer science ; 2125)

On subfamilies of AT-free graphs

Author(s)
Köhler, Ekkehard, Corneil, Derek G., Olariu, Stephan, Stewart, Lorna
Type
conference publication
Year of publication
2001
Source
Graph-Theoretic Concepts in Computer Science / 27th International Workshop, WG 2001 Boltenhagen, Germany. - Berlin : Springer, 2001, S. 241-253, 978-3-540-42707-0 (Lecture notes in computer science ; 2204)

Some Results on a Paint Shop Problem for Words

Author(s)
Hochstättler, Winfried, Oertel, Peter
Type
Scientific Article ref.
Year of publication
2001
Source
Electronic Notes in Discrete Mathematics, S. 31 - 33
Issue/Journal number
8
ISSN
1571-0653

Algorithmen für Speditionsprobleme mit Umlademöglichkeiten

Author(s)
Hochstättler, Winfried, Mues, C., Oertel, Peter
Editor(s)
Inderfurth, Karl
Type
conference publication
Year of publication
2001
Publisher name
Magdeburg : LOGISCH GmbH
Source
Logistik 2000plus, 6. Magdeburger Logistik-Tagung, Magdeburg, 16./17. November 2000, S. 38 - 50
ISBN
3-930385-27-9

Tic-Tac-Toe or Is the Dual of an Algebraic Matroid Algebraic?

Author(s)
Hochstättler, Winfried
Editor(s)
Král', Daniel
Type
conference publication
Year of publication
2001
Publisher name
Praha : Charles Univ.
Source
Graph Theory Day IV, Prague 2001
KAM-DIMATIA series ; 522

Extending Partial Suborders

Author(s)
Fekete, Sándor P., Köhler, Ekkehard, Teich, Jürgen
Type
Scientific Article ref.
Year of publication
2001
Source
Electronic Notes in Discrete Mathematics 8(2001), S. 34-37,1571-0653

Optimal FPGA module placement with temporal precedence constraints

Author(s)
Fekete, Sándor P., Köhler, Ekkehard, Teich, Jürgen
Editor(s)
Nebel, Wolfgang
Type
conference publication
Year of publication
2001
Publisher name
Los Alamitos [u.a.] : Computer Society Press
Source
Proceedings, Design, Automation and Test in Europe Conference and Exhibition 2001, Munich, Germany, March 13 - 16, 2001, S. 658 - 665
ISBN
0-7695-0993-2

Connected domination and dominating clique in trapezoid graphs

Author(s)
Köhler, Ekkehard
Type
article
Year of publication
2000
Source
Discrete Applied Mathematics 99 (2000) 1-3, S. 91-110, 0166-218x

Recognizing Graphs without Asteroidal Triples

Author(s)
Köhler, Ekkehard
Type
conference publication
Year of publication
2000
Publisher name
Berlin [u.a.] : Springer
Source
Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000 Konstanz, Germany, June 15–17, 2000 Proceedings (Ulrik Brandes and Dorothea Wagner, eds.), LNCS 1928, Springer, 2000, S. 255 - 266
ISBN
978-3-540-41183-3
978-3-540-40064-6
DOI
https://doi.org/10.1007/3-540-40064-8_24

Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs

Author(s)
Brandstädt, Andreas, Dragan, Feodor F., Köhler, Ekkehard
Type
Scientific Article ref.
Year of publication
2000
Source
SIAM journal on computing, S. 1662 - 1677
Volume
30
Issue/Journal number
5
ISSN
0097-5397