暂无分享,去创建一个
Nicolas Bousquet | Laurent Feuilloley | Th'eo Pierron | N. Bousquet | Laurent Feuilloley | Théo Pierron
[1] Roberto Tamassia,et al. Incremental Planarity Testing (Extended Abstract) , 1989, IEEE Annual Symposium on Foundations of Computer Science.
[2] Pierre Fraigniaud,et al. Survey of Distributed Decision , 2016, Bull. EATCS.
[3] Pierre Fraigniaud,et al. Local Certification of Graphs with Bounded Genus , 2020, Discret. Appl. Math..
[4] Mika Göös,et al. Locally Checkable Proofs in Distributed Computing , 2016, Theory Comput..
[5] Bernhard Haeupler,et al. Minor Excluded Network Families Admit Fast Distributed Algorithms , 2018, PODC.
[6] Shay Kutten,et al. Proof labeling schemes , 2005, PODC '05.
[7] H. Whitney. Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.
[8] Eldar Fischer,et al. Fast Distributed Algorithms for Testing Graph Properties , 2016, DISC.
[9] Shoichi Tsuchiya,et al. A Characterization of K2, 4-Minor-Free Graphs , 2014, SIAM J. Discret. Math..
[10] M. Ellingham,et al. A characterization of $K_{2,4}$-minor-free graphs , 2014 .
[11] Moti Yung,et al. Memory-Efficient Self Stabilizing Protocols for General Networks , 1990, WDAG.
[12] Bernhard Haeupler,et al. Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs , 2016, DISC.
[13] H. Robbins. A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .
[14] K. Censor-Hillel,et al. Fast distributed algorithms for testing graph properties , 2016, Distributed Computing.
[15] Pedro Montealegre-Barba,et al. Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs , 2020, SSS.
[16] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[17] Bernhard Haeupler,et al. Low-Congestion Shortcuts for Graphs Excluding Dense Minors , 2020, PODC.
[18] Markus Chimani,et al. Cut Polytopes of Minor-free Graphs , 2019, ArXiv.
[19] Shlomi Dolev,et al. Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..
[20] Bernhard Haeupler,et al. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut , 2016, SODA.
[21] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.
[22] A. M. Murray. The strong perfect graph theorem , 2019, 100 Years of Math Milestones.
[23] L. F. Mondsheim. Combinatorical ordering and the geometric embedding of graphs , 1971, Technical note.
[24] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .
[25] Jens M. Schmidt. Mondshein Sequences (a.k.a. (2, 1)-Orders) , 2013, SIAM J. Comput..
[26] Paola Flocchini,et al. Routing in Series Parallel Networks , 2003, Theory of Computing Systems.
[27] François Le Gall,et al. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs , 2021, DISC.
[28] Boaz Patt-Shamir,et al. Distributed discovery of large near-cliques , 2009, PODC '09.
[29] Ami Paz,et al. Approximate Proof-Labeling Schemes , 2017, SIROCCO.
[30] David Eppstein,et al. Parallel Recognition of Series-Parallel Graphs , 1992, Inf. Comput..
[31] S. N. Maheshwari,et al. Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.
[32] Laurent Feuilloley. Introduction to local certification , 2021, Discrete Mathematics & Theoretical Computer Science.
[33] A. Kostochka. The minimum Hadwiger number for graphs with a given mean degree of vertices , 1982 .
[34] Louis Esperet,et al. Local certification of graphs on surfaces , 2021, Theor. Comput. Sci..
[35] Pierre Fraigniaud,et al. Compact Distributed Certification of Planar Graphs , 2020, Algorithmica.
[36] Pierre Fraigniaud,et al. Distributed Detection of Cycles , 2017, SPAA.