| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6128570 | 2024-04-15 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:6128579 Distributed CONGEST Approximation of Weighted Vertex Covers and
Matchings] | 2024-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128580 | 2024-04-15 | Paper |
| Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees | 2024-03-26 | Paper |
| Node and Edge Averaged Complexities of Local Graph Problems | 2024-03-26 | Paper |
| Distributed Edge Coloring in Time Polylogarithmic in Δ | 2024-03-26 | Paper |
| Forming tile shapes with simple robots | 2024-02-09 | Paper |
| Serving Online Requests with Mobile Servers | 2024-01-08 | Paper |
| Distributed ∆-coloring plays hide-and-seek | 2023-12-08 | Paper |
| Near-optimal distributed degree+1 coloring | 2023-12-08 | Paper |
| Node and edge averaged complexities of local graph problems | 2023-11-21 | Paper |
| Efficient randomized distributed coloring in CONGEST | 2023-11-14 | Paper |
| Concurrent Distributed Serving with Mobile Servers. | 2023-02-03 | Paper |
| Distributed Approximate Maximum Matching in the CONGEST Model. | 2022-07-21 | Paper |
| Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090922 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092349 | 2022-07-21 | Paper |
| Sublinear-time distributed algorithms for detecting small cliques and even cycles | 2022-06-21 | Paper |
| Latency, capacity, and distributed minimum spanning trees | 2022-03-29 | Paper |
| Improved distributed \(\Delta\)-coloring | 2021-09-06 | Paper |
| Shape recognition by a finite automaton robot | 2021-08-04 | Paper |
| Computing Shortest Paths and Diameter in the Hybrid Network Model | 2021-03-15 | Paper |
| Distance-2 Coloring in the CONGEST Model | 2021-03-15 | Paper |
| Efficient Deterministic Distributed Coloring with Small Bandwidth | 2021-03-15 | Paper |
| Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta | 2021-03-15 | Paper |
| Faster Deterministic Distributed Coloring Through Recursive List Coloring | 2021-02-02 | Paper |
| Shortest Paths in a Hybrid Network Model | 2021-02-02 | Paper |
| Deterministic Distributed Dominating Set Approximation in the CONGEST Model | 2021-01-20 | Paper |
| On the Complexity of Distributed Splitting Problems | 2021-01-20 | Paper |
| On the Use of Randomness in Local Distributed Graph Algorithms | 2021-01-20 | Paper |
| Broadcasting in an Unreliable SINR Model. | 2020-07-30 | Paper |
| Improved distributed degree splitting and edge coloring | 2020-06-15 | Paper |
| Rumor spreading with bounded in-degree | 2020-02-06 | Paper |
| The cost of global broadcast in dynamic radio networks | 2020-01-16 | Paper |
| Contention resolution on a fading channel | 2019-11-27 | Paper |
| Improved Distributed Delta-Coloring | 2019-09-19 | Paper |
| Deterministic distributed edge-coloring with fewer colors | 2019-08-22 | Paper |
| Distributed connectivity decomposition | 2019-06-20 | Paper |
| Deterministic distributed ruling sets of line graphs | 2019-01-30 | Paper |
| Near-Optimal Distributed Maximum Flow | 2018-12-05 | Paper |
| Forming tile shapes with simple robots | 2018-11-08 | Paper |
| Tight Bounds on Vertex Connectivity Under Sampling | 2018-11-05 | Paper |
| Optimal strategies for patrolling fences | 2018-09-18 | Paper |
| Tight bounds for MIS in multichannel radio networks | 2018-08-24 | Paper |
| Polynomial lower bound for distributed graph coloring in a weak LOCAL model | 2018-08-16 | Paper |
| Local Computation | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608062 | 2018-03-15 | Paper |
| Communication Primitives in Cognitive Radio Networks | 2017-10-11 | Paper |
| Distributed MST and Routing in Almost Mixing Time | 2017-10-11 | Paper |
| Tight Bounds on Vertex Connectivity Under Vertex Sampling | 2017-10-05 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Contention Resolution on a Fading Channel | 2017-09-29 | Paper |
| The Cost of Global Broadcast in Dynamic Radio Networks. | 2017-09-29 | Paper |
| Distributed Sparse Cut Approximation. | 2017-09-29 | Paper |
| On the complexity of local distributed graph problems | 2017-08-17 | Paper |
| Rumor spreading with bounded in-degree | 2016-12-01 | Paper |
| Near-Optimal Distributed Maximum Flow | 2016-03-23 | Paper |
| Efficient Communication in Cognitive Radio Networks | 2016-03-23 | Paper |
| Serving Online Requests with Mobile Servers | 2016-01-11 | Paper |
| Coordinated consensus in dynamic networks | 2015-09-11 | Paper |
| Structuring unreliable radio networks | 2015-09-11 | Paper |
| Geometric ad-hoc routing | 2015-09-04 | Paper |
| Constant-time distributed dominating set approximation | 2015-09-04 | Paper |
| Distributed connectivity decomposition | 2015-09-03 | Paper |
| On the power of the congested clique model | 2015-09-03 | Paper |
| What cannot be computed locally! | 2015-08-03 | Paper |
| On the locality of bounded growth | 2015-03-10 | Paper |
| On the complexity of distributed graph coloring | 2015-03-10 | Paper |
| Maximal independent sets in multichannel radio networks | 2015-03-02 | Paper |
| Broadcasting in unreliable radio networks | 2015-03-02 | Paper |
| Optimal gradient clock synchronization in dynamic networks | 2015-03-02 | Paper |
| Distributed computation of the mode | 2014-12-12 | Paper |
| Efficient distributed approximation algorithms via probabilistic tree embeddings | 2014-12-12 | Paper |
| The communication complexity of distributed task allocation | 2014-12-05 | Paper |
| Leader election in shared spectrum radio networks | 2014-12-05 | Paper |
| Distributed Minimum Cut Approximation | 2014-09-29 | Paper |
| Broadcast in the Ad Hoc SINR Model | 2014-09-29 | Paper |
| Distributed computation in dynamic networks | 2014-08-13 | Paper |
| The wireless synchronization problem | 2014-07-23 | Paper |
| Structuring unreliable radio networks | 2014-07-11 | Paper |
| Internal DLA: Efficient Simulation of a Physical Growth Model | 2014-07-01 | Paper |
| Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time | 2014-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417680 | 2014-05-22 | Paper |
| Beeping a maximal independent set | 2014-03-25 | Paper |
| Reconstructing approximate tree metrics | 2014-03-13 | Paper |
| Towards worst-case churn resistant peer-to-peer systems | 2013-06-28 | Paper |
| Efficient adaptive collect using randomization | 2013-06-07 | Paper |
| Constant-time distributed dominating set approximation | 2013-06-07 | Paper |
| Vertex cover in graphs with locally few colors | 2013-06-06 | Paper |
| Lower Bounds on Information Dissemination in Dynamic Networks | 2013-03-13 | Paper |
| Efficient Symmetry Breaking in Multi-Channel Radio Networks | 2013-03-13 | Paper |
| Efficient distributed approximation algorithms via probabilistic tree embeddings | 2013-02-04 | Paper |
| Gradient clock synchronization in dynamic networks | 2012-12-10 | Paper |
| Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time | 2012-04-24 | Paper |
| The abstract MAC layer | 2012-02-06 | Paper |
| Beeping a maximal independent set | 2011-10-28 | Paper |
| The Complexity of Data Aggregation in Directed Networks | 2011-10-28 | Paper |
| Vertex Cover in Graphs with Locally Few Colors | 2011-07-06 | Paper |
| Distributed approximation of capacitated dominating sets | 2010-12-17 | Paper |
| Deploying Wireless Networks with Beeps | 2010-09-10 | Paper |
| The price of being near-sighted | 2010-08-16 | Paper |
| The Abstract MAC Layer | 2009-11-19 | Paper |
| Keeping Mobile Robot Swarms Connected | 2009-11-19 | Paper |
| Dynamic analysis of the arrow distributed protocol | 2007-01-25 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Efficient Adaptive Collect Using Randomization | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736434 | 2004-08-09 | Paper |
