{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:04Z","timestamp":1770972424916,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540311980","type":"print"},{"value":"9783540322177","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_24","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"262-271","source":"Crossref","is-referenced-by-count":1,"title":["Roman Domination: A Parameterized Perspective"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-44683-4_11","volume-title":"Mathematical Foundations of Computer Science 2001","author":"J. Alber","year":"2001","unstructured":"Alber, J., Fan, H., Fellows, M.R., Fernau, H., Niedermeier, R., Rosamond, F., Stege, U.: Refined Search Tree Techniques for the Planar Dominating Set Problem. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 111\u2013122. Springer, Heidelberg (2001); Long version to appear in Journal of Computer and System Sciences"},{"key":"24_CR2","unstructured":"Benecke, S.: Higher Order Domination of Graphs. Master\u2019s Thesis, Department of Applied Mathematics of the University of Stellebosch, South Africa (2004)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic Programming on Graphs with Bounded Treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 105\u2013119. Springer, Heidelberg (1988)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/S0022-0000(03)00073-4","volume":"67","author":"M. Cesati","year":"2003","unstructured":"Cesati, M.: The Turing Way to Parameterized Complexity. Journal of Computer and System Sciences\u00a067, 654\u2013685 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/malq.19970430204","volume":"43","author":"M. Cesati","year":"1997","unstructured":"Cesati, M., Di Ianni, M.: Computation Models for Parameterized Complexity. Mathematical Logic Quarterly\u00a043, 179\u2013202 (1997)","journal-title":"Mathematical Logic Quarterly"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-45220-1_12","volume-title":"Computer Science Logic","author":"Y. Chen","year":"2003","unstructured":"Chen, Y., Flum, J.: Machine Characterization of the Classes of the W-Hierarchy. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 114\u2013127. Springer, Heidelberg (2003)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"E.J. Cockayne","year":"2004","unstructured":"Cockayne, E.J., Dreyer Jr., P.A., Hedetniemi, S.M., Hedetniemi, S.T.: Roman Domination in Graphs. Discrete Mathematics\u00a0278, 11\u201322 (2004)","journal-title":"Discrete Mathematics"},{"key":"24_CR8","first-page":"19","volume":"67","author":"E.J. Cockayne","year":"2005","unstructured":"Cockayne, E.J., Grobler, P.J.P., Gr\u00fcndlingh, W.R., Munganga, J., van Vuuren, J.H.: Protection of a Graph. Utilitas Mathematica\u00a067, 19\u201332 (2005)","journal-title":"Utilitas Mathematica"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: nonblocker set: Parameterized Algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 237\u2013245. Springer, Heidelberg (2006)"},{"key":"24_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"24_CR11","unstructured":"Dreyer Jr., P.A.: Applications and Variations of Domination in Graphs. PhD thesis, Rutgers University, New Jersey, USA, PhD Thesis (2000)"},{"key":"24_CR12","unstructured":"Fernau, H.: Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschrift, Universit\u00e4t T\u00fcbingen, Germany (2005) (submitted)"},{"key":"24_CR13","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up. In: Proc. 14th SODA, pp. 168\u2013177 (2003)"},{"key":"24_CR14","unstructured":"Goddard, W.D., Hedetniemi, S.M., Hedetniemi, S.T.: Eternal Security in Graphs. J. Combin. Math. Combin. Comput. (to appear)"},{"key":"24_CR15","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(03)00040-2","volume":"271","author":"M.A. Henning","year":"2003","unstructured":"Henning, M.A.: Defending the Roman Empire from Multiple Attacks. Discrete Mathematics\u00a0271, 101\u2013115 (2003)","journal-title":"Discrete Mathematics"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(02)00811-7","volume":"266","author":"M.A. Henning","year":"2003","unstructured":"Henning, M.A., Hedetniemi, S.T.: Defending the Roman Empire: a New Strategy. Discrete Mathematics\u00a0266, 239\u2013251 (2003)","journal-title":"Discrete Mathematics"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11604686_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Liedloff","year":"2005","unstructured":"Liedloff, M., Kloks, T., Liu, J., Peng, S.-L.: Roman Domination over Some Graphs Classes. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 103\u2013114. Springer, Heidelberg (2005)"},{"key":"24_CR20","first-page":"280","volume-title":"2nd IFIP International Conference on Theoretical Computer Science IFIP TCS","author":"A. Pagourtzis","year":"2002","unstructured":"Pagourtzis, A., Penna, P., Schlude, K., Steinh\u00f6fel, K., Taylor, D.S., Widmayer, P.: Server Placements, Roman Domination and Other Dominating Set Variants. In: 2nd IFIP International Conference on Theoretical Computer Science IFIP TCS, pp. 280\u2013291. Kluwer, Dordrecht (2002)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Stewart, I.: Defend the Roman Empire! Scientific American, 136\u2013139 (December 1999)","DOI":"10.1038\/scientificamerican1299-136"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/3-540-57155-8_284","volume-title":"Algorithms and Data Structures","author":"J.A. Telle","year":"1993","unstructured":"Telle, J.A., Proskurowski, A.: Practical Algorithms on Partial k-Trees with an Application to Domination-Like Problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol.\u00a0709, pp. 610\u2013621. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:27Z","timestamp":1619507367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11611257_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}