TY - GEN A1 - Dragan, Feodor F. A1 - Köhler, Ekkehard A1 - Leitert, Arne T1 - Line-distortion, Bandwidth and Path-length of a graph T2 - Algorithmica Y1 - 2017 U6 - https://doi.org/10.1007/s00453-015-0094-7 SN - 0178-4617 SN - 1432-0541 VL - 77 IS - 3 SP - 686 EP - 713 ER - TY - CHAP A1 - Dragan, Feodor F. A1 - Köhler, Ekkehard A1 - Alrasheed, Hend ED - Heggernes, Pinar T1 - Eccentricity Approximating Trees T2 - Graph-Theoretic Concepts in Computer Science, 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016 Y1 - 2016 SN - 978-3-662-53536-3 SN - 978-3-662-53535-6 U6 - https://doi.org/10.1007/978-3-662-53536-3_13 SP - 145 EP - 157 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Köhler, Ekkehard T1 - Linear Structure of Graphs and the Knotting Graph T2 - Gems of Combinatorial Optimization and Graph Algorithms Y1 - 2015 SN - 978-3-319-24971-1 SN - 978-3-319-24970-4 U6 - https://doi.org/10.1007/978-3-319-24971-1_2 SP - 13 EP - 27 PB - Springer International Publishing CY - Cham [u.a.] ER - TY - GEN A1 - Dragan, Feodor F. A1 - Köhler, Ekkehard A1 - Alrasheed, Hend T1 - Eccentricity approximating trees T2 - Discrete Applied Mathematics Y1 - 2017 U6 - https://doi.org/10.1016/j.dam.2017.07.017 SN - 0166-218X VL - 232 SP - 142 EP - 156 ER - TY - CHAP A1 - Scheffler, Robert A1 - Mansouri Yarahmadi, Ashkan A1 - Breuß, Michael A1 - Köhler, Ekkehard ED - Pelillo, Marcello ED - Hancock, Edwin T1 - A Graph Theoretic Approach for Shape from Shading T2 - Energy minimization methods in computer vision and pattern recognition , 11th International Conference, EMMCVPR 2017, Venice, Italy, October 30 – November 1, 2017 N2 - Resolving ambiguities is a fundamental problem in shape from shading (SFS). The classic SFS approach allows to reconstruct the surface locally around singular points up to an ambiguity of convex, concave or saddle point type. In this paper we follow a recent approach that seeks to resolve the local ambiguities in a global graph-based setting so that the complete surface reconstruction is consistent. To this end, we introduce a novel graph theoretic formulation for the underlying problem that allows to prove for the first time in the literature that the underlying surface orientation problem is NP-complete. Moreover, we show that our novel framework allows to define an algorithmic framework that solves the disambiguation problem. It makes use of cycle bases for dealing with the graph construction and enables an easy embedding into an optimization method that amounts here to a linear program. KW - Shape from shading KW - Ambiguity KW - Configuration graph KW - Cycle basis Y1 - 2018 SN - 978-3-319-78198-3 U6 - https://doi.org/10.1007/978-3-319-78199-0_22 SP - 328 EP - 341 PB - Springer CY - Cham ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Recognizing Graph Search Trees T2 - arXiv.org Y1 - 2018 UR - https://arxiv.org/abs/1811.09249v2 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - On the End-Vertex Problem of Graph Searches T2 - Discrete Mathematics & Theoretical Computer Science Y1 - 2019 SN - 1365-8050 SN - 1462-7264 VL - 21 IS - 1 ER - TY - GEN A1 - Beisegel, Jesse A1 - Chiarelli, Nina A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Milanič, Martin A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin ED - Adler, Isolde ED - Müller, Haiko T1 - Edge Elimination and Weighted Graph Classes T2 - Graph-Theoretic Concepts in Computer Science - 46th International Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020 Y1 - 2020 SN - 978-3-030-60439-4 SN - 978-3-030-60440-0 U6 - https://doi.org/10.1007/978-3-030-60440-0_11 SN - 1611-3349 SN - 0302-9743 SP - 134 EP - 147 PB - Springer CY - Cham ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Linear Time LexDFS on Chordal Graphs T2 - 28th Annual European Symposium on Algorithms (ESA) 2020, September 7-9, 2020, Pisa, Italy) Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-128790 UR - https://drops.dagstuhl.de/opus/volltexte/2020/12879 VL - 173 SP - 13:1 EP - 13:13 PB - Schloss Dagstuhl, Leibnitz Zentrum für Informatik ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin ED - Coutinho, Gabriel ED - Kohayakawa, Yoshiharu ED - dos Santos, Vinicius ED - Urrutia, Sebastián T1 - Recognizing Graph Search Trees T2 - The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) 2-7 June 2019, Belo Horizonte, Brazil Y1 - 2019 U6 - https://doi.org/10.1016/j.entcs.2019.08.010 SN - 1571-0661 SP - 99 EP - 110 PB - Elsevier ER - TY - GEN A1 - Köhler, Ekkehard A1 - Strehler, Martin T1 - Traffic Signal Optimization: Combining Static and Dynamic Models T2 - Transportation Science Y1 - 2019 U6 - https://doi.org/10.1287/trsc.2017.0760 SN - 1526-5447 VL - 53 IS - 1 SP - 21 EP - 41 ER - TY - GEN A1 - Beisegel, Jesse A1 - Denkert, Carolin A1 - Köhler, Ekkehard A1 - Krnc, Matjaž A1 - Pivač, Nevena A1 - Scheffler, Robert A1 - Strehler, Martin T1 - The Recognition Problem of Graph Search Trees T2 - SIAM Journal on Discrete Mathematics Y1 - 2021 U6 - https://doi.org/10.1137/20M1313301 SN - 1095-7146 SN - 0895-4801 VL - 35 IS - 2 SP - 1418 EP - 1446 ER - TY - GEN A1 - Hartmann, Carsten A1 - Köhler, Ekkehard A1 - Schmidt, Heiko A1 - Klein, Marten T1 - Scientific computing LAB (SCL) T2 - "Get Into Energy", BTU Cottbus-Senftenberg, ZHG Building, 1 Feb. 2023 N2 - KEY COMPETENCE AND FOCUS • Development of numerical methods and algorithms for multi-energy systems • Multiscale and multiphysics modeling and simulation of P2X technologies • Stochastic simulation and efficient optimization of complex energy networks KW - Energy Innovation Center (EIZ) KW - Scientific Computing Lab (SCL) KW - P2X KW - multiphysics multiscale problems KW - stochastic modeling and simulation KW - network optimization Y1 - 2023 UR - https://www-docs.b-tu.de/fg-stroemungsmodellierung/public/Poster_SCL_seed_v3.pdf CY - Cottbus ER - TY - GEN A1 - Köhler, Ekkehard A1 - Rogge, Markus A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Optimal Bicycle Routes with Few Signal Stops T2 - 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) Y1 - 2023 U6 - https://doi.org/10.4230/OASIcs.ATMOS.2023.1 SN - 978-3-95977-302-7 VL - OASIcs - Open Access Series in Informatics; Band 115 SP - 1:1 EP - 1:14 PB - Schloss Dagstuhl – Leibniz-Zentrum für Informatik CY - Dagstuhl ER - TY - GEN A1 - Beisegel, Jesse A1 - Chiarelli, Nina A1 - Köhler, Ekkehard A1 - Milanič, Martin A1 - Muršič, Peter A1 - Scheffler, Robert T1 - The simultaneous interval number: a new width parameter that measures the similarity to interval graphs T2 - 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024) Y1 - 2024 SN - 978-3-95977-318-8 U6 - https://doi.org/10.4230/LIPIcs.SWAT.2024.7 SP - 7:1 EP - 7:20 PB - Schloss Dagstuhl – Leibniz-Zentrum für Informatik CY - Dagstuhl ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Ratajczak, Fabienne A1 - Scheffler, Robert A1 - Strehler, Martin ED - Královič, Rastislav ED - Kučera, Antonín T1 - Graph search trees and the intermezzo problem T2 - 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) Y1 - 2024 SN - 978-3-95977-335-5 U6 - https://doi.org/10.4230/LIPICS.MFCS.2024.22 SP - 22:1 EP - 22:18 PB - Schloss Dagstuhl – Leibniz-Zentrum für Informatik CY - Dagstuhl ER - TY - GEN A1 - Beisegel, Jesse A1 - Köhler, Ekkehard A1 - Scheffler, Robert A1 - Strehler, Martin T1 - Certifying fully dynamic algorithms for recognition and Hamiltonicity of Threshold and Chain Graphs T2 - Algorithmica Y1 - 2023 U6 - https://doi.org/10.1007/s00453-023-01107-1 SN - 0178-4617 VL - 85 IS - 8 SP - 2454 EP - 2481 ER -