default search action
Ben Strasser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j8]Ben Strasser
, Tim Zeitz
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks. ACM J. Exp. Algorithmics 27: 1-28 (2022) - 2021
- [j7]Ben Strasser, Dorothea Wagner, Tim Zeitz
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. Algorithms 14(3): 90 (2021) - [c20]Ben Strasser, Tim Zeitz
A Fast and Tight Heuristic for A* in Road Networks. SEA 2021: 6:1-6:16 - 2020
- [j6]Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch
Integrating public transport into mobiTopp. Future Gener. Comput. Syst. 107: 1089-1096 (2020) - [c19]Ben Strasser, Dorothea Wagner, Tim Zeitz
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. ESA 2020: 81:1-81:14 - [c18]Ben Strasser
PACE Solver Description: Tree Depth with FlowCutter. IPEC 2020: 32:1-32:4 - [c17]Lars Gottesbüren
Engineering Exact Quasi-Threshold Editing. SEA 2020: 10:1-10:14 - [i11]Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. CoRR abs/2003.14317 (2020)
2010 – 2019
- 2019
- [j5]Michael Hamann
Correspondence between Multilevel Graph Partitions and Tree Decompositions. Algorithms 12(9): 198 (2019) - [i10]Ben Strasser, Tim Zeitz
A* with Perfect Potentials. CoRR abs/1910.12526 (2019) - [i9]Ben Strasser, Dorothea Wagner, Tim Zeitz
Space-efficient, Fast and Exact Routing in Time-dependent Road Networks. CoRR abs/1910.12726 (2019) - 2018
- [j4]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. ACM J. Exp. Algorithmics 23 (2018) - [j3]Michael Hamann
Graph Bisection with Pareto Optimization. ACM J. Exp. Algorithmics 23 (2018) - [c16]Michael Hamann
Distributed Graph Clustering Using Modularity and Map Equation. Euro-Par 2018: 688-702 - 2017
- [b1]Ben Strasser:
Algorithm Engineering for Adaptive Route Planning. Karlsruhe University, Germany, 2017 - [c15]Lars Briem, H. Sebastian Buck
Integrating public transport into mobiTopp. ANT/SEIT 2017: 855-860 - [c14]Ben Strasser:
Dynamic Time-Dependent Routing in Road Networks Through Sampling. ATMOS 2017: 3:1-3:17 - [c13]Lars Briem, H. Sebastian Buck
Efficient Traffic Assignment for Public Transit Networks. SEA 2017: 20:1-20:14 - [i8]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. CoRR abs/1703.05997 (2017) - [i7]Ben Strasser:
Computing Tree Decompositions with FlowCutter: PACE 2017 Submission. CoRR abs/1709.08949 (2017) - [i6]Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz
Simple Distributed Graph Clustering using Modularity and Map Equation. CoRR abs/1710.09605 (2017) - 2016
- [j2]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 21(1): 1.5:1-1.5:49 (2016) - [c12]Michael Hamann
Graph Bisection with Pareto-Optimization. ALENEX 2016: 90-102 - [i5]Ben Strasser:
Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks. CoRR abs/1606.06636 (2016) - 2015
- [j1]Ben Strasser, Adi Botea, Daniel Harabor:
Compressing Optimal Paths with Run Length Encoding. J. Artif. Intell. Res. 54: 593-629 (2015) - [c11]Adi Botea, Ben Strasser, Daniel Harabor:
Complexity Results for Compressing Optimal Paths. AAAI 2015: 1100-1106 - [c10]Ulrik Brandes, Michael Hamann
Fast Quasi-Threshold Editing. ESA 2015: 251-262 - [c9]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Fast exact shortest path and distance queries on road networks with parametrized costs. SIGSPATIAL/GIS 2015: 66:1-66:4 - [c8]Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS 2015: 241-250 - [p1]Ben Strasser, Dorothea Wagner:
Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies. Gems of Combinatorial Optimization and Graph Algorithms 2015: 69-82 - [i4]Michael Hamann, Ben Strasser:
Graph Bisection with Pareto-Optimization. CoRR abs/1504.03812 (2015) - [i3]Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. CoRR abs/1504.07379 (2015) - [i2]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs. CoRR abs/1509.03165 (2015) - 2014
- [c7]Ben Strasser, Dorothea Wagner:
Connection Scan Accelerated. ALENEX 2014: 125-137 - [c6]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. ATMOS 2014: 1-14 - [c5]Ben Strasser, Daniel Harabor, Adi Botea:
Fast First-Move Queries through Run-Length Encoding. SOCS 2014: 157-165 - [c4]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. SEA 2014: 271-282 - [c3]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Erratum: Customizable Contraction Hierarchies. SEA 2014 - [i1]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. CoRR abs/1402.0402 (2014) - 2013
- [c2]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Intriguingly Simple and Fast Transit Routing. SEA 2013: 43-54 - 2011
- [c1]Bastian Katz, Ignaz Rutter
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA 2011: 292-303
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-04-25 05:41 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: