| Publication | Date of Publication | Type |
|---|
| Finding near-optimal independent sets at scale | 2019-09-12 | Paper |
| Exact Combinatorial Branch-and-Bound for Graph Bisection | 2019-09-12 | Paper |
| Round-Based Public Transit Routing | 2019-09-12 | Paper |
| Robust Mobile Route Planning with Limited Connectivity | 2019-09-12 | Paper |
| Fast Local Search for Steiner Trees in Graphs | 2019-09-11 | Paper |
| An Experimental Study of Minimum Mean Cycle Algorithms | 2019-09-11 | Paper |
| Shortest Path Feasibility Algorithms: An Experimental Evaluation | 2019-09-11 | Paper |
| Reach for A*: Efficient Point-to-Point Shortest Path Algorithms | 2019-09-11 | Paper |
| Highway Dimension and Provably Efficient Shortest Path Algorithms | 2018-08-02 | Paper |
| On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs | 2018-07-16 | Paper |
| A robust and scalable algorithm for the Steiner problem in graphs | 2018-06-25 | Paper |
| Finding near-optimal independent sets at scale | 2017-09-08 | Paper |
| Fast local search for the maximum independent set problem | 2017-04-04 | Paper |
| Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search | 2015-11-19 | Paper |
| An exact combinatorial algorithm for minimum graph bisection | 2015-10-19 | Paper |
| Alternative routes in road networks | 2015-03-16 | Paper |
| Self-adjusting top trees | 2014-10-13 | Paper |
| Robust Distance Queries on Massive Networks | 2014-10-08 | Paper |
| Data structures for mergeable trees | 2014-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417667 | 2014-05-22 | Paper |
| Shortest-path feasibility algorithms | 2014-04-01 | Paper |
| Dynamic trees in practice | 2014-04-01 | Paper |
| Fast local search for the steiner problem in graphs | 2014-04-01 | Paper |
| Computing multimodal journeys in practice | 2014-01-21 | Paper |
| Hierarchical hub labelings for shortest paths | 2012-09-25 | Paper |
| Better Bounds for Graph Bisection | 2012-09-25 | Paper |
| A hybrid GRASP with perturbations for the Steiner problem in graphs | 2012-05-30 | Paper |
| Maximum flows by incremental breadth-first search | 2011-09-16 | Paper |
| VC-dimension and shortest path algorithms | 2011-07-06 | Paper |
| Design of data structures for mergeable trees | 2010-08-16 | Paper |
| Reach for \(A^*\): shortest path algorithms with preprocessing | 2010-07-09 | Paper |
| Virtual Ring Routing Trends | 2009-11-19 | Paper |
| Finding Dominators in Practice | 2009-01-19 | Paper |
| A fast swap-based local search procedure for location problems | 2008-03-31 | Paper |
| A hybrid multistart heuristic for the uncapacitated facility location problem | 2007-01-09 | Paper |
| Robust branch-and-cut-and-price for the capacitated vehicle routing problem | 2006-06-14 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Finding minimum congestion spanning trees | 2005-08-04 | Paper |
| A hybrid heuristic for the \(p\)-median problem | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707782 | 2003-06-11 | Paper |
| Dual heuristics on the exact solution of large Steiner problems | 2001-10-24 | Paper |
