{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:37:02Z","timestamp":1770921422448,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_36","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:33Z","timestamp":1770918813000},"page":"491-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Face-Hitting Dominating Sets in\u00a0Plane Graphs: Alternative Proof and\u00a0Linear-Time Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-3783","authenticated-orcid":false,"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jagm.2000.1132","volume":"38","author":"T Biedl","year":"2001","unstructured":"Biedl, T., Bose, P., Demaine, E., Lubiw, A.: Efficient algorithms for Petersen\u2019s theorem. J. Algorithms 38(1), 110\u2013134 (2001)","journal-title":"J. Algorithms"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009182","volume":"19","author":"T Biedl","year":"1997","unstructured":"Biedl, T., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraint. Algorithmica 19(4), 427\u2013446 (1997)","journal-title":"Algorithmica"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., Kirkpatrick, D., Li, Z.: Efficient algorithms for guarding and illuminating the surface of a polyhedral terrain. In: CCCG 1996. International Informatics Series, vol.\u00a05, pp. 217\u2013222. Carleton University Press (1996)","DOI":"10.1515\/9780773591134-039"},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0925-7721(95)00034-8","volume":"6","author":"P Bose","year":"1997","unstructured":"Bose, P., Shermer, T., Toussaint, G., Zhu, B.: Guarding polyhedral terrains. Comput. Geom. Theory Appl. 6(3), 173\u2013195 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Christiansen, A., Rotenberg, E., Rutschmann, D.: Triangulations admit dominating sets of size 2n\/7. In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, pp. 1194\u20131240. SIAM (2024)","DOI":"10.1137\/1.9781611977912.47"},{"key":"36_CR7","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Cham (2012)","edition":"4"},{"issue":"2","key":"36_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.7155\/jgaa.00576","volume":"25","author":"W Evans","year":"2021","unstructured":"Evans, W., Gethner, E., Spalding-Jamieson, J., Wolff, A.: Angle covers: algorithms and complexity. J. Graph Algorithms Appl. 25(2), 643\u2013661 (2021)","journal-title":"J. Graph Algorithms Appl."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an $$st$$-numbering. Theoret. Comput. Sci. 2, 436\u2013441 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Francis, P., Illickan, A., Jose, L., Rajendraprasad, D.: Face-hitting dominating sets in planar graphs. In: Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024. LNCS, vol. 14760, pp. 211\u2013219. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-75409-8_15"},{"key":"36_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient algorithms for graph manipulation. Commun. ACM 16(6) (1973)","DOI":"10.1145\/362248.362272"},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2635","volume":"135","author":"G Kant","year":"1997","unstructured":"Kant, G., Bodlaender, H.: Triangulating planar graphs while minimizing the maximum degree. Inf. Comput. 135(1), 1\u201314 (1997)","journal-title":"Inf. Comput."},{"issue":"6","key":"36_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/eujc.1996.0048","volume":"17","author":"L Matheson","year":"1996","unstructured":"Matheson, L., Tarjan, R.: Dominating sets in planar graphs. Eur. J. Comb. 17(6), 565\u2013568 (1996)","journal-title":"Eur. J. Comb."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs (The theory of regular graphs). Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Combin. Theory Ser. B 70(1), 2\u201344 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientation of planar graphs. Discret. Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"36_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1073\/pnas.17.2.125","volume":"17","author":"H Whitney","year":"1931","unstructured":"Whitney, H.: Non-separable and planar graphs. Proc. Natl. Acad. Sci. 17(2), 125\u2013127 (1931)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:34Z","timestamp":1770918814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}