| Publication | Date of Publication | Type |
|---|
| An output sensitive solution to the set union and intersection problem | 2024-06-21 | Paper |
| Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers | 2024-04-23 | Paper |
| Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem | 2023-06-30 | Paper |
| Sequence Hypergraphs: Paths, Flows, and Cuts | 2023-06-30 | Paper |
| Cutting bamboo down to size | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875632 | 2023-02-03 | Paper |
| New approximation algorithms for the heterogeneous weighted delivery problem | 2022-09-16 | Paper |
| New approximation algorithms for the heterogeneous weighted delivery problem | 2022-03-22 | Paper |
| Cutting bamboo down to size | 2022-03-01 | Paper |
| Multiple-edge-fault-tolerant approximate shortest-path trees | 2022-02-01 | Paper |
| ATM layouts with bounded hop count and congestion | 2020-12-03 | Paper |
| An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | 2020-11-25 | Paper |
| Tracking routes in communication networks | 2020-10-21 | Paper |
| On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games | 2020-08-11 | Paper |
| Efficient Oracles and Routing Schemes for Replacement Paths | 2020-08-05 | Paper |
| An improved algorithm for computing all the best swap edges of a tree spanner | 2020-04-09 | Paper |
| Tracking routes in communication networks | 2020-03-03 | Paper |
| Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem | 2019-06-25 | Paper |
| Fault-tolerant approximate shortest-path trees | 2018-10-18 | Paper |
| Polygon-constrained motion planning problems | 2018-10-17 | Paper |
| Effective edge-fault-tolerant single-source spanners via best (or good) swap edges | 2018-04-12 | Paper |
| Compact and Fast Sensitivity Oracles for Single-Source Distances | 2018-03-02 | Paper |
| Multiple-edge-fault-tolerant approximate shortest-path trees | 2018-01-24 | Paper |
| Sequence Hypergraphs | 2016-12-22 | Paper |
| Exact and approximate algorithms for movement problems on (special classes of) graphs | 2016-11-04 | Paper |
| Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments | 2016-10-24 | Paper |
| Finding the detour-critical edge of a shortest path between two nodes | 2016-06-09 | Paper |
| A Faster Computation of All the Best Swap Edges of a Tree Spanner | 2016-01-08 | Paper |
| Path-Fault-Tolerant Approximate Shortest-Path Trees | 2016-01-08 | Paper |
| Improved Purely Additive Fault-Tolerant Spanners | 2015-11-19 | Paper |
| A faster computation of all the best swap edges of a shortest paths tree | 2015-11-19 | Paper |
| The max-distance network creation game on general host graphs | 2015-02-24 | Paper |
| Finding best swap edges minimizing the routing cost of a spanning tree | 2014-12-02 | Paper |
| Specializations and generalizations of the Stackelberg minimum spanning tree game | 2014-12-02 | Paper |
| Fault-Tolerant Approximate Shortest-Path Trees | 2014-10-08 | Paper |
| Network verification via routing table queries | 2014-09-22 | Paper |
| Network Creation Games with Traceroute-Based Strategies | 2014-08-07 | Paper |
| An algorithm composition scheme preserving monotonicity | 2014-03-13 | Paper |
| Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs | 2013-12-17 | Paper |
| Dynamically Maintaining Shortest Path Trees under Batches of Updates | 2013-12-17 | Paper |
| A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | 2013-09-17 | Paper |
| The Max-Distance Network Creation Game on General Host Graphs | 2013-04-11 | Paper |
| Improved approximability and non-approximability results for graph diameter decreasing problems | 2012-03-13 | Paper |
| Approximating the metric TSP in linear time | 2011-11-30 | Paper |
| Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs | 2011-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3079180 | 2011-03-01 | Paper |
| Finding best swap edges minimizing the routing cost of a spanning tree | 2010-09-03 | Paper |
| Improved approximability and non-approximability results for graph diameter decreasing problems | 2010-09-03 | Paper |
| Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems | 2010-07-09 | Paper |
| Stability of networks in stretchable graphs | 2010-02-24 | Paper |
| Dynamic mechanism design | 2009-04-29 | Paper |
| Strongly polynomial-time truthful mechanisms in one shot | 2009-04-29 | Paper |
| On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem | 2009-03-12 | Paper |
| On \(k\)-connectivity problems with sharpened triangle inequality | 2009-02-23 | Paper |
| Approximating the Metric TSP in Linear Time | 2009-01-20 | Paper |
| On the complexity of minimizing interference in ad-hoc and sensor networks | 2008-08-14 | Paper |
| Locating Facilities on a Network to Minimize Their Average Service Radius | 2008-05-27 | Paper |
| Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii | 2008-04-24 | Paper |
| Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem | 2008-04-17 | Paper |
| Exact and approximate truthful mechanisms for the shortest paths tree problem | 2007-11-28 | Paper |
| Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor | 2007-09-19 | Paper |
| On the stability of approximation for Hamiltonian path problems | 2007-01-18 | Paper |
| Efficient management of transient station failures in linear radio communication networks with bases | 2006-08-04 | Paper |
| Efficient unbalanced merge-sort | 2006-05-16 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673403 | 2005-04-29 | Paper |
| On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | 2005-01-11 | Paper |
| Nearly linear time minimum spanning tree maintenance for transient node failures | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474101 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437508 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425950 | 2003-09-14 | Paper |
| Polynomial time algorithms for 2-edge-connectivity augmentation problems | 2003-08-19 | Paper |
| Finding the most vital node of a shortest path. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415244 | 2003-07-28 | Paper |
| Swapping a failing edge of a single source shortest paths tree is good and fast | 2003-06-02 | Paper |
| An efficient spatial access method for spatial images containing multiple non-overlapping features | 2003-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551366 | 2002-09-05 | Paper |
| A faster computation of the most vital edge of a shortest path | 2002-07-14 | Paper |
| Finding all the best swaps of a minimum diameter spanning tree under transient edge failures | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753951 | 2001-11-11 | Paper |
| A generalized comparison of linear representations of thematic layers | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938662 | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252023 | 2000-03-13 | Paper |
| Intersection reporting on two collections of disjoint sets | 2000-01-05 | Paper |
| An optimal algorithm for decomposing a window into maximal quadtree blocks | 1999-11-09 | Paper |
