{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T17:06:50Z","timestamp":1783962410522,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540310006","type":"print"},{"value":"9783540314684","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_10","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"103-114","source":"Crossref","is-referenced-by-count":10,"title":["Roman Domination over Some Graph Classes"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Liedloff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Br\u00e4ndstadt, A., Le, V., Spinrad, J.P.: Graph classes: A survey. SIAM Monogr. Discrete Math. Appl., Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"10_CR2","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 Math.\u00a0278, 11\u201322 (2004)","journal-title":"Discrete Math."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"D.G. Corneil","year":"1999","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput.\u00a028, 1284\u20131297 (1999)","journal-title":"SIAM J. Comput."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math.\u00a010, 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-60618-1_87","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.S. Deogun","year":"1995","unstructured":"Deogun, J.S., Kratsch, D.: Diametral path graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol.\u00a01017, pp. 344\u2013357. Springer, Heidelberg (1995)"},{"key":"10_CR6","unstructured":"Fernau,\u00a0H.: Roman domination: a parameterized perspective (Manuscript)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0166-218X(03)00298-1","volume":"134","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., M\u00fcller, H.: Algorithms for graphs with small octopus. Discrete Appl. Math.\u00a0134, 105\u2013128 (2004)","journal-title":"Discrete Appl. Math."},{"key":"10_CR8","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2004.01.011","volume":"145","author":"M. Habib","year":"2005","unstructured":"Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Appl. Math.\u00a0145, 183\u2013197 (2005)","journal-title":"Discrete Appl. Math."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.7151\/dmgt.1178","volume":"22","author":"M.A. Henning","year":"2002","unstructured":"Henning, M.A.: A characterization of Roman trees. Discuss. Math. Graph Theory\u00a022, 225\u2013234 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"key":"10_CR11","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 Math.\u00a0271, 101\u2013115 (2003)","journal-title":"Discrete Math."},{"key":"10_CR12","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\u2013A new strategy. Discrete Math.\u00a0266, 239\u2013251 (2003)","journal-title":"Discrete Math."},{"key":"10_CR13","unstructured":"Kloks, T., Liedloff, M., Liu, J., Peng, S.L.: Roman domination in some special classes of graphs, Technical Report TR-MA-04-01, University of Lethbridge, Alberta, Canada (November 2004)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D. Kratsch","year":"2000","unstructured":"Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math.\u00a099, 111\u2013123 (2000)","journal-title":"Discrete Appl. Math."},{"key":"10_CR15","doi-asserted-by":"crossref","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: IFIP TCS Conference Proceedings, vol.\u00a0271, pp. 280\u2013291 (2002)","DOI":"10.1007\/978-0-387-35608-2_24"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"585","DOI":"10.2307\/2589113","volume":"107","author":"C.S. ReVelle","year":"2000","unstructured":"ReVelle, C.S., Rosing, K.E.: Defenders imperium Romanum: A classical problem in military strategy. Amer. Math. Monthly\u00a0107, 585\u2013594 (2000)","journal-title":"Amer. Math. Monthly"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"281","author":"I. Stewart","year":"1999","unstructured":"Stewart, I.: Defend the Roman empire! Sci. Amer.\u00a0281, 136\u2013139 (1999)","journal-title":"Sci. Amer."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:15Z","timestamp":1619507055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11604686_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}