| Publication | Date of Publication | Type |
|---|
| An efficient solution for one-to-many multi-modal journey planning | 2024-08-13 | Paper |
| Integrating ULTRA and trip-based routing | 2024-08-13 | Paper |
| Customizable contraction hierarchies with turn costs | 2024-08-13 | Paper |
| Improved oracles for time-dependent road networks | 2024-07-11 | Paper |
| Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications | 2023-06-23 | Paper |
| Space-efficient, fast and exact routing in time-dependent road networks | 2023-02-07 | Paper |
| Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075748 | 2022-05-11 | Paper |
| Engineering Negative Cycle Canceling for Wind Farm Cabling | 2022-05-11 | Paper |
| The complexity of flow expansion and electrical flow expansion | 2022-03-24 | Paper |
| An axiomatic approach to time-dependent shortest path oracles | 2022-03-22 | Paper |
| A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) | 2021-12-20 | Paper |
| Real-time traffic assignment using engineered customizable contraction hierarchies | 2021-04-21 | Paper |
| Engineering Top-Down Weight-Balanced Trees | 2021-01-27 | Paper |
| Fast, Exact and Scalable Dynamic Ridesharing | 2021-01-27 | Paper |
| Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles | 2020-05-27 | Paper |
| Energy-optimal routes for battery electric vehicles | 2020-04-01 | Paper |
| Enumerating and generating labeled \(k\)-degenerate graphs | 2019-09-16 | Paper |
| User-Constrained Multi-Modal Route Planning | 2019-09-12 | Paper |
| I/O-efficient generation of massive graphs following the LFR benchmark | 2019-09-12 | Paper |
| Connection scan accelerated | 2019-09-12 | Paper |
| Experiments on density-constrained graph clustering | 2019-09-12 | Paper |
| Analysis and Experimental Evaluation of Time-Dependent Distance Oracles | 2019-09-12 | Paper |
| A Geometric Heuristic for Rectilinear Crossing Minimization | 2019-09-12 | Paper |
| Engineering oracles for time-dependent road networks | 2019-09-12 | Paper |
| Engineering multi-level overlay graphs for shortest-path queries | 2019-09-11 | Paper |
| Connection Scan Algorithm | 2019-03-27 | Paper |
| Optimal orthogonal graph drawing with convex bend costs | 2018-11-05 | Paper |
| On local broadcasting schedules and CONGEST algorithms in the SINR model | 2018-10-17 | Paper |
| Consumption profiles in route planning for electric vehicles: theory and applications | 2018-08-13 | Paper |
| Efficient traffic assignment for public transit networks | 2018-08-13 | Paper |
| Local community detection based on small cliques | 2018-08-13 | Paper |
| Hierarchical time-dependent oracles | 2018-04-19 | Paper |
| Time-dependent route planning for truck drivers | 2018-01-25 | Paper |
| Customizable contraction hierarchies | 2017-06-16 | Paper |
| Online dynamic power management with hard real-time guarantees | 2017-03-03 | Paper |
| Experiments on density-constrained graph clustering | 2016-10-24 | Paper |
| User-constrained multimodal route planning | 2016-10-24 | Paper |
| Search-space size in contraction hierarchies | 2016-08-31 | Paper |
| Visualisierung von Verkehrsdaten | 2016-01-21 | Paper |
| Fast quasi-threshold editing | 2015-11-19 | Paper |
| Online dynamic power management with hard real-time guarantees | 2015-07-24 | Paper |
| ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS | 2015-04-29 | Paper |
| Dynamic graph clustering combining modularity and smoothness | 2015-03-16 | Paper |
| Column-based graph layouts | 2015-01-15 | Paper |
| Graph clustering with surprise: complexity and exact solutions | 2015-01-13 | Paper |
| Orthogonal graph drawing with flexibility constraints | 2014-12-02 | Paper |
| Local broadcasting with arbitrary transmission power in the SINR model | 2014-08-07 | Paper |
| Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm | 2014-04-01 | Paper |
| Engineering multilevel overlay graphs for shortest-path queries | 2014-04-01 | Paper |
| Engineering planar separator algorithms | 2014-04-01 | Paper |
| Generalizing geometric graphs | 2014-01-22 | Paper |
| Computing multimodal journeys in practice | 2014-01-21 | Paper |
| Intriguingly simple and fast transit routing | 2014-01-21 | Paper |
| The density maximization problem in graphs | 2013-12-09 | Paper |
| Dynamic shortest paths containers | 2013-09-09 | Paper |
| The station location problem on two intersecting lines | 2013-09-09 | Paper |
| Towards realistic modeling of time-table information through the time-dependent approach | 2013-09-09 | Paper |
| Hierarchies of predominantly connected communities | 2013-08-12 | Paper |
| Search-space size in contraction hierarchies | 2013-08-06 | Paper |
| Optimal Orthogonal Graph Drawing with Convex Bend Costs | 2013-08-06 | Paper |
| On the complexity of partitioning graphs for arc-flags | 2013-07-09 | Paper |
| Complete hierarchical cut-clustering: a case study on expansion and modularity | 2013-06-25 | Paper |
| An efficient generator for clustered dynamic random networks | 2013-04-19 | Paper |
| Column-based graph layouts | 2013-04-03 | Paper |
| Fast and simple fully-dynamic cut tree construction | 2013-03-21 | Paper |
| Competitive design and analysis for machine-minimizing job scheduling problem | 2013-03-21 | Paper |
| Dynamic graph clustering using minimum-cut trees | 2012-12-04 | Paper |
| The shortcut problem - complexity and algorithms | 2012-12-04 | Paper |
| On the complexity of partitioning graphs for arc-flags | 2012-10-02 | Paper |
| Engineering time-expanded graphs for faster timetable information | 2012-09-28 | Paper |
| Station location -- complexity and approximation | 2012-09-28 | Paper |
| Higher order city Voronoi diagrams | 2012-08-14 | Paper |
| Generalizing geometric graphs | 2012-03-09 | Paper |
| Algorithm engineering for route planning: an update | 2011-12-16 | Paper |
| The density maximization problem in graphs | 2011-08-17 | Paper |
| Fully-dynamic hierarchical graph clustering using cut trees | 2011-08-12 | Paper |
| Density-constrained graph clustering | 2011-08-12 | Paper |
| Computing large matchings in planar graphs with fixed minimum degree | 2011-07-27 | Paper |
| An experimental study on generating planar graphs | 2011-06-03 | Paper |
| Orthogonal graph drawing with flexibility constraints | 2011-02-11 | Paper |
| High-performance multi-level routing | 2010-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574265 | 2010-07-09 | Paper |
| Engineering label-constrained shortest-path algorithms | 2010-07-09 | Paper |
| Preprocessing speed-up techniques is hard | 2010-05-28 | Paper |
| Algorithms and models for railway optimization. | 2010-04-20 | Paper |
| Geometric speed-up techniques for finding shortest paths in large sparse graphs | 2010-03-03 | Paper |
| Computational aspects of lucidity-driven graph clustering | 2010-02-04 | Paper |
| Completely connected clustered graphs. | 2010-01-12 | Paper |
| Computing large matchings in planar graphs with fixed minimum degree | 2009-12-17 | Paper |
| Time-dependent route planning | 2009-12-03 | Paper |
| Engineering Time-Expanded Graphs for Faster Timetable Information | 2009-12-03 | Paper |
| Dynamic Graph Clustering Using Minimum-Cut Trees | 2009-10-20 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Group-Level Analysis and Visualization of Social Networks | 2009-07-09 | Paper |
| Engineering Route Planning Algorithms | 2009-07-09 | Paper |
| THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS | 2009-06-23 | Paper |
| The Shortcut Problem – Complexity and Approximation | 2009-02-03 | Paper |
| Augmenting \(k\)-core generation with preferential attachment | 2008-07-29 | Paper |
| Engineering Comparators for Graph Clusterings | 2008-07-10 | Paper |
| Engineering Label-Constrained Shortest-Path Algorithms | 2008-07-10 | Paper |
| On Finding Graph Clusterings with Maximum Modularity | 2008-07-01 | Paper |
| Partitioning graphs to speedup Dijkstra's algorithm | 2008-06-20 | Paper |
| Engineering graph clustering: models and experimental evaluation | 2008-06-20 | Paper |
| Efficient models for timetable information in public transportation systems | 2008-06-20 | Paper |
| Combining speed-up techniques for shortest-path computations | 2008-06-20 | Paper |
| Minimizing the Area for Planar Straight-Line Grid Drawings | 2008-03-25 | Paper |
| LunarVis – Analytic Visualizations of Large Graphs | 2008-03-25 | Paper |
| Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks | 2008-03-07 | Paper |
| Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks | 2008-03-07 | Paper |
| Significance-Driven Graph Clustering | 2008-01-04 | Paper |
| Completely connected clustered graphs | 2007-11-05 | Paper |
| Speed-Up Techniques for Shortest-Path Computations | 2007-09-03 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Approximating Clustering Coefficient and Transitivity | 2006-04-03 | Paper |
| Drawing Graphs on Two and Three Lines | 2006-04-03 | Paper |
| Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles | 2006-04-03 | Paper |
| Geometric containers for efficient shortest-path computation | 2006-01-16 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Generating node coordinates for shortest-path computations in transportation networks | 2005-08-04 | Paper |
| Dijkstra's algorithm on-line | 2005-08-04 | Paper |
| How to draw the minimum cuts of a planar graph | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043770 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472300 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472296 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448750 | 2004-02-18 | Paper |
| Additive Tree Spanners | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426362 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422260 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422257 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707785 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801186 | 2003-04-07 | Paper |
| On the complexity of partial order properties | 2001-06-28 | Paper |
| Dynamic WWW Structures in 3D | 2000-12-14 | Paper |
| Using Graph Layout to Visualize Train Interconnection Data | 2000-12-14 | Paper |
| Wiring edge-disjoint layouts | 2000-10-03 | Paper |
| A linear time algorithm for the arc disjoint Menger problem in planar directed graphs | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944991 | 2000-07-20 | Paper |
| A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268438 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398381 | 1998-07-19 | Paper |
| The Vertex-Disjoint Menger Problem in Planar Graphs | 1997-05-26 | Paper |
| LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS | 1996-11-26 | Paper |
| A linear-time algorithm for edge-disjoint paths in planar graphs | 1996-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840776 | 1996-03-11 | Paper |
| OPTIMAL ROUTING THROUGH DENSE CHANNELS | 1994-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4280135 | 1994-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281648 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140410 | 1994-01-02 | Paper |
| \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs | 1992-06-26 | Paper |
| Decomposition of partial orders | 1990-01-01 | Paper |
| Decomposition of k-ary relations | 1990-01-01 | Paper |
