| Publication | Date of Publication | Type |
|---|
| Time-dependent alternative route planning | 2024-08-13 | Paper |
| Improved oracles for time-dependent road networks | 2024-07-11 | Paper |
| REX: a realistic time-dependent model for multimodal public transport | 2024-07-10 | Paper |
Optimal parallel shortest paths in small treewidth digraphs
Lecture Notes in Computer Science | 2023-05-08 | Paper |
On the computation of fast data transmissions in networks with capacities and delays
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Efficient parallel algorithms for shortest paths in planar graphs
SWAT 90 | 2022-12-09 | Paper |
Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
An axiomatic approach to time-dependent shortest path oracles
Algorithmica | 2022-03-22 | Paper |
Dynamic interpolation search revisited
Information and Computation | 2020-01-17 | Paper |
| scientific article; zbMATH DE number 7121837 (Why is no real title available?) | 2019-10-24 | 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 |
Engineering oracles for time-dependent road networks
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Shortest path queries in digraphs of small treewidth
Automata, Languages and Programming | 2019-01-10 | Paper |
Hierarchical time-dependent oracles
(available as arXiv preprint) | 2018-04-19 | Paper |
Planar spanners and approximate shortest path queries among obstacles in the plane
Algorithms — ESA '96 | 2017-12-05 | Paper |
On-line and dynamic algorithms for shortest path problems
STACS 95 | 2017-12-04 | Paper |
Engineering graph-based models for dynamic timetable information systems
Journal of Discrete Algorithms | 2017-11-09 | Paper |
An experimental study of dynamic algorithms for transitive closure
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
An experimental study of algorithms for fully dynamic transitive closure
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
All-pairs min-cut in sparse networks
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Distance oracles for time-dependent networks
Algorithmica | 2016-05-31 | Paper |
An optimal parallel algorithm for minimum spanning trees in planar graphs
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
A glimpse at Paul G. Spirakis
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Simple parallel algorithms for dynamic range products
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
\(D^{3}\)-tree: a dynamic deterministic decentralized structure
Algorithms - ESA 2015 | 2015-11-19 | Paper |
\(D^2\)-tree: a new overlay with deterministic bounds
Algorithmica | 2015-09-02 | Paper |
Distance oracles for time-dependent networks
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Engineering planar separator algorithms
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Improved alternative route planning | 2014-02-24 | Paper |
An experimental study of bicriteria models for robust timetabling
Optimization | 2013-12-19 | Paper |
| Towards realistic modeling of time-table information through the time-dependent approach | 2013-09-09 | Paper |
| Dynamic shortest paths containers | 2013-09-09 | Paper |
A new dynamic graph structure for large-scale transportation networks
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Improved bounds for finger search on a RAM
Algorithmica | 2013-05-13 | Paper |
| Robust line planning under unknown incentives and elasticity of frequencies | 2012-09-28 | Paper |
| QoS-aware multicommodity flows and transportation planning | 2012-09-28 | Paper |
| On assessing robustness in transportation planning | 2012-09-28 | Paper |
Robust line planning in case of multiple pools and disruptions
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms | 2011-01-20 | Paper |
\(D^{2}\)-tree: a new overlay with deterministic bounds
Algorithms and Computation | 2010-12-09 | Paper |
On the efficient generation of prime-order elliptic curves
Journal of Cryptology | 2010-09-21 | Paper |
Improved bounds for finger search on a RAM
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Incentive-compatible robust line planning
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
Theory of Computing Systems | 2009-09-18 | Paper |
| A cutting plane approach to solve the railway traveling salesman problem | 2009-08-14 | Paper |
Dynamic Interpolation Search Revisited
Automata, Languages and Programming | 2009-03-12 | Paper |
Efficient models for timetable information in public transportation systems
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
Algorithms and Computation | 2008-04-24 | Paper |
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
Lecture Notes in Computer Science | 2008-03-17 | Paper |
Progress in Cryptology - INDOCRYPT 2003
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Stochastic Algorithms: Foundations and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Geometric containers for efficient shortest-path computation
ACM Journal of Experimental Algorithmics | 2006-01-16 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Attack propagation in networks
Theory of Computing Systems | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 1979294 (Why is no real title available?) | 2003-09-11 | Paper |
| scientific article; zbMATH DE number 1956218 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1956217 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1947427 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1926659 (Why is no real title available?) | 2003-06-11 | Paper |
| scientific article; zbMATH DE number 1848400 (Why is no real title available?) | 2003-01-05 | Paper |
Shortest paths in digraphs of small treewidth. I: Sequential algorithms
Algorithmica | 2001-05-17 | Paper |
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
Journal of Parallel and Distributed Computing | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1555943 (Why is no real title available?) | 2001-01-24 | Paper |
Improved algorithms for dynamic shortest paths
Algorithmica | 2000-11-14 | Paper |
| Transmissions in a network with capacities and delays | 1999-06-29 | Paper |
Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
Theoretical Computer Science | 1999-01-12 | Paper |
All-Pairs Min-Cut in Sparse Networks
Journal of Algorithms | 1998-11-11 | Paper |
A parallel priority queue with constant time operations
Journal of Parallel and Distributed Computing | 1998-11-05 | Paper |
Efficient computation of implicit representations of sparse graphs
Discrete Applied Mathematics | 1998-06-23 | Paper |
The fourth moment in Luby's distribution
Theoretical Computer Science | 1997-02-28 | Paper |
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 219240 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176745 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 139775 (Why is no real title available?) | 1993-03-28 | Paper |
Efficient parallel algorithms for shortest paths in planar digraphs
BIT | 1992-12-14 | Paper |
| scientific article; zbMATH DE number 18532 (Why is no real title available?) | 1992-06-26 | Paper |
