| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126255 | 2024-04-09 | Paper |
| Locally checkable problems in rooted trees | 2024-03-26 | Paper |
| Strong-Diameter Network Decomposition | 2024-03-26 | Paper |
| Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions | 2024-03-26 | Paper |
| The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs | 2024-03-26 | Paper |
| Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications | 2024-03-26 | Paper |
| The energy complexity of diameter and minimum cut computation in bounded-genus networks | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147429 | 2024-01-15 | Paper |
| The energy complexity of diameter and minimum cut computation in bounded-genus networks | 2024-01-11 | Paper |
| Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election | 2023-10-23 | Paper |
| Locally checkable problems in rooted trees | 2023-09-11 | Paper |
| Distributed graph problems through an automata-theoretic lens | 2023-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874307 | 2023-02-07 | Paper |
| Near-optimal Distributed Triangle Enumeration via Expander Decompositions | 2022-12-08 | Paper |
| Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees | 2022-04-20 | Paper |
| Distributed graph problems through an automata-theoretic Lens | 2022-03-22 | Paper |
| On Homomorphism Graphs | 2021-11-05 | Paper |
| The Energy Complexity of BFS in Radio Networks | 2021-03-15 | Paper |
| Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration | 2021-01-20 | Paper |
| The Distributed Complexity of Locally Checkable Problems on Paths is Decidable | 2021-01-20 | Paper |
| The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation | 2021-01-20 | Paper |
| Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering | 2020-05-28 | Paper |
| Exponential Separations in the Energy Complexity of Leader Election | 2019-12-02 | Paper |
| Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma | 2019-12-02 | Paper |
| Distributed Triangle Detection via Expander Decomposition | 2019-10-15 | Paper |
| The Energy Complexity of Broadcast | 2019-09-19 | Paper |
| An optimal distributed (Δ+1)-coloring algorithm? | 2019-08-22 | Paper |
| Unfolding some classes of orthogonal polyhedra of arbitrary genus | 2019-06-06 | Paper |
| An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model | 2019-02-08 | Paper |
| Hardness of RNA folding problem with four symbols | 2019-01-18 | Paper |
| A Time Hierarchy Theorem for the LOCAL Model | 2019-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580103 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608064 | 2018-03-15 | Paper |
| Unfolding some classes of orthogonal polyhedra of arbitrary genus | 2017-10-23 | Paper |
| Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra | 2017-10-20 | Paper |
| Hardness of RNA Folding Problem With Four Symbols. | 2017-10-17 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Exponential separations in the energy complexity of leader election | 2017-08-17 | Paper |
| On orthogonally convex drawings of plane graphs | 2017-06-29 | Paper |
| Area-universal drawings of biconnected outerplane graphs | 2016-11-23 | Paper |
| Unfolding Orthogonal Polyhedra with Linear Refinement | 2016-01-11 | Paper |
| Constrained floorplans in 2D and 3D | 2015-12-11 | Paper |
| A New Approach for Contact Graph Representations and Its Applications | 2015-10-30 | Paper |
| Rectilinear Duals Using Monotone Staircase Polygons | 2015-09-11 | Paper |
| On Orthogonally Convex Drawings of Plane Graphs | 2013-12-20 | Paper |
| On Homomorphism Graphs | 0001-01-03 | Paper |
