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
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
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
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
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
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
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
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
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
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
Bugliesi, Michele (Hrsg.): Automata, Languages and Programming. - Berlin : Springer, 2006, S. 679 - 690, 978-3-540-35905-0 (Lecture notes in computer science ; 4051)
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
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)
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)
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
Discrete Applied Mathematics 134(2004)1-3, S. 239-261, 0166-218X
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
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
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
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
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)
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)
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
Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
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
This website uses cookies. There are two types of cookies: The first type supports the basic functionality of our website. The second allows us to improve our content for you by saving and analyzing pseudonymised user data. Since this second type is technically not required to run the website, you can withdraw your consent to those cookies at any time. For more information please visit our pages on data protection.
