Y. Afek, S. Kutten, and M. Yung, The local detection paradigm and its applications to self-stabilization, Theoretical Computer Science, vol.186, issue.1-2, pp.199-229, 1997.

S. Akhoondian-amiri, P. Ossona-de-mendez, R. Rabinovich, and S. Siebertz, 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

S. Saeed-akhoondian-amiri, S. Schmid, and . Siebertz, Distributed dominating set approximations beyond planar graphs, ACM Trans. Algorithms, vol.15, issue.3, 2019.

B. Awerbuch, A new distributed Depth-First-Search algorithm, Information Processing Letters, vol.20, issue.3, pp.147-150, 1985.

B. Awerbuch, B. Patt-shamir, and G. Varghese, Self-stabilization by local checking and correction, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.268-277

A. Balliu, G. D'angelo, P. Fraigniaud, and D. Olivetti, 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

S. Cabello, 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.

P. Crescenzi, P. Fraigniaud, and A. Paz, 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

A. Czygrinow, M. Ha??kowiak, and E. Szyma?ska, Distributed Approximation Algorithms for Planar Graphs, Lecture Notes in Computer Science, pp.296-307, 2006.

A. Czygrinow, M. Han?kowiak, E. Szyma?ska, W. Wawrzyniak, and M. Witkowski, Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs, Lecture Notes in Computer Science, pp.49-59, 2014.

A. Czygrinow, M. Han?kowiak, E. Szyma?ska, W. Wawrzyniak, and M. Witkowski, Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs, Theoretical Computer Science, vol.662, pp.1-8, 2017.

A. Czygrinow, M. Ha?ckowiak, and W. Wawrzyniak, Distributed packing in planar graphs, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08, pp.55-61, 2008.

A. Czygrinow, M. Ha??kowiak, and W. Wawrzyniak, Fast Distributed Approximations in Planar Graphs, Lecture Notes in Computer Science, pp.78-92

F. Hubert-de and P. Rosenstiehl, A characterization of planar graphs by trémaux orders, Combinatorica, vol.5, issue.2, pp.127-135, 1985.

R. Diestel, Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017.

L. Feuilloley, Carsten Streb, Angewandte Chemie International Edition, vol.58, issue.37, pp.12747-12747, 2019.

L. Feuilloley, Bibliography of distributed approximation beyonf bounded degree. CoRR, abs, 2001.

L. Feuilloley, P. Fraigniaud, J. Hirvonen, A. Paz, and M. Perry, Redundancy in distributed proofs, Distributed Computing, vol.119, 2020.
URL : https://hal.archives-ouvertes.fr/hal-01964771

L. Feuilloley, P. Fraigniaud, and J. Hirvonen, Automata, Languages, and Programming, 43rd International Colloquium on Automata, Languages and Programming (ICALP), vol.118, p.15, 2014.

L. Feuilloley, P. Fraigniaud, J. Hirvonen, A. Paz, and M. Perry, Redundancy in distributed proofs, Distributed Computing, vol.24, pp.1-24, 2020.
URL : https://hal.archives-ouvertes.fr/hal-01964771

L. Feuilloley, P. Fraigniaud, J. Hirvonen, A. Paz, and M. Perry, Redundancy in distributed proofs, Distributed Computing, vol.121, pp.1-25, 2020.
URL : https://hal.archives-ouvertes.fr/hal-01964771

P. Fraigniaud, A. Korman, and D. Peleg, Towards a complexity theory for local distributed computing, Journal of the ACM, vol.60, issue.5, pp.1-26, 2013.

P. Fraigniaud, P. Montealegre, R. Oshman, I. Rapaport, and I. Todinca, 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

. Springer, , 2019.

P. Fraigniaud, B. Patt-shamir, and M. Perry, Randomized proof-labeling schemes, Distributed Computing, vol.32, issue.3, pp.217-234, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01247352

Z. Füredi, An Upper Bound on Zarankiewicz' Problem, Combinatorics, Probability and Computing, vol.5, issue.1, pp.29-33, 1996.

M. Ghaffari and B. Haeupler, Distributed Algorithms for Planar Networks I, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, pp.29-38, 2016.

M. Ghaffari and B. Haeupler, 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.

M. Ghaffari and B. Haeupler, 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.

M. Göös and J. Suomela, 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.

M. Hilke, C. Lenzen, and J. Suomela, Brief announcement, Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14, pp.344-346, 2014.

J. E. Hopcroft and R. E. Tarjan, Efficient Planarity Testing, Journal of the ACM, vol.21, issue.4, pp.549-568, 1974.

G. Itkis and L. A. Levin, Fast and lean self-stabilizing asynchronous protocols, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.226-239

G. Kol, R. Oshman, and R. R. Saxena, Interactive Distributed Proofs, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp.255-264, 2018.

A. Korman, S. Kutten, and D. Peleg, Proof labeling schemes, Distributed Computing, vol.22, issue.4, pp.215-233, 2010.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally!, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04, pp.300-309, 2004.

C. Lenzen, Y. A. Oswald, and R. Wattenhofer, What can be approximated locally?, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08, pp.46-54, 2008.

C. Lenzen, Y. A. Pignolet, and R. Wattenhofer, Distributed minimum dominating set approximations in restricted families of graphs, Distributed Computing, vol.26, issue.2, pp.119-137, 2013.

M. Naor, M. Parte, and E. Yogev, The Power of Distributed Verifiers in Interactive Proofs, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1096-115, 2020.

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.

D. Peleg and V. Rubinovich, 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.

L. Roditty and V. Vassilevska-williams, 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.

A. D. Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai et al., Distributed Verification and Hardness of Distributed Approximation, SIAM Journal on Computing, vol.41, issue.5, pp.1235-1265, 2012.

W. T. Tutte, Toward a theory of crossing numbers, Journal of Combinatorial Theory, vol.8, issue.1, pp.45-53, 1970.

W. Wawrzyniak, 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.