{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:51:23Z","timestamp":1782971483907,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-24-CE48-7768-01"],"award-info":[{"award-number":["ANR-24-CE48-7768-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733531","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"77-87","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7905-8018","authenticated-orcid":false,"given":"Marthe","family":"Bonamy","sequence":"first","affiliation":[{"name":"LaBRI, University of Bordeaux, CNRS, Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3671-8607","authenticated-orcid":false,"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"LaBRI, University of Bordeaux, Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7129-0127","authenticated-orcid":false,"given":"Timothe","family":"Picavet","sequence":"additional","affiliation":[{"name":"LaBRI, University of Bordeaux, Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4841-5937","authenticated-orcid":false,"given":"Alexandra","family":"Wesolek","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093239"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/1341"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.13"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1146711"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ISAAC.2018.22"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Guoli Ding. 2017. Graphs without large K2 n-minors. 10.48550\/ARXIV.1702.01355","DOI":"10.48550\/ARXIV.1702.01355"},{"key":"e_1_3_2_1_10_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H. Freeman."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_12_1","volume-title":"Geometric Group Theory: Asymptotic invariants of infinite groups","author":"Gromov Mikhael","unstructured":"Mikhael Gromov. 1993. Geometric Group Theory: Asymptotic invariants of infinite groups. Cambridge University Press."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2023.103773"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611504"},{"key":"e_1_3_2_1_15_1","volume-title":"The NP-Completeness of the Dominating Set Problem in Cubic Planar Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E63-E, 6","author":"Kikuno Tohru","year":"1980","unstructured":"Tohru Kikuno, Noriyoshi Yoshida, and Yoshiaki Kakuda. 1980. The NP-Completeness of the Dominating Set Problem in Cubic Planar Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E63-E, 6 (1980), 443\u2013444."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579141"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.03.026"},{"key":"e_1_3_2_1_18_1","volume-title":"Networking Wireless Sensors","author":"Krishnamachari Bhaskar","unstructured":"Bhaskar Krishnamachari. 2005. Networking Wireless Sensors. Cambridge University Press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79527-6_19"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0186-z"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_27"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.20"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000073"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_1_27_1","volume-title":"On the fine structure of graphs avoiding certain complete bipartite minors. Ph. D. Dissertation","author":"Solava Ryan","unstructured":"Ryan Solava. 2019. On the fine structure of graphs avoiding certain complete bipartite minors. Ph. D. Dissertation. Vanderbilt University."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431223"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.2013"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.11.008"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:26:51Z","timestamp":1749824811000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":28,"alternative-id":["10.1145\/3732772.3733531","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733531","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}