| Publication | Date of Publication | Type |
|---|
| Online algorithms with randomly infused advice | 2025-01-06 | Paper |
| Beeping shortest paths via hypergraph bipartite decomposition | 2024-09-25 | Paper |
| Stateful posted pricing with vanishing regret via dynamic deterministic Markov decision processes | 2024-06-27 | Paper |
| A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks | 2024-03-26 | Paper |
| Deterministic Fault-Tolerant Connectivity Labeling Scheme | 2024-03-26 | Paper |
| Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions | 2024-03-19 | Paper |
| Communication efficient self-stabilizing leader election | 2023-11-02 | Paper |
| Twenty-two new approximate proof labeling schemes | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874267 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875752 | 2023-02-03 | Paper |
| Distributed algorithms for low stretch spanning trees | 2023-02-03 | Paper |
| Message reduction in the LOCAL model is a free lunch | 2023-02-03 | Paper |
| The Synergy of Finite State Machines | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090892 | 2022-07-21 | Paper |
| Deterministic Leader Election in Programmable Matter | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075787 | 2022-05-11 | Paper |
| Bayesian generalized network design | 2022-05-11 | Paper |
| Hierarchical \(b\)-matching | 2022-03-24 | Paper |
| Message Reduction in the LOCAL Model is a Free Lunch | 2021-01-20 | Paper |
| Approximating generalized network design under (dis)economies of scale with applications to energy efficiency | 2020-11-11 | Paper |
| Bayesian generalized network design | 2020-09-17 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-09-03 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-05-27 | Paper |
| Dynamic networks of finite state machines | 2020-02-06 | Paper |
| Approximating generalized network design under (dis)economies of scale with applications to energy efficiency | 2019-08-22 | Paper |
| Stable secretaries | 2019-06-27 | Paper |
| Minimum cost perfect matching with delays for two sources | 2018-12-04 | Paper |
| Space-constrained interval selection | 2018-11-05 | Paper |
| Semi-streaming set cover | 2018-11-05 | Paper |
| Exploring an infinite space with finite memory scouts | 2018-07-16 | Paper |
| On the additive constant of the \(k\)-server work function algorithm | 2017-11-03 | Paper |
| Online matching: haste makes waste! | 2017-09-29 | Paper |
| Approximating the statistics of various properties in randomly weighted graphs | 2017-09-29 | Paper |
| Minimum cost perfect matching with delays for two sources | 2017-07-21 | Paper |
| On the effect of the deployment setting on broadcasting in Euclidean radio networks | 2017-06-22 | Paper |
| Dynamic networks of finite state machines | 2016-12-01 | Paper |
| How many ants does it take to find the food? | 2015-12-11 | Paper |
| The price of matching with metric preferences | 2015-11-19 | Paper |
| Anonymous networks | 2015-09-03 | Paper |
| Economical Graph Discovery | 2015-08-28 | Paper |
| Approximating minimum MAX-stretch spanning trees on unweighted graphs | 2015-08-03 | Paper |
| Stone age distributed computing | 2015-03-02 | Paper |
| Online set packing and competitive scheduling of multi-part tasks | 2015-03-02 | Paper |
| Efficient threshold detection in a distributed environment (extended abstract) | 2015-03-02 | Paper |
| Bayesian ignorance | 2015-03-02 | Paper |
| On the effect of the deployment setting on broadcasting in Euclidean radio networks | 2014-12-12 | Paper |
| A near-linear-time algorithm for computing replacement paths in planar directed graphs | 2014-11-18 | Paper |
| How many ants does it take to find the food? | 2014-08-07 | Paper |
| SINR diagrams, towards algorithmically usable SINR models of wireless networks | 2014-07-23 | Paper |
| Computability in anonymous networks: revocable vs. irrecovable outputs | 2014-07-01 | Paper |
| Semi-streaming set cover (extended abstract) | 2014-07-01 | Paper |
| Solving the ANTS problem with asynchronous finite state machines | 2014-07-01 | Paper |
| Broadcasting in UDG radio networks with unknown topology | 2014-03-13 | Paper |
| SINR diagrams, convexity and its applications in wireless networks | 2014-02-17 | Paper |
| Space-constrained interval selection | 2013-08-12 | Paper |
| Broadcasting in UDG radio networks with unknown topology | 2013-06-28 | Paper |
| Adversarial Leakage in Games | 2013-06-27 | Paper |
| Online set packing | 2012-11-29 | Paper |
| Computing optimal contracts in combinatorial agencies | 2012-10-11 | Paper |
| Bayesian ignorance | 2012-10-11 | Paper |
| Sparse reliable graph backbones | 2012-05-24 | Paper |
| New bounds for the controller problem | 2012-02-06 | Paper |
| \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees | 2011-08-16 | Paper |
| Online computation with advice | 2011-06-07 | Paper |
| A tight upper bound on the probabilistic embedding of series-parallel graphs | 2010-12-03 | Paper |
| Sparse reliable graph backbones | 2010-09-07 | Paper |
| Lower-stretch spanning trees | 2010-08-16 | Paper |
| A tight upper bound on the probabilistic embedding of series-parallel graphs | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579371 | 2010-08-06 | Paper |
| On the additive constant of the \(k\)-server work function algorithm | 2010-05-11 | Paper |
| New Bounds for the Controller Problem | 2009-11-19 | Paper |
| Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs | 2009-11-06 | Paper |
| k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees | 2009-10-29 | Paper |
| Online Computation with Advice | 2009-07-14 | Paper |
| Lower-Stretch Spanning Trees | 2009-04-30 | Paper |
