| Publication | Date of Publication | Type |
|---|
Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
Distributed Computing | 2026-05-13 | Paper |
Improved all-pairs approximate shortest paths in congested clique
Distributed Computing | 2026-05-13 | Paper |
| The distributed complexity of locally checkable labeling problems beyond paths and trees | 2025-11-04 | Paper |
| Deterministic distributed expander decomposition and routing with applications in distributed derandomization | 2025-08-12 | Paper |
| A time hierarchy theorem for the LOCAL model | 2025-08-06 | Paper |
| An exponential separation between randomized and deterministic complexity in the LOCAL model | 2025-08-06 | Paper |
| Brief announcement: Low-distortion clustering in bounded growth graphs | 2025-06-13 | Paper |
| Improved all-pairs approximate shortest paths in congested clique | 2025-06-13 | Paper |
| Universally optimal information dissemination and shortest paths in the HYBRID distributed model | 2025-06-13 | Paper |
| Deterministic expander routing: faster and more versatile | 2025-06-13 | Paper |
| A tight lower bound for 3-coloring grids in the online-LOCAL model | 2025-06-13 | Paper |
Ortho-radial drawing in near-linear time
TheoretiCS | 2025-05-06 | Paper |
| Fully scalable massively parallel algorithms for embedded planar graphs | 2024-11-28 | Paper |
| Ortho-radial drawing in near-linear time | 2024-11-14 | Paper |
| Simple contention resolution via multiplicative weight updates | 2024-08-26 | Paper |
scientific article; zbMATH DE number 7829261 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Strong-Diameter Network Decomposition
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The energy complexity of diameter and minimum cut computation in bounded-genus networks
Theoretical Computer Science | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7788509 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
The energy complexity of diameter and minimum cut computation in bounded-genus networks
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| The complexity landscape of distributed locally checkable problems on trees | 2023-11-02 | Paper |
| Brief announcement: Distributed graph problems through an automata-theoretic lens | 2023-11-02 | Paper |
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Locally checkable problems in rooted trees
Distributed Computing | 2023-09-11 | Paper |
Distributed graph problems through an automata-theoretic lens
Theoretical Computer Science | 2023-03-10 | Paper |
scientific article; zbMATH DE number 7650919 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
Journal of the ACM | 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
(available as arXiv preprint) | 2022-03-22 | Paper |
| On Homomorphism Graphs | 2021-11-05 | Paper |
The Energy Complexity of BFS in Radio Networks
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Improved distributed expander decomposition and nearly optimal triangle enumeration
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Distributed (+1)-coloring via ultrafast graph shattering
SIAM Journal on Computing | 2020-05-28 | Paper |
Distributed edge coloring and a special case of the constructive Lovász local lemma
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Exponential Separations in the Energy Complexity of Leader Election
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Distributed triangle detection via expander decomposition
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The energy complexity of broadcast
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
An optimal distributed (+1)-coloring algorithm?
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
An exponential separation between randomized and deterministic complexity in the LOCAL model
SIAM Journal on Computing | 2019-02-08 | Paper |
Hardness of RNA folding problem with four symbols
Theoretical Computer Science | 2019-01-18 | Paper |
Hardness of RNA folding problem with four symbols
Theoretical Computer Science | 2019-01-18 | Paper |
A time hierarchy theorem for the LOCAL model
SIAM Journal on Computing | 2019-01-14 | Paper |
| On bend-minimized orthogonal drawings of planar 3-graphs | 2018-08-13 | Paper |
| scientific article; zbMATH DE number 6850477 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850477 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
| Hardness of RNA folding problem with four symbols | 2017-10-17 | Paper |
Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Exponential separations in the energy complexity of leader election
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
On orthogonally convex drawings of plane graphs
Computational Geometry | 2017-06-29 | Paper |
Area-universal drawings of biconnected outerplane graphs
Information Processing Letters | 2016-11-23 | Paper |
Unfolding orthogonal polyhedra with linear refinement
Algorithms and Computation | 2016-01-11 | Paper |
Constrained floorplans in 2D and 3D
Theoretical Computer Science | 2015-12-11 | Paper |
A new approach for contact graph representations and its applications
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Rectilinear duals using monotone staircase polygons
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
On orthogonally convex drawings of plane graphs (extended abstract)
Graph Drawing | 2013-12-20 | Paper |
