| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126249 | 2024-04-09 | Paper |
| Geometric Network Creation Games | 2024-01-23 | Paper |
| Blackout-tolerant temporal spanners | 2024-01-22 | Paper |
| Compact distance oracles with large sensitivity and low stretch | 2024-01-16 | Paper |
| Finding diameter-reducing shortcuts in trees | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075905 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168428 | 2023-08-08 | Paper |
| Blackout-tolerant temporal spanners | 2023-08-04 | Paper |
| New approximation algorithms for the heterogeneous weighted delivery problem | 2022-09-16 | Paper |
| Almost optimal algorithms for diameter-optimally augmenting trees | 2022-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090997 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091032 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089176 | 2022-07-18 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5002685 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136230 | 2020-11-25 | Paper |
| Tracking routes in communication networks | 2020-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305725 | 2020-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305726 | 2020-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304107 | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304108 | 2020-08-05 | Paper |
| On the tree conjecture for the network creation game | 2020-04-15 | 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 |
| 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 |
| https://portal.mardi4nfdi.de/entity/Q4606282 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601870 | 2018-01-24 | Paper |
| Exact and approximate algorithms for movement problems on (special classes of) graphs | 2016-11-04 | Paper |
| A Faster Computation of All the Best Swap Edges of a Tree Spanner | 2016-01-08 | Paper |
| A faster computation of all the best swap edges of a shortest paths tree | 2015-11-19 | Paper |
| Improved Purely Additive Fault-Tolerant Spanners | 2015-11-19 | Paper |
| New bounds for the balloon popping problem | 2015-07-10 | 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 |
| A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | 2013-09-17 | Paper |
| New Reoptimization Techniques applied to Steiner Tree Problem | 2013-07-23 | Paper |
| New Bounds for the Balloon Popping Problem | 2013-06-11 | Paper |
| The Max-Distance Network Creation Game on General Host Graphs | 2013-04-11 | Paper |
| New Advances in Reoptimizing the Minimum Steiner Tree Problem | 2012-09-25 | Paper |
| Reconstructing visibility graphs with simple robots | 2012-08-10 | 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 |
| Reoptimization of the shortest common superstring problem | 2011-09-20 | 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 |
| Discovery of network properties with all-shortest-paths queries | 2010-04-06 | Paper |
| Reconstructing Visibility Graphs with Simple Robots | 2010-02-24 | Paper |
| Stability of Networks in Stretchable Graphs | 2010-02-24 | Paper |
| Reoptimization of the Shortest Common Superstring Problem | 2009-07-07 | Paper |
| Dynamic mechanism design | 2009-04-29 | Paper |
| On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem | 2009-03-12 | Paper |
| Reoptimization of Weighted Graph and Covering Problems | 2009-02-12 | 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 |
| Reoptimization of Steiner Trees | 2008-07-15 | Paper |
| Discovery of Network Properties with All-Shortest-Paths Queries | 2008-07-10 | Paper |
| Locating Facilities on a Network to Minimize Their Average Service Radius | 2008-05-27 | Paper |
| Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem | 2008-04-17 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
