2023

• Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks  [PDF Copy]ACM J. Exp. Algorithmics
  • Ben Strasser
  • Tim Zeitz

2021

• A Fast and Tight Heuristic for A* in Road Networks [PDF Copy]Symposium on Experimental Algorithms (SEA)
  • Ben Strasser
  • Tim Zeitz
• Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks [PDF Copy]MDPI Journal of Algorithms
  • Ben Strasser
  • Dorothea Wagner
  • Tim Zeitz

2020

• Engineering Exact Quasi-Threshold Editing [PDF Copy]Symposium on Experimental Algorithms (SEA)
  • Lars Gottesbüren
  • Michael Hamann
  • Philipp Schoch
  • Ben Strasser
  • Dorothea Wagner
  • Sven Zühlsdorf
• Engineering Exact Quasi-Threshold Editing [PDF Copy]ArXiv - Preprint
  • Lars Gottesbüren
  • Michael Hamann
  • Philipp Schoch
  • Ben Strasser
  • Dorothea Wagner
  • Sven Zühlsdorf
• Integrating public transport into mobiTopp [PDF Copy]Future Generation Computer Systems
  • Lars Briem
  • H. Sebastian Buck
  • Nicolai Mallig
  • Peter Vortisch
  • Ben Strasser
  • Dorothea Wagner
  • Tobias Zündorf
• PACE Solver Description: Tree Depth with FlowCutter [PDF Copy]International Symposium on Parameterized and Exact Computation
  • Ben Strasser
• Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks [PDF Copy]European Symposium on Algorithms (ESA)
  • Ben Strasser
  • Dorothea Wagner
  • Tim Zeitz

2019

• A* with Perfect Potentials [PDF Copy]ArXiv - Preprint
  • Ben Strasser
  • Tim Zeitz
• Correspondence between Multilevel Graph Partitions and Tree Decompositions [PDF Copy]MDPI Journal of Algorithms
  • Michael Hamann
  • Ben Strasser
• Space-efficient, Fast and Exact Routing in Time-dependent Road Networks [PDF Copy]ArXiv - Preprint
  • Ben Strasser
  • Dorothea Wagner
  • Tim Zeitz

2018

• Connection Scan Algorithm [PDF Copy]ACM J. Exp. Algorithmics
  • Julian Dibbelt
  • Thomas Pajor
  • Ben Strasser
  • Dorothea Wagner
• Distributed Graph Clustering Using Modularity and Map Equation [PDF Copy]International European Conference on Parallel and Distributed Computing (Euro-Par)
  • Michael Hamann
  • Ben Strasser
  • Dorothea Wagner
  • Tim Zeitz
• Graph Bisection with Pareto Optimization [PDF Copy]ACM J. Exp. Algorithmics
  • Michael Hamann
  • Ben Strasser

2017

• Computing Tree Decompositions with FlowCutter: PACE 2017 Submission [PDF Copy]ArXiv - Preprint
  • Ben Strasser
• Connection Scan Algorithm [PDF Copy]ArXiv - Preprint
  • Julian Dibbelt
  • Thomas Pajor
  • Ben Strasser
  • Dorothea Wagner
• Dynamic Time-Dependent Routing in Road Networks Through Sampling [PDF Copy]Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS)
  • Ben Strasser
• Efficient Traffic Assignment for Public Transit Networks [PDF Copy]Symposium on Experimental Algorithms (SEA)
  • Lars Briem
  • H. Sebastian Buck
  • Holger Ebhart
  • Nicolai Mallig
  • Ben Strasser
  • Peter Vortisch
  • Dorothea Wagner
  • Tobias Zündorf
• Integrating public transport into mobiTopp [PDF Copy]International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTrans)
  • Lars Briem
  • H. Sebastian Buck
  • Nicolai Mallig
  • Peter Vortisch
  • Ben Strasser
  • Dorothea Wagner
  • Tobias Zündorf
• Simple Distributed Graph Clustering using Modularity and Map Equation [PDF Copy]ArXiv - Preprint
  • Michael Hamann
  • Ben Strasser
  • Dorothea Wagner
  • Tim Zeitz

2016

• Customizable Contraction Hierarchies [PDF Copy]ACM J. Exp. Algorithmics
  • Julian Dibbelt
  • Ben Strasser
  • Dorothea Wagner
• Graph Bisection with Pareto-Optimization [PDF Copy]Symposium on Algorithm Engineering and Experiments (ALENEX)
  • Michael Hamann
  • Ben Strasser
• Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks [PDF Copy]ArXiv - Preprint
  • Ben Strasser

2015

• Complexity Results for Compressing Optimal Paths [PDF Copy]Conference on Artificial Intelligence (AAAI)
  • Adi Botea
  • Ben Strasser
  • Daniel Harabor
• Compressing Optimal Paths with Run Length Encoding [PDF Copy]Journal of Artificial Intelligence Research (JAIR)
  • Ben Strasser
  • Adi Botea
  • Daniel Harabor
• Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs [PDF Copy]ArXiv - Preprint
  • Julian Dibbelt
  • Ben Strasser
  • Dorothea Wagner
• Fast Quasi-Threshold Editing [PDF Copy]European Symposium on Algorithms (ESA)
  • Ulrik Brandes
  • Michael Hamann
  • Ben Strasser
  • Dorothea Wagner
• Fast Quasi-Threshold Editing [PDF Copy]ArXiv - Preprint
  • Ulrik Brandes
  • Michael Hamann
  • Ben Strasser
  • Dorothea Wagner
• Fast exact shortest path and distance queries on road networks with parametrized costs [PDF Copy]International Conference on Advances in Geographic Information Systems (SIGSPATIAL)
  • Julian Dibbelt
  • Ben Strasser
  • Dorothea Wagner
• Graph Bisection with Pareto-Optimization [PDF Copy]ArXiv - Preprint
  • Michael Hamann
  • Ben Strasser
• Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies [PDF Copy]Book Chapter: Gems of Combinatorial Optimization and Graph Algorithms
  • Ben Strasser
  • Dorothea Wagner
• The Grid-Based Path Planning Competition: 2014 Entries and Results [PDF Copy]International Symposium on Combinatorial Search (SoCS)
  • Nathan R. Sturtevant
  • Jason M. Traish
  • James R. Tulip
  • Tansel Uras
  • Sven Koenig
  • Ben Strasser
  • Adi Botea
  • Daniel Harabor
  • Steve Rabin

2014

• Connection Scan Accelerated [PDF Copy]Symposium on Algorithm Engineering and Experiments (ALENEX)
  • Ben Strasser
  • Dorothea Wagner
• Customizable Contraction Hierarchies [PDF Copy]Symposium on Experimental Algorithms (SEA)
  • Julian Dibbelt
  • Ben Strasser
  • Dorothea Wagner
• Customizable Contraction Hierarchies [PDF Copy]ArXiv - Preprint
  • Julian Dibbelt
  • Ben Strasser
  • Dorothea Wagner
• Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time [PDF Copy]Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS)
  • Julian Dibbelt
  • Ben Strasser
  • Dorothea Wagner
• Fast First-Move Queries through Run-Length Encoding [PDF Copy]International Symposium on Combinatorial Search (SoCS)
  • Ben Strasser
  • Daniel Harabor
  • Adi Botea

2013

• Intriguingly Simple and Fast Transit Routing [PDF Copy]Symposium on Experimental Algorithms (SEA)
  • Julian Dibbelt
  • Thomas Pajor
  • Ben Strasser
  • Dorothea Wagner

2011

• Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling [PDF Copy]Symposium on Experimental Algorithms (SEA)
  • Bastian Katz
  • Ignaz Rutter
  • Ben Strasser
  • Dorothea Wagner