Computing Tree Decompositions with FlowCutter: PACE 2017 Submission

Incidence matrices and interval graphs

Delbert R. Fulkerson and O. A. Gross · 1965

Earlier work this paper cites.

Nested dissection of a regular finite element mesh

Alan George · 1973

Earlier work this paper cites.

Network Flows: Theory, Algorithms, and Applications

Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin · 1993

Earlier work this paper cites.

An introduction to chordal graphs and clique trees

Jean Blair and Barry Peyton · 1993

Earlier work this paper cites.

A tourist guide through treewidth

Hans L. Bodlaender · 1993

Earlier work this paper cites.

Dijkstra’s algorithm on-line: An empirical case study from public railroad transport

Frank Schulz, Dorothea Wagner, and Karsten Weihe · 2000

Earlier work this paper cites.

Treewidth: Structure and algorithms

Hans L. Bodlaender · 2007

Cited alongside, same era.

Engineering multilevel overlay graphs for shortest-path queries

Martin Holzer, Frank Schulz, and Dorothea Wagner · 2008

Cited alongside, same era.

Bing maps new routing engine

Bing Developers · 2012

Cited alongside, same era.

Exact routing in large road networks using contraction hierarchies

Robert Geisberger, Peter Sanders, Dominik Schultes, and Christian Vetter · 2012

Cited alongside, same era.

Recent advances in graph partitioning, 2013

Original

Aidın Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz · 2013

Cited alongside, same era.

On dynamic approximate shortest paths for planar graphs with worst-case costs

Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck · 2016

Route planning in transportation networks

Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller–Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck · 2016

Later among the works it cites.

Search-space size in contraction hierarchies

Reinhard Bauer, Tobias Columbus, Ignaz Rutter, and Dorothea Wagner · 2016

Later among the works it cites.

The first parameterized algorithms and computational experiments challenge

Holger Dell, Thore Husfeldt, Bart M. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances Rosamond · 2016

Later among the works it cites.

Customizable contraction hierarchies

Julian Dibbelt, Ben Strasser, and Dorothea Wagner · 2016

Later among the works it cites.

Graph bisection with pareto-optimization

Michael Hamann and Ben Strasser · 2016

Later among the works it cites.

Customizable route planning in road networks

Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato F. Werneck · 2017