begutachtete Artikel in Fachzeitschriften und Sammelbänden

  • R. Scheffler, A. Mansouri Yarahmadi, M. Breuß, and E. Köhler: A Graph Theoretic Approach for Shape from Shading. In: Energy Minimization Methods in Computer Vision and Pattern Recognition (M. Pelillo and E. Hancock, ed.). EMMCVPR 2017. Lecture Notes in Computer Science, Volume 10746. pages 328-341, Springer 2018.
  • R. Scheffler and M. Strehler: Optimizing Traffic Signal Settings for Public Transport Priority. In Proceedings of the 17th Workshop for Transportation Modelling, Optimization, and Systems ATMOS 2017, OASICs volume 59, pp. 9:1-9:15, 2017. DOI 10.4230/OASIcs.ATMOS.2017.9
  • M. Strehler, S. Merting, and C. Schwan: Energy-efficient shortest routes for electric and hybrid vehicles. Transportation Research Part B: Methodological, Volume 103, pages 111-135, Elsevier, 2017. DOI 10.1016/j.trb.2017.03.007
  • S. Schade and M. Strehler: The Maximum Flow Problem for Oriented Flows. In Proceedings of the 16th Workshop for Transportation Modelling, Optimization, and Systems ATMOS 2016, OASICs volume 54, pp. 7:1-7:13, 2016. DOI 10.4230/OASIcs.ATMOS.2016.7
  • R. Scheffler and M. Strehler: Optimizing Traffic Signal Timings for Mega Events. In Proceedings of the 16th Workshop for Transportation Modelling, Optimization, and Systems ATMOS 2016, OASICs volume 54, pp. 8:1-8:16, 2016. DOI 10.4230/OASIcs.ATMOS.2016.8
  • A. Reich: Complexity of the maximum leaf spanning tree problem on planar and regular graphs. Theoretical Computer Science, 626:134-143, 2016.
  • E. Köhler and L. Mouatadid: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Information Processing Letters, 2015. DOI 10.1016/j.ipl.2015.12.001
  • A. Reich: Minimum strictly fundamental cycle bases of planar graphs are hard to find. Discrete Applied Mathematics, 205: 150-159, 2015. DOI 10.1016/j.dam.2015.12.001
  • F.F. Dragan, E. Köhler, and A. Leitert: Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica, 2015. DOI 10.1007/s00453-015-0094-7
  • S.Merting, C. Schwan, and M. Strehler: Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes. In Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems ATMOS 2015 (G.F. Italiano and M. Schmidt, ed.), OpenAccess Series in Informatics (OASIcs), volume 48, pp. 29--41, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015,  http://drops.dagstuhl.de/opus/volltexte/2015/5455.
  • E. Köhler and M. Strehler: Traffic signal optimization using cyclically expanded networks. Networks 65(3):244-261, 2015. DOI 10.1002/net.21601
  • F.F. Dragan and E. Köhler: An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica 69(4):884--905, 2014. DOI 10.1007/s00453-013-9765-4
  • D. Dressler and M. Strehler: Polynomial-Time Algorithms for Special Cases of the Maximum Confluent Flow Problem. Discrete Applied Mathematics, 163:142-154, 2014.
  • F.F. Dragan, E. Köhler, and A. Leitert: Line-Distortion, Bandwidth and Path-Length of a Graph. In Proceedings of Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, pp. 158-169, Copenhagen, Denmark, July 2-4, 2014. DOI 10.1007/978-3-319-08404-6_14
  • E. Köhler and L. Mouatadid: Linear Time LexDFS on Cocomparability Graphs. In Proceedings of Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, pp. 319-330, Copenhagen, Denmark, July 2-4, 2014. DOI 10.1007/978-3-319-08404-6_28
  • E. Köhler and M. Strehler: Combining static and dynamic models - Traffic signal optimization and the inherent load-dependent travel times of cyclically time-expanded networks. In Proceedings of the 15th Meeting of the European Working Group on Transportation, Elsevier, 2012.
  • F.F. Dragan, D.G. Corneil, E. Köhler, and Y. Xiang: Collective additive tree spanners for circle graphs and polygonal graphs Discrete Applied Mathematics 160(12):1717-1729, 2012. DOI 10.1016/j.dam.2012.03.036
  • E. Köhler and M. Strehler: Lichtsignalanlagenoptimierung mit zyklisch expandierten Netzwerken in: Tagungsband der Heureka '11, FGSV-Verlag, 2011.
  • F.F. Dragan and E. Köhler: An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. In Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop APPROX and 15th International Workshop RANDOM, pp. 171-183, Princeton, NJ, USA, August 17-19, 2011. DOI 10.1007/978-3-642-22935-0_15
  • G. Baier, T. Erlebach, A. Hall, E. Köhler, P. Kolman, O. Pangrac, H. Schilling, and M. Skutella: Length-Bounded Cuts and Flows. ACM Transactions on Algorithms, volume 7 (1), 2010.
  • E. Köhler and M. Strehler: Traffic Signal Optimization Using Cyclically Expanded Networks in: Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems ATMOS 2010 (T. Erlebach and M. Lübbecke, ed.), OpenAccess Series in Informatics (OASIcs), volume 14, pp. 114--129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010,  http://drops.dagstuhl.de/opus/volltexte/2010/2754.
  • D. Dressler and M. Strehler: Capacitated Confluent Flows: Complexity and Algorithms in: Proceedings of the 7th International Conference on Algorithms and Complexity CIAC 2010, LNCS 6078, pp. 347-358, Springer, Heidelberg, 2010.
  • D.G. Corneil, E. Köhler, and J.-M. Lanlignel: On end-vertices of Lexicographic Breadth First Searches. Discrete Applied Mathematics 158(5):434-443, 2010. DOI10.1016/j.dam.2009.10.001
  • E. Köhler, C. Liebchen, G. Wünsch, and R. Rizzi: Lower bounds for strictly fundamental cycle bases in grid graphs. Networks 53(2):191-205, 2009. DOI 10.1002/net.20283
  • E. Köhler, R.H. Möhring, and M. Skutella: Traffic networks and flows over time in: Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation (J. Lerner, D. Wagner and K. A. Zweig, ed.), LNCS 5515, pp. 166-196, Springer, Berlin, 2009.
  • F.F. Dragan, D.G. Corneil, E. Köhler, and Y. Xiang: Additive Spanners for Circle Graphs and Polygonal Graphs. In Proceedings of Graph-Theoretic Concepts in Computer Science, 34th International Workshop WG, pp. 110-121, Durham, UK, June 30 - July 2, 2008. DOI 10.1007/978-3-540-92248-3_11
  • S. P. Fekete, A. Hall, E. Köhler, and A. Kröller: The maximum energy-constrained dynamic flow problem, in Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), LNCS 5124, Springer, 2008.
  • F. F. Dragan, D. G. Corneil, E. Köhler, and Y. Xiang: Additive spanners for circle graphs and polygonal graphs, in Proceedings of Workshop on Graphtheoretic Concepts in Computer Science 2008, LNCS, Springer, 2008.
  • E. Köhler, R. H. Möhring, K. Nökel, and G. Wünsch: Optimization of signalized traffic networks, in Mathematics Key Technology for the Future (H.-J. E. Jäger, Willi; Krebs, ed.), pp. 179-188, Springer, 2008.
  • E. Gawrilow, E. Köhler, R. H. Möhring, B. Stenzel: Dynamic routing of automated guided vehicles in real-time, in Mathematics Key Technology for the Future (H.-J. E. Jäger, Willi; Krebs, ed.), pp. 165-178, Springer, 2008.
  • N. Baumann and E. Köhler: Approximating earliest arrival flows with flow-dependent transit times, Discrete Applied Mathematics, 155:161-171, 2007.
  • C. Liebchen, G. Wünsch, E. Köhler, A. Reich, and R. Rizzi: Benchmarks for strictly fundamental cycle bases, Experimental and Efficient Algorithms - WEA 2007, LNCS 4525, Springer, 2007, pp. 365-378.
  • E. Köhler, R. H. Möhring, and H. Schilling: Fast point-to-point shortest path computations with arc-flags, Proceedings of 9th DIMACS Implementation Challenge - Shortest Paths, 2007,  http://www.dis.uniroma1.it/~challenge9/papers.shtml.
  • G. Baier, T. Erlebach, A. Hall, E. Köhler, H. Schilling, and M. Skutella: Length-bounded cuts and flows, Automata, Languages and Programming, Proceedings of 33rd International Colloquium, ICALP 2006, LNCS 4051, Springer, 2006, pp. 679-690.
  • D. G. Corneil, E. Köhler, S. Olariu, and L. Stewart: Linear orderings of subfamilies of AT-free graphs, SIAM Journal on Discrete Mathematics 20 (2006), no. 1, 105-118.
  • S. P. Fekete, E. Köhler, and J. Teich: Higher-dimensional packing with order constraints, SIAM Journal on Discrete Mathematics 20 (2006), no. 4, 1056-1078.