| Publication | Date of Publication | Type |
|---|
| Optimal parallel shortest paths in small treewidth digraphs | 2023-05-08 | Paper |
| On the computation of fast data transmissions in networks with capacities and delays | 2022-12-16 | Paper |
| Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs | 2022-12-09 | Paper |
| Efficient parallel algorithms for shortest paths in planar graphs | 2022-12-09 | Paper |
| Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems | 2022-08-18 | Paper |
| An axiomatic approach to time-dependent shortest path oracles | 2022-03-22 | Paper |
| Dynamic interpolation search revisited | 2020-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240129 | 2019-10-24 | Paper |
| Analysis and Experimental Evaluation of Time-Dependent Distance Oracles | 2019-09-12 | Paper |
| Engineering Oracles for Time-Dependent Road Networks | 2019-09-12 | Paper |
| Shortest path queries in digraphs of small treewidth | 2019-01-10 | Paper |
| Hierarchical Time-Dependent Oracles | 2018-04-19 | Paper |
| Planar spanners and approximate shortest path queries among obstacles in the plane | 2017-12-05 | Paper |
| On-line and dynamic algorithms for shortest path problems | 2017-12-04 | Paper |
| Engineering graph-based models for dynamic timetable information systems | 2017-11-09 | Paper |
| An experimental study of algorithms for fully dynamic transitive closure | 2017-06-15 | Paper |
| An Experimental Study of Dynamic Algorithms for Transitive Closure | 2017-06-15 | Paper |
| All-pairs min-cut in sparse networks | 2017-01-19 | Paper |
| Distance oracles for time-dependent networks | 2016-05-31 | Paper |
| A Glimpse at Paul G. Spirakis | 2016-01-27 | Paper |
| An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs | 2016-01-27 | Paper |
| Simple Parallel Algorithms for Dynamic Range Products | 2016-01-27 | Paper |
| D 3-Tree: A Dynamic Deterministic Decentralized Structure | 2015-11-19 | Paper |
| \(D^2\)-tree: a new overlay with deterministic bounds | 2015-09-02 | Paper |
| Distance oracles for time-dependent networks | 2014-07-01 | Paper |
| Engineering planar separator algorithms | 2014-04-01 | Paper |
| Improved Alternative Route Planning | 2014-02-24 | Paper |
| An experimental study of bicriteria models for robust timetabling | 2013-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2847387 | 2013-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2847388 | 2013-09-09 | Paper |
| A New Dynamic Graph Structure for Large-Scale Transportation Networks | 2013-06-07 | Paper |
| Improved bounds for finger search on a RAM | 2013-05-13 | Paper |
| On Assessing Robustness in Transportation Planning | 2012-09-28 | 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 |
| Robust Line Planning in Case of Multiple Pools and Disruptions | 2011-05-12 | Paper |
| ISB-tree: A new indexing scheme with efficient expected behaviour | 2011-01-20 | Paper |
| D2-Tree: A New Overlay with Deterministic Bounds | 2010-12-09 | Paper |
| On the efficient generation of prime-order elliptic curves | 2010-09-21 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Incentive-Compatible Robust Line Planning | 2009-12-03 | Paper |
| Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications | 2009-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3392397 | 2009-08-14 | Paper |
| Dynamic Interpolation Search Revisited | 2009-03-12 | Paper |
| Efficient models for timetable information in public transportation systems | 2008-06-20 | Paper |
| Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications | 2008-04-24 | Paper |
| Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations | 2008-03-17 | Paper |
| Progress in Cryptology - INDOCRYPT 2003 | 2007-11-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Geometric containers for efficient shortest-path computation | 2006-01-16 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Attack propagation in networks | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425717 | 2003-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417680 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417681 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411396 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707785 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785581 | 2003-01-05 | Paper |
| Shortest paths in digraphs of small treewidth. I: Sequential algorithms | 2001-05-17 | Paper |
| A simple parallel algorithm for the single-source shortest path problem on planar digraphs | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525710 | 2001-01-24 | Paper |
| Improved algorithms for dynamic shortest paths | 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 | 1999-01-12 | Paper |
| All-Pairs Min-Cut in Sparse Networks | 1998-11-11 | Paper |
| A parallel priority queue with constant time operations | 1998-11-05 | Paper |
| Efficient computation of implicit representations of sparse graphs | 1998-06-23 | Paper |
| The fourth moment in Luby's distribution | 1997-02-28 | Paper |
| Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694726 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036575 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028098 | 1993-03-28 | Paper |
| Efficient parallel algorithms for shortest paths in planar digraphs | 1992-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975935 | 1992-06-26 | Paper |
