{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:33Z","timestamp":1770921393509,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"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_12","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:04Z","timestamp":1770918784000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration With Nice Roman Domination Properties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0880-2513","authenticated-orcid":false,"given":"Kevin","family":"Mann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Fernau, H., Mann, K.: Roman census: enumerating and counting Roman dominating functions on graph classes. In: Leroux, J., Lombardy, S., Peleg, D. (eds.) 48th International Symposium on Mathematical Foundations of Computer Science, MFCS. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0272, pp. 6:1\u20136:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)","DOI":"10.2139\/ssrn.4557637"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1007\/s00453-024-01211-w","volume":"86","author":"FN Abu-Khzam","year":"2024","unstructured":"Abu-Khzam, F.N., Fernau, H., Mann, K.: Minimal Roman dominating functions: extensions and enumeration. Algorithmica 86, 1862\u20131887 (2024)","journal-title":"Algorithmica"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.dam.2020.05.037","volume":"303","author":"S Blind","year":"2021","unstructured":"Blind, S., Creignou, N., Olive, F.: Locally definable vertex set properties are efficiently enumerable. Discret. Appl. Math. 303, 186\u2013202 (2021)","journal-title":"Discret. Appl. Math."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2021.10.017","volume":"904","author":"K Casel","year":"2022","unstructured":"Casel, K., Fernau, H., Ghadikolaei, M.K., Monnot, J., Sikora, F.: On the complexity of solution extension of optimization problems. Theoret. Comput. Sci. 904, 48\u201365 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Chapelle, M., Cochefert, M., Couturier, J.F., Kratsch, D., Liedloff, M., Perez, A.: Exact algorithms for weak Roman domination. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 81\u201393. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45278-9_8","DOI":"10.1007\/978-3-642-45278-9_8"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2015.11.013","volume":"204","author":"M Chellali","year":"2016","unstructured":"Chellali, M., Haynes, T.W., Hedetniemi, S.T., McRae, A.A.: Roman {2}-domination. Discret. Appl. Math. 204, 22\u201328 (2016)","journal-title":"Discret. Appl. Math."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne, E.J., Dreyer, P., Jr., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discret. Math. 278, 11\u201322 (2004)","journal-title":"Discret. Math."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.dam.2019.02.025","volume":"268","author":"N Creignou","year":"2019","unstructured":"Creignou, N., Kr\u00f6ll, M., Pichler, R., Skritek, S., Vollmer, H.: A complexity theory for hard enumeration problems. Discret. Appl. Math. 268, 191\u2013209 (2019)","journal-title":"Discret. Appl. Math."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.dam.2020.12.010","volume":"292","author":"A Darmann","year":"2021","unstructured":"Darmann, A., D\u00f6cker, J.: On simplified NP-complete variants of monotone 3-SAT. Discret. Appl. Math. 292, 45\u201358 (2021)","journal-title":"Discret. Appl. Math."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Mendelzon, A.O., \u00d6zsoyoglu, Z.M. (eds.) Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS. pp. 209\u2013216. ACM Press (1997)","DOI":"10.1145\/263661.263684"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.dam.2016.09.035","volume":"217","author":"MA Henning","year":"2017","unstructured":"Henning, M.A., Klostermeyer, W.F.: Italian domination in trees. Discret. Appl. Math. 217, 557\u2013564 (2017)","journal-title":"Discret. Appl. Math."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kobayashi, Y., Kurita, K., Mann, K., Matsuo, Y., Ono, H.: Enumerating minimal vertex covers and dominating sets with capacity and\/or connectivity constraints. Algorithms 18(2) (2025)","DOI":"10.3390\/a18020112"},{"key":"12_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114628","volume":"1005","author":"K Kurita","year":"2024","unstructured":"Kurita, K., Wasa, K.: An approximation algorithm for $$K$$-best enumeration of minimal connected edge dominating sets with cardinality constraints. Theoret. Comput. Sci. 1005, 114628 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Li, K., Ran, Y., Zhang, Z., Du, D.: Nearly tight approximation algorithm for (connected) Roman dominating set. Optim. Lett. 16(8), 2261\u20132276 (2022)","DOI":"10.1007\/s11590-022-01862-0"},{"issue":"18","key":"12_CR15","doi-asserted-by":"publisher","first-page":"3400","DOI":"10.1016\/j.dam.2008.01.011","volume":"156","author":"M Liedloff","year":"2008","unstructured":"Liedloff, M., Kloks, T., Liu, J., Peng, S.L.: Efficient algorithms for Roman domination on some classes of graphs. Discret. Appl. Math. 156(18), 3400\u20133415 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","volume":"26","author":"CH Liu","year":"2013","unstructured":"Liu, C.H., Chang, G.J.: Roman domination on strongly chordal graphs. J. Comb. Optim. 26(3), 608\u2013619 (2013)","journal-title":"J. Comb. Optim."},{"key":"12_CR17","unstructured":"Mann, K.: Enumeration with nice Roman domination properties. Technical. Rep. 2511.20367, ArXiv, Cornell University, USA (2025)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Mann, K., Fernau, H.: Perfect Roman domination: aspects of enumeration and parameterization. Algorithms 17(12:576) (2024)","DOI":"10.3390\/a17120576"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Marino, A.: Analysis and Enumeration. Algorithms for Biological Graphs, Atlantis Studies in Computing, vol. 6. Atlantis Press, Paris (2015)","DOI":"10.2991\/978-94-6239-097-3"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"333","DOI":"10.15623\/ijret.2013.0210050","volume":"2","author":"MH Muddebihal","year":"2013","unstructured":"Muddebihal, M.H.: Sumangaladevi: connected Roman domination in graphs. Int. J. Res. Eng. Technol. 2, 333\u2013340 (2013)","journal-title":"Int. J. Res. Eng. Technol."},{"issue":"24","key":"12_CR21","doi-asserted-by":"publisher","first-page":"3194","DOI":"10.1016\/j.disc.2007.03.020","volume":"307","author":"RR Rubalcaba","year":"2007","unstructured":"Rubalcaba, R.R., Slater, P.J.: Roman dominating influence parameters. Discret. Math. 307(24), 3194\u20133200 (2007)","journal-title":"Discret. Math."},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Shao, Z., Song, Y., Liu, Q., Duan, Z., Jiang, H.: On maximal Roman domination in graphs: complexity and algorithms. RAIRO Informatique th\u00e9orique et Appl.\/Theor. Inf. Appl. 58(4), 2709\u20132731 (2024)","DOI":"10.1051\/ro\/2024038"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Stewart, I.: Defend the Roman empire. Scientific American 281(6), 136\u2013139 (1999)","DOI":"10.1038\/scientificamerican1299-136"},{"key":"12_CR24","unstructured":"Strozecki, Y.: Enumeration complexity. EATCS Bull. 129 (2019)"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:07Z","timestamp":1770918787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_12","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"}}]}}