| 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 |
scientific article; zbMATH DE number 7525451 (Why is no real title available?)
| 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
Algorithmica | 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
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Engineering Top-Down Weight-Balanced Trees
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Fast, Exact and Scalable Dynamic Ridesharing
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 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
Algorithmica | 2020-04-01 | Paper |
Enumerating and generating labeled \(k\)-degenerate graphs
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
User-Constrained Multi-Modal Route Planning
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
I/O-efficient generation of massive graphs following the LFR benchmark
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Connection scan accelerated
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Experiments on density-constrained graph clustering
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
A Geometric Heuristic for Rectilinear Crossing Minimization
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Engineering oracles for time-dependent road networks
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Engineering multi-level overlay graphs for shortest-path queries
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Connection Scan Algorithm
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Optimal orthogonal graph drawing with convex bend costs
ACM Transactions on Algorithms | 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
Algorithms | 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
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Online dynamic power management with hard real-time guarantees
| 2017-03-03 | Paper |
Experiments on density-constrained graph clustering
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
User-constrained multimodal route planning
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Search-space size in contraction hierarchies
Theoretical Computer Science | 2016-08-31 | Paper |
Visualisierung von Verkehrsdaten
Mitteilungen der Deutschen Mathematiker-Vereinigung | 2016-01-21 | Paper |
Fast quasi-threshold editing
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Online dynamic power management with hard real-time guarantees
Theoretical Computer Science | 2015-07-24 | Paper |
ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Dynamic graph clustering combining modularity and smoothness
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Column-based graph layouts
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Graph clustering with surprise: complexity and exact solutions
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Orthogonal graph drawing with flexibility constraints
Algorithmica | 2014-12-02 | Paper |
Local broadcasting with arbitrary transmission power in the SINR model
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Engineering multilevel overlay graphs for shortest-path queries
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Engineering planar separator algorithms
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Generalizing geometric graphs
Journal of Graph Algorithms and Applications | 2014-01-22 | Paper |
Computing multimodal journeys in practice
| 2014-01-21 | Paper |
Intriguingly simple and fast transit routing
Experimental Algorithms | 2014-01-21 | Paper |
The density maximization problem in graphs
Journal of Combinatorial Optimization | 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
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Search-space size in contraction hierarchies
Automata, Languages, and Programming | 2013-08-06 | Paper |
Optimal Orthogonal Graph Drawing with Convex Bend Costs
Automata, Languages, and Programming | 2013-08-06 | Paper |
On the complexity of partitioning graphs for arc-flags
Journal of Graph Algorithms and Applications | 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
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Column-based graph layouts
Graph Drawing | 2013-04-03 | Paper |
Fast and simple fully-dynamic cut tree construction
Algorithms and Computation | 2013-03-21 | Paper |
Competitive design and analysis for machine-minimizing job scheduling problem
Algorithms and Computation | 2013-03-21 | Paper |
Dynamic graph clustering using minimum-cut trees
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
The shortcut problem - complexity and algorithms
Journal of Graph Algorithms and Applications | 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
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Generalizing geometric graphs
Graph Drawing | 2012-03-09 | Paper |
Algorithm engineering for route planning: an update
Algorithms and Computation | 2011-12-16 | Paper |
The density maximization problem in graphs
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Fully-dynamic hierarchical graph clustering using cut trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Density-constrained graph clustering
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science | 2011-07-27 | Paper |
An experimental study on generating planar graphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Orthogonal graph drawing with flexibility constraints
Graph Drawing | 2011-02-11 | Paper |
High-performance multi-level routing
| 2010-07-09 | Paper |
scientific article; zbMATH DE number 5734725 (Why is no real title available?)
| 2010-07-09 | Paper |
Engineering label-constrained shortest-path algorithms
| 2010-07-09 | Paper |
Preprocessing speed-up techniques is hard
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Algorithms and models for railway optimization.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Geometric speed-up techniques for finding shortest paths in large sparse graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Computational aspects of lucidity-driven graph clustering
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Completely connected clustered graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Computing large matchings in planar graphs with fixed minimum degree
Algorithms and Computation | 2009-12-17 | Paper |
Time-dependent route planning
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Engineering Time-Expanded Graphs for Faster Timetable Information
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Dynamic Graph Clustering Using Minimum-Cut Trees
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
Asia-Pacific Journal of Operational Research | 2009-06-23 | Paper |
The Shortcut Problem – Complexity and Approximation
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Augmenting \(k\)-core generation with preferential attachment
Networks and Heterogeneous Media | 2008-07-29 | Paper |
Engineering Comparators for Graph Clusterings
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Engineering Label-Constrained Shortest-Path Algorithms
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
On Finding Graph Clusterings with Maximum Modularity
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Partitioning graphs to speedup Dijkstra's algorithm
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Engineering graph clustering: models and experimental evaluation
| 2008-06-20 | Paper |
Efficient models for timetable information in public transportation systems
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Combining speed-up techniques for shortest-path computations
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Minimizing the Area for Planar Straight-Line Grid Drawings
Graph Drawing | 2008-03-25 | Paper |
LunarVis – Analytic Visualizations of Large Graphs
Graph Drawing | 2008-03-25 | Paper |
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Significance-Driven Graph Clustering
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Completely connected clustered graphs
Journal of Discrete Algorithms | 2007-11-05 | Paper |
Speed-Up Techniques for Shortest-Path Computations
STACS 2007 | 2007-09-03 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Approximating Clustering Coefficient and Transitivity
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Drawing Graphs on Two and Three Lines
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Geometric containers for efficient shortest-path computation
ACM Journal of Experimental Algorithmics | 2006-01-16 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Generating node coordinates for shortest-path computations in transportation networks
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Dijkstra's algorithm on-line
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
How to draw the minimum cuts of a planar graph
Computational Geometry | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2084308 (Why is no real title available?)
| 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080092 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080090 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2044925 (Why is no real title available?)
| 2004-02-18 | Paper |
Additive Tree Spanners
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1982193 (Why is no real title available?)
| 2003-09-16 | Paper |
scientific article; zbMATH DE number 1974105 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1974102 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1926659 (Why is no real title available?)
| 2003-06-11 | Paper |
scientific article; zbMATH DE number 1893565 (Why is no real title available?)
| 2003-04-07 | Paper |
On the complexity of partial order properties
Order | 2001-06-28 | Paper |
Dynamic WWW Structures in 3D
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Using Graph Layout to Visualize Train Interconnection Data
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Wiring edge-disjoint layouts
Computational Geometry | 2000-10-03 | Paper |
A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
Algorithmica | 2000-08-27 | Paper |
scientific article; zbMATH DE number 1420919 (Why is no real title available?)
| 2000-07-20 | Paper |
A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
Discrete Applied Mathematics | 1999-11-23 | Paper |
scientific article; zbMATH DE number 1354125 (Why is no real title available?)
| 1999-10-31 | Paper |
scientific article; zbMATH DE number 1175964 (Why is no real title available?)
| 1998-07-19 | Paper |
The Vertex-Disjoint Menger Problem in Planar Graphs
SIAM Journal on Computing | 1997-05-26 | Paper |
LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
A linear-time algorithm for edge-disjoint paths in planar graphs
Combinatorica | 1996-07-14 | Paper |
scientific article; zbMATH DE number 780786 (Why is no real title available?)
| 1996-03-11 | Paper |
OPTIMAL ROUTING THROUGH DENSE CHANNELS
International Journal of Computational Geometry & Applications | 1994-05-18 | Paper |
scientific article; zbMATH DE number 508831 (Why is no real title available?)
| 1994-03-14 | Paper |
scientific article; zbMATH DE number 512933 (Why is no real title available?)
| 1994-03-10 | Paper |
scientific article; zbMATH DE number 437535 (Why is no real title available?)
| 1994-01-02 | Paper |
\(\alpha\)-vertex separator is NP-hard even for 3-regular graphs
Computing | 1992-06-26 | Paper |
Decomposition of partial orders
Order | 1990-01-01 | Paper |
Decomposition of k-ary relations
Discrete Mathematics | 1990-01-01 | Paper |
