{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:28Z","timestamp":1725664708075},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:57:03Z","timestamp":1330261023000},"page":"201-210","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["r-Domination problems on homogeneously orderable graphs"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[]},{"given":"Falk","family":"Nicolai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"15_CR1","unstructured":"A. Brandst\u00e4dt, Special graph classes \u2014 a survey, Technical Report Universit\u00e4t Duisburg SM-DU-199, 1991."},{"key":"15_CR2","unstructured":"A. Brandst\u00e4dt and F.F. Dragan, A Linear-Time Algorithm for Connected r-Domination and Steiner Tree on Distance-Hereditary Graphs, Technical Report Universit\u00e4t Duisburg SM-DU-261, 1994."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.D. Chepoi and F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, International Workshop \u201dGraph-Theoretic Concepts in Computer Science\u201d 1994, to appear.","DOI":"10.1007\/3-540-59071-4_38"},{"key":"15_CR4","unstructured":"A. Brandst\u00e4dt, F.F. Dragan and F. Nicolai, Homogeneously orderable graphs, Technical Report Universit\u00e4t Duisburg SM-DU-271, 1994."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","volume":"54","author":"A. Brandst\u00e4dt","year":"1987","unstructured":"A. Brandst\u00e4dt and D. Kratsch, Domination problems on permutation and other graphs, Theoretical Computer Science 54 (1987), 181\u2013198.","journal-title":"Theoretical Computer Science"},{"issue":"No.2","key":"15_CR6","first-page":"64","volume":"1","author":"F.F. Dragan","year":"1993","unstructured":"F.F. Dragan, HT-graphs: centers, connected r\u2014domination and Steiner trees, Computer Science Journal of Moldova 1 (1993), No. 2, 64\u201383.","journal-title":"Computer Science Journal of Moldova"},{"key":"15_CR7","first-page":"370","volume":"824","author":"F.F. Dragan","year":"1994","unstructured":"F.F. Dragan, Dominating cliques in distance-hereditary graphs, Proc. of the 4th SWAT, Aarhus, Denmark, Springer LNCS 824 (1994), 370\u2013381.","journal-title":"Springer LNCS"},{"key":"15_CR8","first-page":"735","volume":"775","author":"F.F. Dragan","year":"1994","unstructured":"F.F. Dragan and A. Brandst\u00e4dt, r-dominating cliques in Helly graphs and chordal graphs, Proc. of the 11th STACS, Caen, France, Springer LNCS 775 (1994), 735\u2013746.","journal-title":"Springer LNCS"},{"key":"15_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980."},{"key":"15_CR10","unstructured":"S.C. Hedetniemi and R. Laskar (eds.), Topics on domination, Annals of Discr. Math. 48 (1991), North-Holland."},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0012-365X(94)90118-X","volume":"128","author":"D. Kratsch","year":"1994","unstructured":"D. Kratsch, P. Damaschke and A. Lubiw, Dominating cliques in chordal graphs, Discr. Math. 128 (1994), 269\u2013275.","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:33:41Z","timestamp":1578508421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_52"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}