19 citations · 35 across the 6 of their papers we have counts for
11 papers
Engineering Exact Quasi-Threshold Editing
Lars Gottesbüren, Michael Hamann, Philipp Schoch +3
Quasi-threshold graphs are -free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the -free editing pr…
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
Ben Strasser, Dorothea Wagner, Tim Zeitz
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, fo…
A Fast and Tight Heuristic for A* in Road Networks
Ben Strasser, Tim Zeitz
We study exact, efficient and practical algorithms for route planning in large road networks. Routing applications often require integrating the current traffic situation, planning…
Distributed Graph Clustering using Modularity and Map Equation
Michael Hamann, Ben Strasser, Dorothea Wagner +1
We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters. A cluster should contain…
Computing Tree Decompositions with FlowCutter: PACE 2017 Submission
Ben Strasser
We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight s…
Connection Scan Algorithm
Julian Dibbelt, Thomas Pajor, Ben Strasser +1
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position a…