{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:51:08Z","timestamp":1742939468927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031099922"},{"type":"electronic","value":"9783031099939"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09993-9_9","type":"book-chapter","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:12:42Z","timestamp":1656101562000},"page":"154-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Planar Domination Revisited"],"prefix":"10.1007","author":[{"given":"Ozan","family":"Heydt","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Siebertz","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Vigny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"key":"9_CR1","unstructured":"Alipour, S., Futuhi, E., Karimi, S.: On distributed algorithms for minimum dominating set problem, from theory to application. arXiv preprint arXiv:2012.04883 (2020)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alipour, S., Jafari, A.: A local constant approximation factor algorithm for minimum dominating set of certain planar graphs. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 501\u2013502 (2020)","DOI":"10.1145\/3350755.3400217"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326170","volume":"15","author":"SA Amiri","year":"2019","unstructured":"Amiri, S.A., Schmid, S., Siebertz, S.: Distributed dominating set approximations beyond planar graphs. ACM Trans. Algorithms (TALG) 15(3), 1\u201318 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ipl.2017.01.011","volume":"122","author":"N Bansal","year":"2017","unstructured":"Bansal, N., Umboh, S.W.: Tight approximation bounds for dominating set on graphs of bounded arboricity. Inf. Process. Lett. 122, 21\u201324 (2017)","journal-title":"Inf. Process. Lett."},{"key":"9_CR5","unstructured":"Bonamy, M., Cook, L., Groenland, C., Wesolek, A.: A tight local algorithm for the minimum dominating set problem in outerplanar graphs. In: DISC. LIPIcs, vol. 209, pp. 13:1\u201313:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"9_CR6","unstructured":"Czygrinow, A., Hanckowiak, M., Wawrzyniak, W., Witkowski, M.: Distributed approximation algorithms for the minimum dominating set in k_h-minor-free graphs. In: 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn, vol. 173. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5242-3","volume-title":"Connected Dominating Set: Theory and Applications","author":"DZ Du","year":"2012","unstructured":"Du, D.Z., Wan, P.J.: Connected Dominating Set: Theory and Applications, vol. 77. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-5242-3"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1002\/jgt.22426","volume":"91","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, Z.: On distance-dominating and-independent sets in sparse graphs. J. Graph Theory 91(2), 162\u2013173 (2019)","journal-title":"J. Graph Theory"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jcss.2016.09.002","volume":"84","author":"J Gajarsk\u1ef3","year":"2017","unstructured":"Gajarsk\u1ef3, J., et al.: Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84, 219\u2013242 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S Hakimi","year":"1965","unstructured":"Hakimi, S.: On the degree of the vertices of a directed graph. J. Franklin Inst. 279(4), 290\u2013308 (1965)","journal-title":"J. Franklin Inst."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Hilke, M., Lenzen, C., Suomela, J.: Brief announcement: local approximability of minimum dominating set on planar graphs. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, pp. 344\u2013346 (2014)","DOI":"10.1145\/2611462.2611504"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kublenz, S., Siebertz, S., Vigny, A.: Constant round distributed domination on graph classes with bounded expansion. arXiv preprint arXiv:2012.02701 (2020)","DOI":"10.1007\/978-3-030-79527-6_19"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA. vol. 6, pp. 1109557\u20131109666. Citeseer (2006)","DOI":"10.1145\/1109557.1109666"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17:1\u201317:44 (2016)","DOI":"10.1145\/2742012"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00446-013-0186-z","volume":"26","author":"C Lenzen","year":"2013","unstructured":"Lenzen, C., Pignolet, Y.A., Wattenhofer, R.: Distributed minimum dominating set approximations in restricted families of graphs. Distrib. Comput. 26(2), 119\u2013137 (2013)","journal-title":"Distrib. Comput."},{"key":"9_CR18","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"Jaroslav Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, Jaroslav, Ossona de Mendez, Patrice: Sparsity. AC, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4"},{"issue":"1","key":"9_CR19","first-page":"170","volume":"3","author":"A Sasireka","year":"2014","unstructured":"Sasireka, A., Kishore, A.N.: Applications of dominating set of a graph in computer networks. Int. J. Eng. Sci. Res. Technol. 3(1), 170\u2013173 (2014)","journal-title":"Int. J. Eng. Sci. Res. Technol."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ipl.2019.01.006","volume":"145","author":"S Siebertz","year":"2019","unstructured":"Siebertz, S.: Greedy domination on biclique-free graphs. Inf. Process. Lett. 145, 64\u201367 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2431211.2431223","volume":"45","author":"J Suomela","year":"2013","unstructured":"Suomela, J.: Survey of local algorithms. ACM Comput. Surv. (CSUR) 45(2), 1\u201340 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ipl.2013.11.008","volume":"114","author":"W Wawrzyniak","year":"2014","unstructured":"Wawrzyniak, W.: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. Inf. Process. Lett. 114(3), 94\u201398 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00373-007-0738-8","volume":"23","author":"DR Wood","year":"2007","unstructured":"Wood, D.R.: On the maximum number of cliques in a graph. Graphs Comb. 23(3), 337\u2013352 (2007)","journal-title":"Graphs Comb."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09993-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:13:24Z","timestamp":1656101604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09993-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031099922","9783031099939"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09993-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2022.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}