The local detection paradigm and its applications to self-stabilization, Theoretical Computer Science, vol.186, issue.1-2, pp.199-229, 1997. ,
Distributed Domination on Graph Classes of Bounded Expansion, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pp.143-151, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01918187
Distributed dominating set approximations beyond planar graphs, ACM Trans. Algorithms, vol.15, issue.3, 2019. ,
A new distributed Depth-First-Search algorithm, Information Processing Letters, vol.20, issue.3, pp.147-150, 1985. ,
Self-stabilization by local checking and correction, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.268-277 ,
What can be verified locally?, Journal of Computer and System Sciences, vol.97, issue.13, pp.106-120, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01964764
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs, ACM Transactions on Algorithms, vol.15, issue.2, pp.1-38, 2019. ,
Trade-offs in distributed interactive proofs, 33rd International Symposium on Distributed Computing (DISC), vol.146, pp.1-13, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02433529
Distributed Approximation Algorithms for Planar Graphs, Lecture Notes in Computer Science, pp.296-307, 2006. ,
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs, Lecture Notes in Computer Science, pp.49-59, 2014. ,
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs, Theoretical Computer Science, vol.662, pp.1-8, 2017. ,
Distributed packing in planar graphs, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08, pp.55-61, 2008. ,
Fast Distributed Approximations in Planar Graphs, Lecture Notes in Computer Science, pp.78-92 ,
A characterization of planar graphs by trémaux orders, Combinatorica, vol.5, issue.2, pp.127-135, 1985. ,
Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017. ,
Carsten Streb, Angewandte Chemie International Edition, vol.58, issue.37, pp.12747-12747, 2019. ,
Bibliography of distributed approximation beyonf bounded degree. CoRR, abs, 2001. ,
Redundancy in distributed proofs, Distributed Computing, vol.119, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-01964771
Automata, Languages, and Programming, 43rd International Colloquium on Automata, Languages and Programming (ICALP), vol.118, p.15, 2014. ,
Redundancy in distributed proofs, Distributed Computing, vol.24, pp.1-24, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-01964771
Redundancy in distributed proofs, Distributed Computing, vol.121, pp.1-25, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-01964771
Towards a complexity theory for local distributed computing, Journal of the ACM, vol.60, issue.5, pp.1-26, 2013. ,
On Distributed Merlin-Arthur Decision Protocols, Structural Information and Communication Complexity, vol.11639, pp.230-245, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02433519
, , 2019.
Randomized proof-labeling schemes, Distributed Computing, vol.32, issue.3, pp.217-234, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01247352
An Upper Bound on Zarankiewicz' Problem, Combinatorics, Probability and Computing, vol.5, issue.1, pp.29-33, 1996. ,
Distributed Algorithms for Planar Networks I, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, pp.29-38, 2016. ,
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.202-219, 2015. ,
Distributed Algorithms for Planar Networks I, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, vol.21, pp.1-21, 2016. ,
Locally checkable proofs, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11, vol.12, pp.1-33, 2011. ,
Brief announcement, Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14, pp.344-346, 2014. ,
Efficient Planarity Testing, Journal of the ACM, vol.21, issue.4, pp.549-568, 1974. ,
Fast and lean self-stabilizing asynchronous protocols, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.226-239 ,
Interactive Distributed Proofs, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp.255-264, 2018. ,
Proof labeling schemes, Distributed Computing, vol.22, issue.4, pp.215-233, 2010. ,
What cannot be computed locally!, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04, pp.300-309, 2004. ,
What can be approximated locally?, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08, pp.46-54, 2008. ,
Distributed minimum dominating set approximations in restricted families of graphs, Distributed Computing, vol.26, issue.2, pp.119-137, 2013. ,
The Power of Distributed Verifiers in Interactive Proofs, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1096-115, 2020. ,
Distributed Computing: A Locality-Sensitive Approach, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000. ,
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction, SIAM Journal on Computing, vol.30, issue.5, pp.1427-1442, 2000. ,
Fast approximation algorithms for the diameter and radius of sparse graphs, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13, pp.515-524, 2013. ,
Distributed Verification and Hardness of Distributed Approximation, SIAM Journal on Computing, vol.41, issue.5, pp.1235-1265, 2012. ,
Toward a theory of crossing numbers, Journal of Combinatorial Theory, vol.8, issue.1, pp.45-53, 1970. ,
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs, Information Processing Letters, vol.114, issue.3, pp.94-98, 2014. ,