| Publication | Date of Publication | Type |
|---|
| Adjacency Labelling for Planar Graphs (and Beyond) | 2022-12-08 | Paper |
| Shorter Labeling Schemes for Planar Graphs | 2022-09-21 | Paper |
| Isometric Universal Graphs | 2021-06-10 | Paper |
| Shorter Labeling Schemes for Planar Graphs | 2021-02-02 | Paper |
| Compact and localized distributed data structures | 2020-12-04 | Paper |
| Interval routing schemes allow broadcasting with linear message-complexity | 2020-12-03 | Paper |
| Universal routing schemes | 2020-12-02 | Paper |
| Localisation-resistant random words with small alphabets | 2019-11-06 | Paper |
| Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs | 2019-09-02 | Paper |
| A fast network-decomposition algorithm and its applications to constant-time distributed computation | 2018-11-29 | Paper |
| Compact name-independent routing with minimum stretch | 2018-11-05 | Paper |
| Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension | 2018-10-30 | Paper |
| Simpler, faster and shorter labels for distances in graphs | 2018-07-16 | Paper |
| Towards Plane Spanners of Degree 3 | 2018-04-19 | Paper |
| A characterization of networks supporting linear interval routing | 2017-09-29 | Paper |
| Memory requirement for universal routing schemes | 2017-09-29 | Paper |
| Towards plane spanners of degree 3 | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816089 | 2016-07-01 | Paper |
| A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation | 2016-01-08 | Paper |
| Memory requirement for routing in distributed networks | 2015-09-11 | Paper |
| Eclecticism shrinks even small worlds | 2015-08-03 | Paper |
| Cops, robbers, and threatening skeletons | 2015-06-26 | Paper |
| Object location using path separators | 2015-03-10 | Paper |
| Interval routing schemes allow broadcasting with linear message-complexity (extended abstract) | 2015-03-03 | Paper |
| Forbidden-set distance labels for graphs of bounded doubling dimension | 2015-03-02 | Paper |
| Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations | 2014-12-23 | Paper |
| On the locality of distributed sparse spanner construction | 2014-12-12 | Paper |
| Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels | 2014-05-13 | Paper |
| On local representation of distances in trees | 2014-03-13 | Paper |
| On the Path Separability of Planar Graphs | 2013-10-10 | Paper |
| On the Tree-Width of Planar Graphs | 2013-10-10 | Paper |
| Distributed computing with advice: information sensitivity of graph coloring | 2013-06-28 | Paper |
| Connectivity check in 3-connected planar graphs with obstacles | 2013-06-28 | Paper |
| Eclecticism shrinks even small worlds | 2013-06-13 | Paper |
| An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps | 2013-01-11 | Paper |
| The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations | 2012-09-25 | Paper |
| Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners | 2012-07-27 | Paper |
| On Approximate Distance Labels and Routing Schemes with Affine Stretch | 2011-10-28 | Paper |
| Compact labelings for efficient first-order model-checking | 2011-02-18 | Paper |
| Strong-diameter decompositions of minor free graphs | 2010-12-17 | Paper |
| On the complexity of distributed graph coloring with local minimality constraints | 2010-11-24 | Paper |
| Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces | 2010-11-16 | Paper |
| Path Separability of Graphs | 2010-09-07 | Paper |
| Plane Spanners of Maximum Degree Six | 2010-09-07 | Paper |
| Multipath Spanners | 2010-06-17 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Local Computation of Nearly Additive Spanners | 2009-11-19 | Paper |
| What Can Be Observed Locally? | 2009-11-19 | Paper |
| Optimal Distance Labeling for Interval Graphs and Related Graph Families | 2009-08-20 | Paper |
| Localized and compact data-structure for comparability graphs | 2009-06-19 | Paper |
| Universal augmentation schemes for network navigability | 2009-05-28 | Paper |
| Short Labels by Traversal and Jumping | 2009-03-12 | Paper |
| Fast Deterministic Distributed Algorithms for Sparse Spanners | 2009-03-12 | Paper |
| Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs | 2008-09-25 | Paper |
| Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time | 2008-09-02 | Paper |
| On the Complexity of Distributed Greedy Coloring | 2008-09-02 | Paper |
| Fast deterministic distributed algorithms for sparse spanners | 2008-06-24 | Paper |
| Efficient First-Order Model-Checking Using Short Labels | 2008-06-19 | Paper |
| Distributed Relationship Schemes for Trees | 2008-05-27 | Paper |
| Distributed Computing with Advice: Information Sensitivity of Graph Coloring | 2007-11-28 | Paper |
| Spanners for bounded tree-length graphs | 2007-09-19 | Paper |
| Distributed Data Structures: A Survey on Informative Labeling Schemes | 2007-09-05 | Paper |
| Tree-decompositions with bags of small diameter | 2007-06-26 | Paper |
| Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs | 2007-05-29 | Paper |
| Edge Partition of Toroidal Graphs into Forests in Linear Time | 2007-05-29 | Paper |
| Distance Labeling for Permutation Graphs | 2007-05-29 | Paper |
| Short Labels by Traversal and Jumping | 2007-05-29 | Paper |
| Average stretch analysis of compact routing schemes | 2007-04-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Planar graphs, via well-orderly maps and trees | 2006-09-12 | Paper |
| Header-size lower bounds for end-to-end communication in memoryless networks | 2006-06-30 | Paper |
| Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation | 2006-04-03 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Routing with Improved Communication-Space Trade-Off | 2005-08-17 | Paper |
| Interval routing in reliability networks | 2005-04-06 | Paper |
| Nearest common ancestors: a survey and a new algorithm for a distributed environment | 2005-02-08 | Paper |
| Distance labeling in graphs | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736828 | 2004-08-11 | Paper |
| The compactness of adaptive routing tables | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448760 | 2004-02-18 | Paper |
| Distance labeling scheme and split decomposition | 2004-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437127 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418676 | 2003-08-11 | Paper |
| Compact routing schemes with low stretch factor | 2003-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796196 | 2003-03-02 | Paper |
| Recognizing Knödel graphs | 2002-08-29 | Paper |
| Space-efficiency for routing schemes of stretch factor three | 2002-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535803 | 2002-06-16 | Paper |
| The Compactness of Interval Routing for Almost All Graphs | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768294 | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753924 | 2001-11-11 | Paper |
| A survey on interval routing | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699302 | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944982 | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4509345 | 2000-01-01 | Paper |
| The Compactness of Interval Routing | 1999-11-23 | Paper |
| Worst Case Bounds for Shortest Path Interval Routing | 1999-08-31 | Paper |
| Interval routing schemes | 1998-10-01 | Paper |
