| Publication | Date of Publication | Type |
|---|
Renaming in distributed certification
Theoretical Computer Science | 2025-12-12 | Paper |
Decreasing verification radius in local certification
Theoretical Computer Science | 2025-11-10 | Paper |
| Local certification of local properties: tight bounds, trade-offs and new parameters | 2025-11-10 | Paper |
Local certification of local properties: tight bounds, trade-offs, and new parameters
SIAM Journal on Discrete Mathematics | 2025-10-10 | Paper |
| Brief announcement: Global certification via perfect hashing | 2025-06-13 | Paper |
When should you wait before updating? -- Toward a robustness refinement
Theoretical Computer Science | 2025-05-04 | Paper |
Short and local transformations between ( +1)-colorings
Innovations in Graph Theory | 2025-04-07 | Paper |
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
scientific article; zbMATH DE number 7832760 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
scientific article; zbMATH DE number 7832765 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-15 | Paper |
| Local Certification of Graph Decompositions and Applications to Minor-Free Classes | 2024-04-15 | Paper |
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7788460 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7774300 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
A lower bound for constant-size local certification
Theoretical Computer Science | 2023-08-18 | Paper |
Lower bound for constant-size local certification
Lecture Notes in Computer Science | 2023-06-12 | Paper |
| Silent MST Approximation for Tiny Memory | 2023-03-21 | Paper |
| Error-sensitive proof-labeling schemes | 2023-02-03 | Paper |
Local certification of graphs with bounded genus
Discrete Applied Mathematics | 2022-12-08 | Paper |
| Redundancy in distributed proofs | 2022-07-21 | Paper |
Local verification of global proofs
(available as arXiv preprint) | 2022-07-21 | Paper |
| Short and local transformations between ($\Delta+1$)-colorings | 2022-03-16 | Paper |
Introduction to local certification
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
Introduction to local certification
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
| Classifying grounded intersection graphs via ordered forbidden patterns | 2021-12-01 | Paper |
Compact distributed certification of planar graphs
Algorithmica | 2021-06-30 | Paper |
Redundancy in distributed proofs
Distributed Computing | 2021-05-17 | Paper |
Graph classes and forbidden patterns on three vertices
SIAM Journal on Discrete Mathematics | 2021-03-18 | Paper |
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
A hierarchy of local decision
Theoretical Computer Science | 2021-01-19 | Paper |
How long it takes for an ordinary node with an ordinary ID to output?
Theoretical Computer Science | 2020-02-13 | Paper |
Lower bounds for text indexing with mismatches and differences
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Survey of distributed decision | 2019-07-03 | Paper |
Survey of distributed decision
(available as arXiv preprint) | 2019-07-03 | Paper |
Locally optimal load balancing
(available as arXiv preprint) | 2018-08-24 | Paper |
How long it takes for an ordinary node with an ordinary ID to output?
Lecture Notes in Computer Science | 2018-04-12 | Paper |
scientific article; zbMATH DE number 6820307 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry | 2015-04-16 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry | 2015-04-16 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
