TY - CHAP A1 - Scheffler, Robert A1 - Strehler, Martin ED - Goerigk, Marc ED - Werneck, Renato T1 - Optimizing Traffic Signal Timings for Mega Events T2 - 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), ATMOS’16, August 25, 2016, Aarhus, Denmark Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-66724 UR - http://drops.dagstuhl.de/opus/volltexte/2016/6532 SN - 978-3-95977-021-7 SP - 8,1 EP - 8,16 PB - Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik CY - Dagstuhl, Germany ER - TY - CHAP A1 - Strehler, Martin A1 - Scheffler, Robert ED - D'Angelo, Gianlorenzo ED - Dollevoet, Twan T1 - Optimizing Traffic Signal Settings for Public Transport Priority T2 - 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), September 7–8, 2017, Vienna, Austria KW - transit signal priority KW - traffic flow KW - traffic signal optimization KW - cyclically time-expanded network KW - public transport Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0030-drops-79109 UR - http://www.dagstuhl.de/dagpub/978-3-95977-042-2 SN - 978-3-95977-042-2 SP - 9-1 EP - 9-15 PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH CY - Wadern 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 - CHAP A1 - Scheffler, Robert A1 - Strehler, Martin A1 - Vargas Koch, Laura ED - Christodoulou, George ED - Harks, Tobias T1 - Equilibria in Routing Games with Edge Priorities T2 - 14th International Conference, WINE 2018, Oxford, UK, December 15–17, 2018, Proceedings Y1 - 2018 SN - 978-3-030-04612-5 U6 - https://doi.org/10.1007/978-3-030-04612-5_27 SP - 408 EP - 422 PB - Springer International Publishing CY - Cham ER -