| Publication | Date of Publication | Type |
|---|
| An improved bound for plane covering paths | 2026-08-31 | Paper |
| Isometric-universal graphs for trees | 2026-08-05 | Paper |
| Universal graph theory operations for graph state preparation | 2025-11-14 | Paper |
| Adjacency labelling for planar graphs (and beyond) | 2025-08-12 | Paper |
Adjacency Labelling for Planar Graphs (and Beyond)
Journal of the ACM | 2022-12-08 | Paper |
Shorter Labeling Schemes for Planar Graphs
SIAM Journal on Discrete Mathematics | 2022-09-21 | Paper |
Isometric universal graphs
SIAM Journal on Discrete Mathematics | 2021-06-10 | Paper |
Shorter Labeling Schemes for Planar Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Compact and localized distributed data structures
Distributed Computing | 2020-12-04 | Paper |
Interval routing schemes allow broadcasting with linear message-complexity
Distributed Computing | 2020-12-03 | Paper |
Universal routing schemes
Distributed Computing | 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
SIAM Journal on Computing | 2019-09-02 | Paper |
A fast network-decomposition algorithm and its applications to constant-time distributed computation
Theoretical Computer Science | 2018-11-29 | Paper |
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Simpler, faster and shorter labels for distances in graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Towards plane spanners of degree 3 | 2018-04-19 | Paper |
A characterization of networks supporting linear interval routing
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Towards plane spanners of degree 3
(available as arXiv preprint) | 2017-03-30 | Paper |
| Approximate distance labeling schemes | 2016-07-01 | Paper |
A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract)
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Memory requirement for routing in distributed networks
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Tight stretch factors for L₁- and L_-Delaunay triangulations
Computational Geometry | 2014-12-23 | Paper |
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
On local representation of distances in trees
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
On the path separability of planar graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
On the tree-width of planar graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Distributed computing with advice: information sensitivity of graph coloring
Distributed Computing | 2013-06-28 | Paper |
Connectivity check in 3-connected planar graphs with obstacles
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Eclecticism shrinks even small worlds
Distributed Computing | 2013-06-13 | Paper |
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
Towards an Information Theory of Complex Networks | 2013-01-11 | Paper |
The stretch factor of \(L _{1}\)- and \(L _{ \infty }\)-Delaunay triangulations
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
Lecture Notes in Computer Science | 2012-07-27 | Paper |
On approximate distance labels and routing schemes with affine stretch
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Strong-diameter decompositions of minor free graphs
Theory of Computing Systems | 2010-12-17 | Paper |
On the complexity of distributed graph coloring with local minimality constraints
Networks | 2010-11-24 | Paper |
Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Path Separability of Graphs
Frontiers in Algorithmics | 2010-09-07 | Paper |
Plane Spanners of Maximum Degree Six
Automata, Languages and Programming | 2010-09-07 | Paper |
Multipath spanners
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Optimal distance labeling for interval and circular-arc graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Lower bounds for oblivious single-packet end-to-end communication
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation (extended abstract)
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Local Computation of Nearly Additive Spanners
Lecture Notes in Computer Science | 2009-11-19 | Paper |
What Can Be Observed Locally?
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Optimal Distance Labeling for Interval Graphs and Related Graph Families
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Localized and compact data-structure for comparability graphs
Discrete Mathematics | 2009-06-19 | Paper |
Universal augmentation schemes for network navigability
Theoretical Computer Science | 2009-05-28 | Paper |
Fast Deterministic Distributed Algorithms for Sparse Spanners
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Short Labels by Traversal and Jumping
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
Lecture Notes in Computer Science | 2008-09-02 | Paper |
On the Complexity of Distributed Greedy Coloring
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science | 2008-06-24 | Paper |
Efficient First-Order Model-Checking Using Short Labels
Frontiers in Algorithmics | 2008-06-19 | Paper |
Distributed Relationship Schemes for Trees
Algorithms and Computation | 2008-05-27 | Paper |
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
Automata, Languages and Programming | 2007-11-28 | Paper |
Spanners for bounded tree-length graphs
Theoretical Computer Science | 2007-09-19 | Paper |
Distributed Data Structures: A Survey on Informative Labeling Schemes
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Tree-decompositions with bags of small diameter
Discrete Mathematics | 2007-06-26 | Paper |
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Edge Partition of Toroidal Graphs into Forests in Linear Time
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Distance Labeling for Permutation Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Short Labels by Traversal and Jumping
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics | 2007-04-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Planar graphs, via well-orderly maps and trees
Graphs and Combinatorics | 2006-09-12 | Paper |
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks | 2006-06-30 | Paper |
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Routing with Improved Communication-Space Trade-Off
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Interval routing in reliability networks
Theoretical Computer Science | 2005-04-06 | Paper |
Nearest common ancestors: a survey and a new algorithm for a distributed environment
Theory of Computing Systems | 2005-02-08 | Paper |
Distance labeling in graphs
Journal of Algorithms | 2004-11-12 | Paper |
| scientific article; zbMATH DE number 2086374 (Why is no real title available?) | 2004-08-11 | Paper |
The compactness of adaptive routing tables
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2044937 (Why is no real title available?) | 2004-02-18 | Paper |
Distance labeling scheme and split decomposition
Discrete Mathematics | 2004-01-05 | Paper |
| scientific article; zbMATH DE number 2013835 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 1962839 (Why is no real title available?) | 2003-08-11 | Paper |
Compact routing schemes with low stretch factor
Journal of Algorithms | 2003-05-27 | Paper |
| scientific article; zbMATH DE number 1875437 (Why is no real title available?) | 2003-03-02 | Paper |
Recognizing Knödel graphs
Discrete Mathematics | 2002-08-29 | Paper |
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing | 2002-08-14 | Paper |
| scientific article; zbMATH DE number 1756017 (Why is no real title available?) | 2002-06-16 | Paper |
The compactness of interval routing for almost all graphs
SIAM Journal on Computing | 2002-04-23 | Paper |
| Distance labeling in graphs (extended abstract) | 2002-03-14 | Paper |
