| Publication | Date of Publication | Type |
|---|
| \((1+\varepsilon)\)-approximate shortest paths in dynamic streams | 2024-08-22 | Paper |
| Almost shortest paths with near-additive error in weighted graphs | 2024-05-27 | Paper |
| Centralized, parallel, and distributed multi-source shortest paths via hopsets and rectangular matrix multiplication | 2024-04-23 | Paper |
| Ultra-Sparse Near-Additive Emulators | 2024-03-26 | Paper |
| Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams. | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083385 | 2023-12-08 | Paper |
| Improved weighted additive spanners | 2023-09-11 | Paper |
| Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC | 2022-10-14 | Paper |
| Lossless prioritized embeddings | 2022-07-13 | Paper |
| Distributed strong diameter network decomposition | 2022-06-13 | Paper |
| Locally-iterative Distributed (Δ + 1)-coloring and Applications | 2022-03-31 | Paper |
| Near isometric terminal embeddings for doubling metrics | 2021-11-19 | Paper |
| Near-additive spanners and near-exact hopsets, a unified view | 2021-08-30 | Paper |
| Ramsey spanning trees and their applications | 2021-05-03 | Paper |
| Distributed Construction of Light Networks | 2021-03-15 | Paper |
| Lossless Prioritized Embeddings | 2021-02-02 | Paper |
| Near-additive spanners in low polynomial deterministic CONGEST time | 2021-01-20 | Paper |
| Distributed exact shortest paths in sublinear time | 2020-11-11 | Paper |
| A simple deterministic distributed MST algorithm with near-optimal time and message complexities | 2020-11-11 | Paper |
| Near isometric terminal embeddings for doubling metrics | 2020-08-18 | Paper |
| Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models | 2019-09-19 | Paper |
| Near-optimal distributed routing with low memory | 2019-09-19 | Paper |
| Hopsets with constant hopbound, and applications to approximate shortest paths | 2019-09-16 | Paper |
| Fast constructions of light-weight spanners for general graphs | 2019-05-15 | Paper |
| Efficient algorithms for constructing very sparse spanners and emulators | 2019-03-28 | Paper |
| A fast network-decomposition algorithm and its applications to constant-time distributed computation | 2018-11-29 | Paper |
| Fast constructions of lightweight spanners for general graphs | 2018-11-05 | Paper |
| A linear-size logarithmic stretch path-reporting distance oracle for general graphs | 2018-11-05 | Paper |
| Optimal Euclidean Spanners | 2018-08-02 | Paper |
| Efficient algorithms for constructing very sparse spanners and emulators | 2018-07-16 | Paper |
| Prioritized metric structures and embedding | 2018-07-04 | Paper |
| On efficient distributed construction of near optimal routing schemes | 2018-04-11 | Paper |
| Ramsey spanning trees and their applications | 2018-03-15 | Paper |
| A simple deterministic distributed MST algorithm, with near-optimal time and message complexities | 2017-10-11 | Paper |
| Deterministic distributed \((\Delta + o(\Delta))\)-edge-coloring, and vertex-coloring of graphs with bounded diversity | 2017-10-11 | Paper |
| A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs | 2017-10-05 | Paper |
| \((2\Delta-1)\)-edge-coloring is much easier than maximal matching in the distributed setting | 2017-10-05 | Paper |
| On efficient distributed construction of near optimal routing schemes (extended abstract) | 2017-09-29 | Paper |
| Distributed Strong Diameter Network Decomposition | 2017-09-29 | Paper |
| Terminal embeddings | 2017-09-28 | Paper |
| Terminal embeddings | 2017-08-31 | Paper |
| Distributed exact shortest paths in sublinear time | 2017-08-17 | Paper |
| Space-efficient path-reporting approximate distance oracles | 2017-03-16 | Paper |
| Optimizing budget allocation for center and median points | 2016-04-01 | Paper |
| Computing almost shortest paths (extended abstract) | 2016-03-04 | Paper |
| A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract) | 2016-01-08 | Paper |
| Distributed deterministic edge coloring using bounded neighborhood independence | 2015-09-11 | Paper |
| Can quantum communication speed up distributed computation? | 2015-09-03 | Paper |
| Computing almost shortest paths | 2015-09-02 | Paper |
| An improved algorithm for radio broadcast | 2015-09-02 | Paper |
| Prioritized metric structures and embedding | 2015-08-21 | Paper |
| Steiner shallow-light trees are exponentially lighter than spanning ones | 2015-08-18 | Paper |
| A faster distributed protocol for constructing a minimum spanning tree | 2015-08-03 | Paper |
| Efficient algorithms for constructing \((1+{\epsilon}, {\beta})\)-spanners in the distributed and streaming models | 2015-08-03 | Paper |
| Light spanners | 2015-07-31 | Paper |
| Deterministic distributed vertex coloring in polylogarithmic time | 2015-03-02 | Paper |
| (1 + εΒ) -spanner constructions for general graphs | 2015-02-27 | Paper |
| Distributed \(({\Delta}+1)\)-coloring in linear (in \({\Delta})\) time | 2015-02-04 | Paper |
| Balancing degree, diameter, and weight in Euclidean spanners | 2014-12-22 | Paper |
| Sublogarithmic distributed \textsc{MIS} algorithm for sparse graphs using Nash-Williams decomposition | 2014-12-12 | Paper |
| Improved schedule for radio broadcast | 2014-10-13 | Paper |
| Sparse source-wise and pair-wise distance preservers | 2014-10-13 | Paper |
| Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners | 2014-09-09 | Paper |
| Optimal Euclidean spanners, really short, thin and lanky | 2014-08-07 | Paper |
| Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones | 2014-07-30 | Paper |
| Combinatorial algorithms for distributed graph coloring | 2014-07-11 | Paper |
| Light spanners | 2014-07-01 | Paper |
| Distributed Graph Coloring: Fundamentals and Recent Developments | 2014-06-20 | Paper |
| Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time | 2014-06-04 | Paper |
| An improved construction of progression-free sets | 2014-05-22 | Paper |
| Distributed deterministic edge coloring using bounded neighborhood independence | 2014-03-28 | Paper |
| A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners | 2014-03-13 | Paper |
| Deterministic distributed vertex coloring in polylogarithmic time | 2014-02-17 | Paper |
| Symmetry breaking depending on the chromatic number or the neighborhood growth | 2014-01-13 | Paper |
| Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models | 2013-06-13 | Paper |
| An improved construction of progression-free sets | 2012-11-19 | Paper |
| Energy fluctuations shape free energy of nonspecific biomolecular interactions | 2012-04-04 | Paper |
| Combinatorial algorithms for distributed graph coloring | 2011-10-28 | Paper |
| Narrow-Shallow-Low-Light Trees with and without Steiner Points | 2011-10-27 | Paper |
| Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition | 2010-09-09 | Paper |
| Balancing degree, diameter and weight in Euclidean spanners | 2010-09-06 | Paper |
| Lower-stretch spanning trees | 2010-08-16 | Paper |
| Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem | 2010-08-15 | Paper |
| Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem | 2010-08-05 | Paper |
| Low-light trees, and tight lower bounds for Euclidean spanners | 2010-05-21 | Paper |
| New length bounds for cycle bases | 2010-03-24 | Paper |
| Narrow-Shallow-Low-Light Trees with and without Steiner Points | 2009-10-29 | Paper |
| Lower-Stretch Spanning Trees | 2009-04-30 | Paper |
| Bounds on the performance of back-to-front airplane boarding policies | 2008-11-27 | Paper |
| The hardness of approximating spanner problems | 2007-12-19 | Paper |
| Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners | 2007-11-28 | Paper |
| Sparse Sourcewise and Pairwise Distance Preservers | 2007-05-22 | Paper |
| An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem | 2007-05-03 | Paper |
| A faster distributed protocol for constructing a minimum spanning tree | 2006-12-07 | Paper |
| An approximation algorithm for the directed telephone multicast problem | 2006-09-26 | Paper |
| Sublogarithmic approximation for telephone multicast | 2006-06-30 | Paper |
| A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem | 2006-06-01 | Paper |
| Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem | 2006-06-01 | Paper |
| Sparse Distance Preservers and Additive Spanners | 2006-06-01 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Approximating \(k\)-spanner problems for \(k>2\) | 2005-06-30 | Paper |
| $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs | 2005-02-21 | Paper |
| Logarithmic inapproximability of the radio broadcast problem | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471276 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471324 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449177 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537738 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754183 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728855 | 2001-11-01 | Paper |
