| Publication | Date of Publication | Type |
|---|
| Algorithmic trade-offs for girth approximation in undirected graphs | 2024-07-19 | Paper |
| Insertion-only dynamic connectivity in general disk graphs | 2024-05-29 | Paper |
| Improved girth approximation in weighted undirected graphs | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-05-14 | Paper |
| New algorithms for all pairs approximate shortest paths | 2024-05-08 | Paper |
| Dynamic connectivity in disk graphs | 2024-01-09 | Paper |
| A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. | 2023-09-20 | Paper |
| Approximate Single-Source Fault Tolerant Shortest Path | 2023-04-26 | Paper |
| Approximate distance oracles with improved stretch for sparse graphs | 2023-03-30 | Paper |
| Approximate distance oracles with improved stretch for sparse graphs | 2023-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091042 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091161 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075809 | 2022-05-11 | Paper |
| Toward Tight Approximation Bounds for Graph Diameter and Eccentricities | 2021-08-06 | Paper |
| Stabbing pairwise intersecting disks by five points | 2021-06-14 | Paper |
| An almost 2-approximation for all-pairs of shortest paths in subquadratic time | 2021-02-02 | Paper |
| Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications | 2020-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111403 | 2020-05-27 | Paper |
| Reachability oracles for directed transmission graphs | 2020-04-01 | Paper |
| Towards tight approximation bounds for graph diameter and eccentricities | 2019-08-22 | Paper |
| Better Approximation Algorithms for the Graph Diameter | 2019-06-20 | Paper |
| Decremental maintenance of strongly connected components | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743440 | 2019-05-10 | Paper |
| An efficient strongly connected components algorithm in the fault tolerant model | 2019-03-11 | Paper |
| A faster and simpler fully dynamic transitive closure | 2018-11-05 | Paper |
| Fault tolerant reachability for directed graphs | 2018-08-24 | Paper |
| Spanners for Directed Transmission Graphs | 2018-08-21 | Paper |
| Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications | 2018-07-16 | Paper |
| Routing in unit disk graphs | 2018-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607979 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608014 | 2018-03-15 | Paper |
| Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal | 2018-01-31 | Paper |
| Spanners and Reachability Oracles for Directed Transmission Graphs | 2017-10-10 | Paper |
| Fault tolerant subgraph for single source reachability: generic and optimal | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365085 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365123 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365130 | 2017-09-29 | Paper |
| An Experimental Study on Approximating k Shortest Simple Paths | 2016-10-24 | Paper |
| A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time | 2016-06-01 | Paper |
| Configurations and minority in the string consensus problem | 2016-05-31 | Paper |
| Routing in unit disk graphs | 2016-05-03 | Paper |
| New Routing Techniques and their Applications | 2016-03-23 | Paper |
| Close to linear space routing schemes | 2016-03-01 | Paper |
| Preprocess, set, query! | 2015-03-23 | Paper |
| Close to Linear Space Routing Schemes | 2015-02-10 | Paper |
| Fault-tolerant spanners for general graphs | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934664 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934682 | 2014-12-18 | Paper |
| Approximating the Girth | 2014-12-05 | Paper |
| A near-linear-time algorithm for computing replacement paths in planar directed graphs | 2014-11-18 | Paper |
| All-pairs shortest paths with a sublinear additive error | 2014-09-09 | Paper |
| Replacement paths and k simple shortest paths in unweighted directed graphs | 2014-09-09 | Paper |
| On the hardness of the consensus string problem | 2014-08-13 | Paper |
| Fast approximation algorithms for the diameter and radius of sparse graphs | 2014-08-07 | Paper |
| Minimum Weight Cycles and Triangles: Equivalences and Algorithms | 2014-07-30 | Paper |
| SINR diagrams | 2014-07-23 | Paper |
| On the Efficiency of the Hamming C-Centerstring Problems | 2014-06-30 | Paper |
| Distance Oracles beyond the Thorup--Zwick Bound | 2014-06-04 | Paper |
| Multiply Balanced k −Partitioning | 2014-03-31 | Paper |
| SINR Diagrams | 2014-02-17 | Paper |
| Finding the Minimum-Weight k-Path | 2013-08-12 | Paper |
| Configurations and Minority in the String Consensus Problem | 2013-04-08 | Paper |
| Relaxed spanners for directed disk graphs | 2013-03-05 | Paper |
| \(f\)-sensitivity distance oracles and routing schemes | 2012-12-06 | Paper |
| Distributed Algorithms for Network Diameter and Girth | 2012-11-01 | Paper |
| Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs | 2012-09-12 | Paper |
| Fully dynamic geometric spanners | 2012-04-26 | Paper |
| Relaxed Spanners for Directed Disk Graphs | 2012-01-23 | Paper |
| On dynamic shortest paths problems | 2011-09-20 | Paper |
| An Experimental Study on Approximating K Shortest Simple Paths | 2011-09-16 | Paper |
| Preprocess, Set, Query! | 2011-09-16 | Paper |
| Dynamic Connectivity: Connecting to Networks and Geometry | 2011-07-29 | Paper |
| Fault Tolerant Spanners for General Graphs | 2011-04-04 | Paper |
| On bounded leg shortest paths problems | 2011-03-30 | Paper |
| On the k Shortest Simple Paths Problem in Weighted Directed Graphs | 2011-01-17 | Paper |
| f-Sensitivity Distance Oracles and Routing Schemes | 2010-09-06 | Paper |
| On nash equilibria for a network creation game | 2010-08-16 | Paper |
| A fully dynamic reachability algorithm for directed graphs with an almost linear update time | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579371 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579450 | 2010-08-06 | Paper |
| Fully dynamic geometric spanners | 2009-02-12 | Paper |
| An Optimal Dynamic Spanner for Doubling Metric Spaces | 2008-11-25 | Paper |
| Improved Dynamic Reachability Algorithms for Directed Graphs | 2008-10-28 | Paper |
| All-Pairs Shortest Paths with a Sublinear Additive Error | 2008-08-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829021 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471323 | 2004-07-28 | Paper |
