{"id":2304,"date":"2024-04-17T15:16:03","date_gmt":"2024-04-17T13:16:03","guid":{"rendered":"https:\/\/perso.lirmm.fr\/christophe-paul\/?page_id=2304"},"modified":"2024-08-19T10:31:28","modified_gmt":"2024-08-19T08:31:28","slug":"conference-papers","status":"publish","type":"page","link":"https:\/\/www.lirmm.fr\/christophe-paul\/conference-papers\/","title":{"rendered":"Conference papers"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Conference papers<\/strong><\/h4>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

[C59] <\/strong>C. Paul, E. Protopapas, D.M. Thilikos and S. Wiederrecht. Obstructions to Erd\u00f6s-Posa dualities for minors. In IEEE Symposium on Foundations of Computer Science – FOCS<\/strong>. 2024, to appear.<\/em><\/span><\/p>\n

[C58] <\/strong>C. Paul, E. Protopapas, D.M. Thilikos and S. Wiederrecht. <\/span>Delineating Half-Integrality of the Erd\u0151s-P\u00f3sa Property for Minors: the Case of Surfaces. In  International Colloquium on Automata, Logic and Programming \u2013 ICALP<\/em><\/strong>. Number 297 of Leibnitz International Proceedings in Informatics<\/em>, pages 35:1-35:20, 2024.<\/p>\n

[C57] <\/strong>C. Paul, <\/span>E. Protopapas. <\/span>Tree-Layout Based Graph Classes: Proper Chordal Graphs. In <\/span>International Symposium on Theoretical Aspects of Computer Science – STACS<\/em><\/strong>. Number 289 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 55:1-55:18, 2024.<\/span><\/p>\n

[C56]<\/strong> S. H\u00f8gemo<\/span>, <\/span>B. Bergougnoux<\/span>, <\/span>U. Brandes<\/span>, <\/span>C. Paul<\/span>, <\/span>J.A. Telle. <\/span>On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters.<\/span> In <\/span>International Symposium Fundamentals of Computation Theory – FCT<\/em><\/strong>. Number 12867 of <\/span>Lecture Notes in Computer Science<\/em>, pages 287-300, 2021.<\/span><\/span><\/p>\n

[C55] <\/strong>M.M.<\/span> Kant\u00e9<\/span>, C. Paul, <\/span>D.M. Thilikos. <\/span>A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. In <\/span>Annual European Symposium on Algorithms – <\/em>ESA<\/em><\/strong>. Number 173 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, pages 64:1-64:16, 2020.<\/span><\/p>\n

[C54] <\/strong>S. H\u00f8gemo<\/span>, C. Paul, J.A.<\/span> Telle. <\/span>Hierarchical Clusterings of Unweighted Graphs. In <\/span>International Symposium on Mathematical Foundations of Computer Science – <\/em>MFCS<\/em>.<\/strong> Number 173 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, pages 47:1-47:13, 2020.<\/span><\/p>\n

[C53] <\/strong>I. Adler<\/span>, C. Paul, <\/span>D.M. Thilikos. <\/span>Connected Search for a Lazy Robber. In <\/span>IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science – <\/em>FSTTCS.<\/em><\/strong>  Number 150 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 7:1-7:14, 2019.<\/span><\/p>\n

[C52] <\/strong>J. Baste, D. G\u00f6z\u00fcpek, C. Paul, I. Sau, M. Shalom and D.M. Thilikos. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. In <\/span>International Symposium on Parameterized and Exact Computation – IPEC<\/em>.<\/strong> Number 89 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 3:1-3:12, 2017.<\/span><\/p>\n

[C51] <\/strong>F. Barbero, C. Paul and M. Pilipczuk. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. In <\/span>International Colloquim on Automata, Languages, and Programming – ICALP<\/em><\/strong>. Number 80 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 70:1-70:13, 2017.<\/span><\/p>\n

[C50]<\/strong> M. Jones, C. Paul and C. Scornavacca. On the consistency of orthology relationships. In <\/span>RECOMB Comparative Genomics Satellite Workshop \u2013 RECOMB-CG<\/strong>. In <\/span>BMC Bionformatics<\/strong>, 17(S-14) :251-262, 2016.<\/span><\/p>\n

[C49] <\/strong>D. G\u00f6z\u00fcpek, S. \u00d6zkan, C. Paul, I. Sau, M. Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. In <\/span>International Workshop on Graph Theoretical Concepts in Computer Science – WG<\/strong><\/em>. Number 9941 of <\/span>Lecture Notes in Computer Science <\/em>, page 195-206, 2016.<\/span><\/p>\n

[C48] <\/strong>J. Baste, C. Paul, I. Sau and C. Scornavacca. Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. In <\/span>International Conference on Algorithmic Aspects in Information and Management – AAIM<\/em>.<\/strong> Number 9778 of <\/span>Lecture Notes in Computer Science <\/em>, page 53-64, 2016.<\/span><\/p>\n

[C47] <\/strong>S. Bessy, M. Bougeret, D. Gon\u00e7alves and C. Paul. <\/span>On independent set on B1-EPG graphs. Workshop on Approximation and Online Algorithms – WAOA<\/em><\/strong>. Number 9499 of <\/span>Lecture Notes in Computer Science <\/em>, page 158-169, 2015.<\/span><\/p>\n

[C46] <\/strong>E.J. Kim, M. Kant\u00e9, O.J. Kwon and C. Paul. An FPT algorithm and a polynomial kernel for Linear Rankwidth One Vertex Deletion. <\/span>International Symposium on Parameterized and Exact Computation – IPEC<\/em><\/strong>. Number 43 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 138-150, 2015.<\/span><\/p>\n

[C45] <\/strong>E.J. Kim, C. Paul, I. Sau and D.M. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. In <\/span>International Symposium on Parameterized and Exact Computation – IPEC<\/em><\/strong>. Number 43 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 78-89, 2015.<\/span><\/p>\n

[C44] <\/strong>E.J. Kim, S.I. Oum, C. Paul, I. Sau and D.M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. In <\/span>Workshop on Approximation and Online Algorithms – WAOA<\/em><\/strong>. Number 9499 of <\/span>Lecture Notes in Computer Science <\/em>, page 35-46, 2015.<\/span><\/p>\n

[C43] <\/strong>N. Cohen, D. Gon\u00e7alves, E.J.Kim, C. Paul, I. Sau, D.M. Thilikos and M. Weller. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. In<\/span> International workshop on Graph Theoretical Concepts in Computer Science – WG<\/em><\/strong>. Number 8747 of <\/span>Lecture Notes in Computer Science <\/em>, page 201-213, 2015.<\/span><\/p>\n

[C42] <\/strong>P. Golovach, P. Heggernes, P. Van\u2019t Hof and C. Paul. Hadwiger Number of Graphs with Small Chordality. In <\/span>Workshop on Approximation and Online Algorithms – WAOA<\/em><\/strong>. Number 9499 of <\/span>Lecture Notes in Computer Science <\/em>, page 158-169, 2014.<\/span><\/p>\n

[C41] <\/strong>V. Garnero, C. Paul, I. Sau, and D.M. Thilikos. Explicit linear kernels via dynamic programming. In <\/span>Symposium on Theoretical Aspect of Computer Science – STACS<\/em><\/strong>. Number 25 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 312-324, 2014.<\/span><\/p>\n

[C40] <\/strong>E.J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. In <\/span>International Colloquim on Automata, Languages, and Programming – ICALP<\/em><\/strong>. Number 7965 of <\/span>Lecture Notes in Computer Science <\/em>, page 613-624, 2013.<\/span><\/p>\n

[C39] <\/strong>N. Bousquet, G. Mertzios, C. Paul, I. Sau and S. Thomass\u00e9. Parameterized domination in circle graphs. In <\/span>International Workshop on Graph Theoretical Concepts in Computer Science – WG<\/em><\/strong>. Number 7551 of <\/span>Lecture Notes in Computer Science <\/em>, page 308-319, 2012.<\/span><\/p>\n

[C38] <\/strong>E.J. Kim, C. Paul and G. Philip. Parameterized K4-cover in single exponential time. In <\/span>Scandinavian Workshop On Algorithmic Theory – SWAT<\/em><\/strong>. Number 7357 of <\/span>Lecture Notes in Computer Science <\/em>, page 119-130, 2012.<\/span><\/p>\n

[C37] <\/strong>P. Heggernes, P. van’t Hof, D. Lokshtanov and C. Paul. Obtaining a bipartite graph by contracting few edges. In <\/span>IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science – FSTTCS<\/em><\/strong>. Number 13 of <\/span>Leibnitz International Proceedings in Informatics<\/em>, page 217-228, 2011<\/span><\/p>\n

[C36] <\/strong>P. Heggernes, P. van’t Hof, B. L\u00e9v\u00eaque, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. In <\/span>International Symposium on Parameterized and exact Computation – IPEC<\/em><\/strong>. Number 7112 of <\/span>Lecture Notes in Computer Science <\/em>, page 55-66, 2011.<\/span><\/p>\n

[C35]<\/strong> P. Heggernes, P. van\u2019t Hof, B. L\u00e9v\u00eaque and C. Paul. Contracting chordal graphs and bipartite graphs to paths and trees.  In<\/span> Latin-American<\/em> Algorithms, Graphs, and Optimization Symposium \u2013 LAGOS<\/em><\/strong>,  <\/span>Electronic Notes in Discrete Mathematics<\/em>, 37:87-92, 2011.<\/span><\/p>\n

[C34] <\/strong>G. Joret, C. Paul, I. Sau, S. Saurabh and S. Thomass\u00e9. Hitting and harvesting pumpkins. In <\/span>European Symposium on Algorithms – ESA<\/em><\/strong>. Number 6942 of <\/span>Lecture Notes in Computer Science <\/em>, page 394-407, 2011.<\/span><\/p>\n

[C33] <\/strong>C. Paul, A. Perez and S. Thomass\u00e9. Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem. In <\/span>Mathematical Foundations of Computer Science – MFCS<\/em><\/strong>. Number 6907 of <\/span>Lecture Notes in Computer Science <\/em>, page 497-507, 2011.<\/span><\/p>\n

[C32]<\/strong> S. Guillemot, C. Paul and A. Perez. On the (non-)existence of polynomial kernels for P<\/span>l<\/small> -free edge modi\ufb01cation problems. In <\/span>International Symposium on Parameterized and Exact Computation – IPEC<\/em><\/strong>. Number 6478 in Lecture Notes in Computer Science, pages 147-157, 2010.<\/span><\/p>\n

[C31] <\/strong>M. Fellows, P. Giannopoulos, C. Knauer, C. Paul, F. Rosamond, S. Whitesides and  N. Yu. Milling a graph with turn costs : a parameterized complexity perspective. In <\/span>International workshop on <\/em>Graph Theoretical Concepts in Computer Science – WG<\/em><\/strong>. Number 6410 in <\/span>Lecture Notes in Computer Science<\/em>, pages 123-134, 2010. <\/span><\/p>\n

[C30] <\/strong>P. Heggernes, D. Lokshtanov, J. Nederlof, C. Paul and J.A. Telle. Generalized graph clustering : recognizing (p,q)-cluster. In <\/span>International workshop on <\/em>Graph Theoretical Concepts in Computer Science – WG<\/em>.<\/strong> Number 6410 in <\/span>Lecture Notes in Computer Science<\/em>, pages 171-183, 2010.<\/span><\/p>\n

[C29] <\/strong>S. Bessy and F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomass\u00e9. Kernels for Feedback Arc Set In Tournaments. In <\/span>International Workshop On Combinatorial Algorithms – FSTTCS<\/em><\/strong>. Number 4 in <\/span>Leibnitz International Proceedings in Informatics<\/em>, pages 37-47, 2009. <\/span><\/p>\n

[C28] <\/strong>S. Bessy and C. Paul and A. Perez. Polynomial kernels for 3-leaf power graph modi\ufb01cation problems. In <\/span>International Workshop On Combinatorial Algorithms – IWOCA<\/em><\/strong>. Number 5874 in <\/span>Lecture Notes in Computer Science<\/em>, pages 72-80, 2009.<\/span> <\/strong><\/p>\n

[C27] <\/strong>P. Gambette, V. Berry and C. Paul. The structure of level-k phylogenetic networks. In <\/span>Annual Symposium on Combinatorial Pattern Matching – CPM<\/em><\/strong>. Number 5577 in <\/span>Lecture Notes in Computer Science<\/em>, pages 289-300, 2009. <\/span><\/p>\n

[C26] <\/strong>S. B\u00e9rard, A. Chateau, C. Chauve, C. Paul and E. Tannier. Perfect DCJ rearrangement. In <\/span>Annual RECOMB Satellite Workshop on Comparative Genomic – RECOMB-CG<\/em><\/strong>. Number 5267 in <\/span>Lecture Notes in Bioinformatics<\/em>, pages 156-167, 2008. <\/span><\/p>\n

[C25] <\/strong>D. Bremner, J. Lenchner, G. Liotta, C. Paul, M. Pouget, S. Stolpner, S. Wismath. A note on \u03b1-drawable k-trees. In <\/span>Canadian Conference on Computational Geometry – CCCG<\/em><\/strong>. 2008. <\/span><\/p>\n

[C24] <\/strong>M. Tedder, D. Corneil, M. Habib and C. Paul. Simple, linear-time modular decomposition. <\/span>In International Colloquium on Automata, Languages and Programming – ICALP<\/strong><\/em>. Number 5125 in <\/span>Lecture Notes in Computer Science<\/em>, pages 634-645, 2008.<\/span><\/p>\n

[C23] <\/strong>E. Gioan and C. Paul. Dynamic distance hereditary graphs using split decomposition. In <\/span>International Symposium on Algorithms and Computation <\/em>– ISAAC<\/em><\/strong>, number 4835 in <\/span>Lecture Notes in Computer Science<\/em>, pages 41-51, 2007.<\/span><\/p>\n

[C22] <\/strong>S. Durocher and C. Paul. Kinetic maintenance of mobile k-centre in trees. In <\/span>International Symposium on Algorithms and Computation<\/em> – ISAAC<\/em><\/strong>, number 4825 in <\/span>Lecture Notes in Computer Science<\/em>, pages 341-352, 2007.<\/span><\/p>\n

[C21] <\/strong>P. Heggerness, C. Paul,  J.A. Telle and Y. Villanger. Interval completion with few edges. In <\/span>ACM Symposium on Theory of Computing – STOC<\/em><\/strong>, pages 347-381, 2007.<\/span><\/p>\n

[C20] <\/strong>C. Paul, A. Proskurowski and J.A. Telle. Algorithmic generation of graphs of branchwidth <= k. In <\/span>International Workshop on Graph Theoretical Concepts in Computer Science – WG<\/em><\/strong>, number 4271 in <\/span>Lecture Notes in Computer Science<\/em>, pages 206-216, 2006.<\/span><\/p>\n

[C19]<\/strong> C. Paul, <\/span>J.A. Telle. <\/span>Edge-maximal graphs of branchwidth k. In <\/span>International Colloquium on Graph Theory \u2013 ICGT<\/strong><\/em>. <\/span>Electronic Notes in Discrete Mathematics, <\/em>22: 363-368, 2005.<\/span><\/p>\n

[C18] <\/strong>B.M. Bui Xuan, M. Habib and C. Paul. Revisiting Uno and Yagiura’s Algorithm. In<\/span> International Symposium on Algorithms and Computation- ISAAC<\/strong><\/em>, number 3827 in <\/span>Lecture Notes in Computer Science<\/em>, pages 146–155, 2005.<\/span><\/p>\n

[C17] <\/strong>C. Paul and J.A. Telle. New Tools and Simpler Algorithms for Branchwidth. In <\/span>European Symposium on Algorithms – ESA<\/em><\/strong>, number 3669 in <\/span>Lecture Notes in Computer Science<\/em>, pages 379-390, 2005.<\/span><\/p>\n

[C16] <\/strong>A. Bergeron, S. B\u00e9rard, C. Chauve and C. Paul. Perfect Sorting by Reversals is not Always Difficult. In <\/span>International Workshop on Algorithm in Bioinformatics – WABI<\/em><\/strong>, number 3692 in <\/span>Lecture Notes in Computer Science<\/em>, pages 228-238, 2005.<\/span><\/p>\n

[C15] <\/strong>V. Berry, S. Guillemot, F. Nicolas and C. Paul. On the Approximation of Computing Evolutionary Trees. In <\/span>International Computing and Combinatorics Conference – COCOON<\/em><\/strong>, number 3595 in <\/span>Lecture Notes in Computer Science<\/em>, pages 115-125, 2005.<\/span><\/p>\n

[C14] <\/strong>C. Crespelle and C. Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. In<\/span> International Workshop on Graph Theoretical Concepts in Computer Science- WG<\/strong><\/em>, number 3787 in <\/span>Lecture Notes in Computer Science<\/em>, pages 38-48, 2005.<\/span><\/p>\n

[C13] <\/strong>M. Habib, F. de Montgolfier and C. Paul. A simple linear-time modular decomposition algorithm. In <\/span> Scandinavian Workshop on Algorithm Theory – SWAT<\/strong><\/em>,<\/strong> number 3111 in <\/span>Lecture Notes in Computer Science<\/em>, pages 187-198, 2004.<\/span><\/p>\n

[C12] <\/strong>M. Habib, C. Paul and M. Raffinot. Common connected Components of Interval Graphs. In <\/span>Annual Combinatorial Pattern Matching Symposium – CPM<\/em><\/strong>, number 3109 in <\/span>Lecture Notes in Computer Science<\/em>, pages 347-358, 2004.<\/span><\/p>\n

[C11] <\/strong>C. Crespelle and C. Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. In <\/span>International Workshop on Graph Theoretical Concepts in Computer Science – WG<\/em><\/strong>, number 3353 in <\/span>Lecture Notes in Computer Science<\/em>, pages 93-104, 2004.<\/span><\/p>\n

[C10] <\/strong>P. Fraigniaud, C. Gavoille and C. Paul. Eclecticism Shrinks Even Small World. In <\/span>Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing – PODC<\/em><\/strong>,<\/em> pages 168-178, 2004.<\/span><\/p>\n

[C9] <\/strong>C. Gavoille and C. Paul. Optimal Distance Labeling Scheme for Interval and Circular-arc Graphs. <\/span>In Annual European Symposium on Algorithms – ESA<\/em><\/strong>, number 2832 in <\/span>Lecture Notes in Computer Science<\/em>, pages 254-265, 2003.<\/span><\/p>\n

[C8] <\/strong>A. Bretscher and D.G. Corneil and M. Habib and C. Paul. A Simple Linear Time LexBFS Cograph Recognition Algorithm. In <\/span>International Workshop on Graph-Theoretic Concepts in Computer Science – ESA<\/em><\/strong>, number 2880 in <\/span>Lecture Notes in Computer Science<\/em>, pages 119-130, 2003. <\/span><\/p>\n

[C7] <\/strong>M. Bouklit and D. Coudert and J.-F. Lalande and C. Paul and H. Rivano. Approximate multicommodity flow for WDM networks design. In <\/span>International Colloquium on Structural Information Complexity – SIROCCO<\/em><\/strong>, number 17 of <\/span>Proceedings in Informatics<\/em>, Carleton Scientific, pages 43-56,  2003.<\/span><\/p>\n

[C6] <\/strong>Gavoille, M. Katz, N. Katz, C. Paul, and D. Peleg. Approximate distance labeling scheme. In <\/span>Annual European Symposium on Algorithms – ESA<\/em><\/strong>, number 2161 in <\/span>Lecture Notes in Computer Science<\/em>, pages 476-487. 9th , 2001.<\/span><\/p>\n

[C5]<\/strong> C. Gavoille<\/span>, C. Paul. Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. In <\/span>Euroconference on Combinatorics, Graph Theory and Applications \u2013 EuroComb<\/strong><\/em>. <\/span>Electronic Notes in Discrete Mathematics<\/em>, 10:117-120, 2001.<\/span><\/p>\n

[C4]<\/strong> C. Gavoille<\/span>, C. Paul. Approximate Distance Labeling Schemes. In <\/span>International Conference on Graph Theory \u2013 ICGT<\/em><\/strong>. <\/span>Electronic Notes in Discrete Mathematics<\/em>, 5: 134-137, 2000.<\/span><\/p>\n

[C3] <\/strong>D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. <\/span>International Workshop Graph-Theoretic Concepts in Computer Science \u2013 WG<\/em><\/strong>, volume 1517 of <\/span>Lecture Notes in Computer Science<\/em>, pages 192-202, 1998.<\/span><\/p>\n

[C2]<\/strong>M. Habib, C. Paul, and L. Viennot. A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In <\/span>International Symposium on Theoretical Aspect of Computer Science \u2013 STACS,<\/em><\/strong> number 1373 in <\/span>Lecture Notes in Computer Science<\/em>, pages 25-38, 1998.<\/span><\/p>\n

[C1] <\/strong>P. Galinier, M. Habib, and C. Paul. Chordal graphs and their clique graph. In <\/span>International Workshop on Graph-Theoretic Concepts in Computer Science – WG<\/strong>,<\/em> volume 1017 of <\/span>Lecture Notes in Computer Science<\/em>, pages 358-371, 1995.<\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Conference papers [C59] C. Paul, E. Protopapas, D.M. Thilikos and S. Wiederrecht. Obstructions to Erd\u00f6s-Posa dualities for minors. In IEEE Symposium on Foundations of Computer Science – FOCS.…<\/p>\n","protected":false},"author":34,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"elementor_header_footer","meta":{"_crdt_document":"","_uag_custom_page_level_css":"","footnotes":""},"class_list":["post-2304","page","type-page","status-publish","hentry"],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false},"uagb_author_info":{"display_name":"Christophe PAUL","author_link":"https:\/\/www.lirmm.fr\/christophe-paul\/author\/christophe-paul\/"},"uagb_comment_info":0,"uagb_excerpt":"Conference papers [C59] C. Paul, E. Protopapas, D.M. Thilikos and S. Wiederrecht. Obstructions to Erd\u00f6s-Posa dualities for minors. In IEEE Symposium on Foundations of Computer Science – FOCS.…","_links":{"self":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/pages\/2304","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/users\/34"}],"replies":[{"embeddable":true,"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/comments?post=2304"}],"version-history":[{"count":0,"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/pages\/2304\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/media?parent=2304"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}