{"id":39,"date":"2021-07-31T07:40:27","date_gmt":"2021-07-31T07:40:27","guid":{"rendered":"https:\/\/dimag.ibs.re.kr\/home\/cook\/?page_id=39"},"modified":"2025-10-20T08:19:45","modified_gmt":"2025-10-20T08:19:45","slug":"papers","status":"publish","type":"page","link":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/","title":{"rendered":"Papers"},"content":{"rendered":"\n<h2 class=\"wp-block-heading has-text-align-left\"><span style=\"text-decoration: underline\">Preprints:<\/span><\/h2>\n\n\n\n<h4 class=\"wp-block-heading has-text-align-center\"><span style=\"text-decoration: underline\">Graph Theory:<\/span><\/h4>\n\n\n\n<p><a href=\"https:\/\/arxiv.org\/pdf\/2510.15553\"><strong>Vu\u2019s conjecture holds for claw-free graphs<\/strong><\/a> (<em>with \u00a0<\/em>Ross J. Kang, Eileen Robinson, and Gabri\u00eblle Zwaneveld) October 2025. <\/p>\n\n\n\n<p><a href=\"https:\/\/arxiv.org\/abs\/2412.17735\"><strong>Colouring t-perfect graphs<\/strong> <\/a>(<em>with<\/em> Maria Chudnovsky, James Davies, Sang-il Oum, and Jane Tan) December 2024. <\/p>\n\n\n\n<h4 class=\"wp-block-heading has-text-align-center\"><span style=\"text-decoration: underline\">Distributed Computing:<\/span><\/h4>\n\n\n\n<p><a href=\"https:\/\/arxiv.org\/abs\/2402.12148\"><strong>Local certification of forbidden subgraphs<\/strong><\/a> (<em>with <\/em>Nicolas Bousquet, Laurent Feuilloley, Th\u00e9o Pierron, S\u00e9bastien Zeitoun) February 2024.<\/p>\n\n\n\n<h2 class=\"wp-block-heading has-text-align-left\" id=\"journal-papers\"><span style=\"text-decoration: underline\">Journal Papers:<\/span><\/h2>\n\n\n\n<p><strong><a href=\"https:\/\/doi.org\/10.1016\/j.jctb.2025.08.002\">Reuniting \u03c7-boundedness with polynomial \u03c7-boundedness<\/a> <\/strong>(<em>with <\/em>Maria Chudnovsky, James Davies, and Sang-il Oum), J<em>ournal of Combinatorics Series B<\/em>.<\/p>\n\n\n\n<p><a href=\"https:\/\/www.advancesincombinatorics.com\/article\/123814-on-polynomial-degree-boundedness\"><strong>On polynomial degree-boundedness<\/strong> <\/a>(<em>with<\/em> Romain Bourneuf, Romain Bourneuf,&nbsp;Matija Buci\u0107,&nbsp;James Davies) in Advances in Combinatorics, 2024.<\/p>\n\n\n\n<p><a href=\"https:\/\/arxiv.org\/abs\/2110.09970\"><strong>Graphs with all holes the same length<\/strong><\/a>&nbsp;(<em>with<\/em>&nbsp;Jake Horsfield, Myriam Preissmann, Cl\u00e9ophe\u00e9 Robin, Paul Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vu\u0161kovi\u0107)&nbsp;in <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895624000327\">J<em>ournal of Combinatorics Series B<\/em><\/a>, 62 pages, 2024. <\/p>\n\n\n\n<p><a href=\"https:\/\/arxiv.org\/pdf\/2302.12106.pdf\"><strong>On tree decompositions whose trees are minors<\/strong><\/a> (<em>with<\/em> Pablo Blanco,&nbsp;Meike Hatzel,&nbsp;Claire Hilaire,&nbsp;Freddie Illingworth,&nbsp;Rose McCarty) in&nbsp;<em>J. Graph Theory<\/em>, 11 pages, 2024.<\/p>\n\n\n\n<p><strong><a href=\"https:\/\/arxiv.org\/pdf\/2209.06171.pdf\">Proving a directed analogue of the Gy\u00e1rf\u00e1s-Sumner conjecture for orientations of&nbsp;P<\/a><a href=\"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v30i3p36\">4<\/a> <\/strong>(<em>with<\/em> Tom\u00e1\u0161 Masa\u0159\u00edk, Marcin Pilipczuk, Amadeus Reinald and U\u00e9verton S. Souza) in <em>Electronic Journal of Combinatorics<\/em>, Volume. 30, Issue 3, 24 pages, 2023.<\/p>\n\n\n\n<p><a href=\"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-content\/uploads\/sites\/14\/2022\/03\/longevenholes.pdf\"><strong>Detecting a long even hole<\/strong><\/a>&nbsp;(<em>with<\/em>&nbsp;Paul Seymour)&nbsp;<em>European Journal of Combinatorics, vol. 104, 32 pages<\/em>, <em>2022<\/em>.<\/p>\n\n\n\n<p><strong><a href=\"https:\/\/web.math.princeton.edu\/~mchudnov\/forks.pdf\">Excluding the fork and the antifork<\/a>&nbsp;<\/strong>(<em>with&nbsp;<\/em>Maria Chudnovsky and Paul Seymour)&nbsp;<em>Discrete Mathematics vol. 343.5, 18 pages, 2020<\/em>.<em>(Awarded Editor\u2019s Choice)<\/em>. <\/p>\n\n\n\n<p><strong><a href=\"https:\/\/doi.org\/10.1126\/sciadv.abj3984\">Quantifying Structural Relationships of Metal Binding Sites Suggests Origins of Biological Electron Transfer<\/a> <\/strong>(Yana Bromberg, Ariel Aptekmann, Yannick Mahlich,&nbsp;Linda Cook, Stefan Senn, Maximilian Miller, Vikas Nanda, Diego Ferreiro, and Paul Falkowski) in <em>Science Advances<\/em>, Volume 8, Issue 2, January 2022. (Note: <em>Science Advances<\/em> is an open access journal from the publisher of the journal <em>Science<\/em>.)<\/p>\n\n\n\n<h2 class=\"wp-block-heading has-text-align-left\" id=\"conference-papers\"><span style=\"text-decoration: underline\">Refereed Conference Papers:<\/span><\/h2>\n\n\n\n<h4 class=\"wp-block-heading has-text-align-center\"><span style=\"text-decoration: underline\">Distributed Computing:<\/span><\/h4>\n\n\n\n<p><strong><a href=\"https:\/\/arxiv.org\/abs\/2503.19671\">A Tight Meta-theorem for LOCAL Certification of MSO2&nbsp;Properties within Bounded Treewidth Graphs<\/a> <\/strong>(<em>with <\/em>Eun Jung Kim, and Tom\u00e1\u0161 Masa\u0159\u00edk). <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733562\">Published in conference proceeding<\/a>s a<em>t <a href=\"https:\/\/www.podc.org\/podc2025\/\">PoDC 2025 (The ACM Symposium on Principles of Distributed Computing)<\/a> <\/em><\/p>\n\n\n\n<p><strong><a href=\"https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14815\/pdf\/LIPIcs-DISC-2021-13.pdf\">A tight local algorithm for the minimum dominating set problem in outerplanar graphs<\/a> <\/strong>(<em>with&nbsp;<\/em>Marthe Bonamy, Carla Groenland and Alexandra Wesolek) published at <a href=\"Paulusma, D., Ries, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2023. Lecture Notes in Computer Science, vol 14093. Springer\">DISC 2021<\/a> (35th International Symposium on Distributed Computing).<a href=\"https:\/\/arxiv.org\/abs\/2108.02697\"> (arXiv Version) <\/a><\/p>\n\n\n\n<h4 class=\"wp-block-heading has-text-align-center\"><span style=\"text-decoration: underline\">Graph Theory:<\/span><\/h4>\n\n\n\n<p><a href=\"https:\/\/arxiv.org\/abs\/2303.06609\"><strong>Reconstructing Graphs from Connected Triples<\/strong><\/a> (<em>with <\/em>Paul Bastide, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens, and Jordi L. Vermeulen). Published in Graph-Theoretic Concepts in Computer Science. <strong>WG 2023<\/strong>. Lecture Notes in Computer Science, vol 14093. Springer<\/p>\n\n\n\n<p><strong>At EUROCOMB:<\/strong> Extended abstract versions of <em><a href=\"https:\/\/doi.org\/10.5817\/CZ.MUNI.EUROCOMB23-042\">Proving a directed analogue of the Gy\u00e1rf\u00e1s-Sumner conjecture for orientations of&nbsp;P4<\/a> <\/em>and <em>Colouring t-perfect graphs <\/em>are published in the conference proceedings of EUROCOMB 2023 and Eurocomb 2025, respectively. (<em>with<\/em> Tom\u00e1\u0161 Masa\u0159\u00edk, Marcin Pilipczuk, Amadeus Reinald and U\u00e9verton S. Souza and <em>with<\/em> Maria Chudnovsky, James Davies, Sang-il Oum, and Jane Tan)<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Preprints: Graph Theory: Vu\u2019s conjecture holds for claw-free graphs (with \u00a0Ross J. Kang, Eileen Robinson, and Gabri\u00eblle Zwaneveld) October 2025. Colouring t-perfect graphs (with Maria Chudnovsky, James Davies, Sang-il Oum, and Jane Tan) December 2024. Distributed Computing: Local certification of forbidden subgraphs (with Nicolas Bousquet, Laurent Feuilloley, Th\u00e9o Pierron, S\u00e9bastien Zeitoun) February 2024. Journal Papers:&hellip; <a class=\"more-link\" href=\"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/\">Continue reading <span class=\"screen-reader-text\">Papers<\/span><\/a><\/p>\n","protected":false},"author":13,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-39","page","type-page","status-publish","hentry","entry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Papers - Linda J. Cook<\/title>\n<meta name=\"description\" content=\"Detecting\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Papers - Linda J. Cook\" \/>\n<meta property=\"og:description\" content=\"Detecting\" \/>\n<meta property=\"og:url\" content=\"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/\" \/>\n<meta property=\"og:site_name\" content=\"Linda J. Cook\" \/>\n<meta property=\"article:modified_time\" content=\"2025-10-20T08:19:45+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/papers\\\/\",\"url\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/papers\\\/\",\"name\":\"Papers - Linda J. Cook\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/#website\"},\"datePublished\":\"2021-07-31T07:40:27+00:00\",\"dateModified\":\"2025-10-20T08:19:45+00:00\",\"description\":\"Detecting\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/papers\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/papers\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/papers\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Papers\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/#website\",\"url\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/\",\"name\":\"Linda J. Cook\",\"description\":\"Graph theorist at University of Utrecht\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/dimag.ibs.re.kr\\\/home\\\/cook\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Papers - Linda J. Cook","description":"Detecting","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/","og_locale":"en_US","og_type":"article","og_title":"Papers - Linda J. Cook","og_description":"Detecting","og_url":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/","og_site_name":"Linda J. Cook","article_modified_time":"2025-10-20T08:19:45+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/","url":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/","name":"Papers - Linda J. Cook","isPartOf":{"@id":"https:\/\/dimag.ibs.re.kr\/home\/cook\/#website"},"datePublished":"2021-07-31T07:40:27+00:00","dateModified":"2025-10-20T08:19:45+00:00","description":"Detecting","breadcrumb":{"@id":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/dimag.ibs.re.kr\/home\/cook\/papers\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/dimag.ibs.re.kr\/home\/cook\/"},{"@type":"ListItem","position":2,"name":"Papers"}]},{"@type":"WebSite","@id":"https:\/\/dimag.ibs.re.kr\/home\/cook\/#website","url":"https:\/\/dimag.ibs.re.kr\/home\/cook\/","name":"Linda J. Cook","description":"Graph theorist at University of Utrecht","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/dimag.ibs.re.kr\/home\/cook\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/pages\/39","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/users\/13"}],"replies":[{"embeddable":true,"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/comments?post=39"}],"version-history":[{"count":65,"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/pages\/39\/revisions"}],"predecessor-version":[{"id":868,"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/pages\/39\/revisions\/868"}],"wp:attachment":[{"href":"https:\/\/dimag.ibs.re.kr\/home\/cook\/wp-json\/wp\/v2\/media?parent=39"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}