default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Strehler 0001
Person information
- affiliation: Westsächsische Hochschule Zwickau, Germany
- affiliation (former): Brandenburg University of Technology, Cottbus, Germany
Other persons with the same name
- Martin Strehler 0002 — Innovationsmanufaktur GmbH, Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler
, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. MFCS 2024: 22:1-22:18- [i7]Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. CoRR abs/2404.18645 (2024) - 2023
- [j7]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. Algorithmica 85(8): 2454-2481 (2023) - [c12]Ekkehard Köhler, Markus Rogge, Robert Scheffler, Martin Strehler:
Optimal Bicycle Routes with Few Signal Stops. ATMOS 2023: 1:1-1:14 - 2022
- [j6]Robert Scheffler, Martin Strehler, Laura Vargas Koch:
Routing Games with Edge Priorities. ACM Trans. Economics and Comput. 10(1): 1:1-1:27 (2022) - 2021
- [j5]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
The Recognition Problem of Graph Search Trees. SIAM J. Discret. Math. 35(2): 1418-1446 (2021) - 2020
- [c11]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. ESA 2020: 13:1-13:13 - [c10]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler:
Edge Elimination and Weighted Graph Classes. WG 2020: 134-147 - [i6]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. CoRR abs/2005.03523 (2020)
2010 – 2019
- 2019
- [j4]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j3]Ekkehard Köhler, Martin Strehler:
Traffic Signal Optimization: Combining Static and Dynamic Models. Transp. Sci. 53(1): 21-41 (2019) - [c9]Theresa Thunig, Robert Scheffler, Martin Strehler, Kai Nagel:
Optimization and simulation of fixed-time traffic signal control in real-world applications. ANT/EDI40 2019: 826-833 - [c8]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. LAGOS 2019: 99-110 - 2018
- [c7]Robert Scheffler, Martin Strehler, Laura Vargas Koch:
Equilibria in Routing Games with Edge Priorities. WINE 2018: 408-422 - [i5]Robert Scheffler, Martin Strehler, Laura Vargas Koch:
Nash equilibria in routing games with edge priorities. CoRR abs/1803.00865 (2018) - [i4]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. CoRR abs/1810.12253 (2018) - [i3]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. CoRR abs/1811.09249 (2018) - 2017
- [c6]Robert Scheffler, Martin Strehler:
Optimizing Traffic Signal Settings for Public Transport Priority. ATMOS 2017: 9:1-9:15 - 2016
- [c5]Stanley Schade, Martin Strehler:
The Maximum Flow Problem for Oriented Flows. ATMOS 2016: 7:1-7:13 - [c4]Robert Scheffler, Martin Strehler:
Optimizing Traffic Signal Timings for Mega Events. ATMOS 2016: 8:1-8:16 - [i2]Christian Schwan, Martin Strehler:
Energy-efficient Routing of Hybrid Vehicles. CoRR abs/1601.02371 (2016) - 2015
- [j2]Ekkehard Köhler, Martin Strehler:
Traffic signal optimization using cyclically expanded networks. Networks 65(3): 244-261 (2015) - [c3]Sören Merting, Christian Schwan, Martin Strehler:
Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes. ATMOS 2015: 29-41 - [i1]Ekkehard Köhler, Martin Strehler:
Traffic signal optimization: combining static and dynamic models. CoRR abs/1509.08709 (2015) - 2014
- [j1]Daniel Dressler, Martin Strehler:
Polynomial-time algorithms for special cases of the maximum confluent flow problem. Discret. Appl. Math. 163: 142-154 (2014) - 2010
- [c2]Ekkehard Köhler, Martin Strehler:
Traffic Signal Optimization Using Cyclically Expanded Networks. ATMOS 2010: 114-129 - [c1]Daniel Dressler, Martin Strehler:
Capacitated Confluent Flows: Complexity and Algorithms. CIAC 2010: 347-358
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
