| Publication | Date of Publication | Type |
|---|
| Locality in online, dynamic, sequential, and distributed graph algorithms | 2024-11-14 | Paper |
| Changing lanes on a highway | 2024-08-27 | Paper |
| Sinkless orientation made simple | 2024-05-14 | Paper |
| Locally checkable problems in rooted trees | 2024-03-26 | Paper |
| Distributed half-integral matching and beyond | 2024-02-23 | Paper |
| Distributed half-integral matching and beyond | 2024-01-11 | Paper |
| Locally checkable labelings with small messages | 2023-12-08 | Paper |
| Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model | 2023-12-08 | Paper |
| Classification of distributed binary labeling problems | 2023-11-02 | Paper |
| Landscape of Locality (Invited Talk). | 2023-11-02 | Paper |
| Brief announcement: Efficient load-balancing through distributed token dropping | 2023-11-02 | Paper |
| Brief announcement: Distributed graph problems through an automata-theoretic lens | 2023-11-02 | Paper |
| Locally checkable problems in rooted trees | 2023-09-11 | Paper |
| Distributed graph problems through an automata-theoretic lens | 2023-03-10 | Paper |
| Improved distributed degree splitting and edge coloring | 2023-02-03 | Paper |
| Lower Bounds for Maximal Matchings and Maximal Independent Sets | 2022-12-08 | Paper |
| Local mending | 2022-11-11 | Paper |
| Distributed Recoloring | 2022-07-21 | Paper |
| Almost global problems in the LOCAL model | 2022-07-21 | Paper |
| Distributed graph problems through an automata-theoretic Lens | 2022-03-22 | Paper |
| Almost global problems in the LOCAL model | 2021-09-06 | Paper |
| How much does randomness help with locally checkable problems? | 2021-03-15 | Paper |
| Brief Announcement: Classification of Distributed Binary Labeling Problems | 2021-03-15 | Paper |
| Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems | 2021-03-15 | Paper |
| The Distributed Complexity of Locally Checkable Problems on Paths is Decidable | 2021-01-20 | Paper |
| Hardness of Minimal Symmetry Breaking in Distributed Computing | 2021-01-20 | Paper |
| Constant space and non-constant time in distributed computing | 2020-07-30 | Paper |
| Improved distributed degree splitting and edge coloring | 2020-06-15 | Paper |
| Locality of not-so-weak coloring | 2020-03-03 | Paper |
| Algebraic methods in the congested clique | 2019-11-27 | Paper |
| New classes of distributed time complexity | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967178 | 2019-07-03 | Paper |
| Node labels in local decision | 2018-11-29 | Paper |
| Improved Approximation Algorithms for Relay Placement | 2018-10-30 | Paper |
| Locally optimal load balancing | 2018-08-24 | Paper |
| Non-local probes do not help with many graph problems | 2018-08-16 | Paper |
| Linear-in-\(\varDelta \) lower bounds in the LOCAL model | 2018-01-17 | Paper |
| Large cuts with local algorithms on triangle-free graphs | 2017-10-24 | Paper |
| Randomized algorithms for finding a majority element | 2017-10-17 | Paper |
| LCL Problems on Grids | 2017-10-11 | Paper |
| A lower bound for the distributed Lovász local lemma | 2017-09-29 | Paper |
| Efficient Counting with Optimal Resilience | 2017-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3179347 | 2016-12-21 | Paper |
| Towards optimal synchronous counting | 2016-03-23 | Paper |
| Algebraic methods in the congested clique | 2016-03-23 | Paper |
| Node labels in local decision | 2016-01-08 | Paper |
| Exact Bounds for Distributed Graph Colouring | 2016-01-08 | Paper |
| Synchronous counting and computational algorithm design | 2015-12-11 | Paper |
| Deterministic local algorithms, unique identifiers, and fractional graph colouring | 2015-12-10 | Paper |
| The minimum backlog problem | 2015-10-30 | Paper |
| Locally checkable proofs | 2015-09-11 | Paper |
| Linear-in-delta lower bounds in the LOCAL model | 2015-09-03 | Paper |
| Weak models of distributed computing, with connections to modal logic | 2015-03-25 | Paper |
| Distributed algorithms for edge dominating sets | 2015-03-02 | Paper |
| What can be decided locally without identifiers? | 2015-03-02 | Paper |
| No sublogarithmic-time approximation scheme for bipartite vertex cover | 2015-02-23 | Paper |
| Lower bounds for local approximation | 2014-12-05 | Paper |
| Distributed maximal matching | 2014-12-05 | Paper |
| Weak models of distributed computing, with connections to modal logic | 2014-12-05 | Paper |
| Survey of local algorithms | 2014-08-13 | Paper |
| Lower bounds for local approximation | 2014-02-17 | Paper |
| No sublogarithmic-time approximation scheme for bipartite vertex cover | 2013-03-13 | Paper |
| Local approximability of max-min and min-max linear programs | 2012-12-10 | Paper |
| Deterministic local algorithms, unique identifiers, and fractional graph colouring | 2012-09-26 | Paper |
| Analysing local algorithms in location-aware quasi-unit-disk graphs | 2011-10-27 | Paper |
| Planar subgraphs without low-degree nodes | 2011-08-12 | Paper |
| Almost stable matchings by truncating the Gale-Shapley algorithm | 2010-10-07 | Paper |
| A simple local 3-approximation algorithm for vertex cover | 2010-08-16 | Paper |
| Approximability of identifying codes and locating-dominating codes | 2010-03-24 | Paper |
| A Local 2-Approximation Algorithm for the Vertex Cover Problem | 2009-11-19 | Paper |
| Improved Approximation Algorithms for Relay Placement | 2008-11-25 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Online Locality Meets Distributed Quantum Computing | N/A | Paper |
