Ben Strasser

ACM J. Exp. Algorithmics, December, 2022

2021

Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks.

[BibT_eX]

[DOI]

Algorithms, 2021

A Fast and Tight Heuristic for A* in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020

Integrating public transport into mobiTopp.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2020

Engineering Exact Quasi-Threshold Editing.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

PACE Solver Description: Tree Depth with FlowCutter.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

A* with Perfect Potentials.

[BibT_eX]

[DOI]

CoRR, 2019

Correspondence between Multilevel Graph Partitions and Tree Decompositions.

[BibT_eX]

[DOI]

Michael Hamann

Algorithms, 2019

2018

Graph Bisection with Pareto Optimization.

[BibT_eX]

[DOI]

Michael Hamann

ACM J. Exp. Algorithmics, 2018

Connection Scan Algorithm.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

Distributed Graph Clustering Using Modularity and Map Equation.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2018: Parallel Processing, 2018

2017

Algorithm Engineering for Adaptive Route Planning

[BibT_eX]

[DOI]

PhD thesis, 2017

Simple Distributed Graph Clustering using Modularity and Map Equation.

[BibT_eX]

[DOI]

CoRR, 2017

Computing Tree Decompositions with FlowCutter: PACE 2017 Submission.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Traffic Assignment for Public Transit Networks.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Dynamic Time-Dependent Routing in Road Networks Through Sampling.

[BibT_eX]

[DOI]

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Customizable Contraction Hierarchies.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2016

Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Compressing Optimal Paths with Run Length Encoding.

[BibT_eX]

[DOI]

Adi Botea

Daniel Harabor

J. Artif. Intell. Res., 2015

The Grid-Based Path Planning Competition: 2014 Entries and Results.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Fast exact shortest path and distance queries on road networks with parametrized costs.

[BibT_eX]

[DOI]

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Fast Quasi-Threshold Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

Complexity Results for Compressing Optimal Paths.

[BibT_eX]

[DOI]

Adi Botea

Daniel Harabor

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

Erratum: Customizable Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Fast First-Move Queries through Run-Length Encoding.

[BibT_eX]

[DOI]

Daniel Harabor

Adi Botea

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time.

[BibT_eX]

[DOI]

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

Connection Scan Accelerated.

[BibT_eX]

[DOI]