{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:48:07Z","timestamp":1725587287825},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_39","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T07:44:05Z","timestamp":1308555845000},"page":"462-473","source":"Crossref","is-referenced-by-count":11,"title":["Domination When the Stars Are Out"],"prefix":"10.1007","author":[{"given":"Danny","family":"Hermelin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","volume":"23","author":"R.B. Allan","year":"1978","unstructured":"Allan, R.B., Laskar, R.: On Domination and Independent Domination Numbers of a Graph. Discrete Mathematics\u00a023, 73\u201376 (1978)","journal-title":"Discrete Mathematics"},{"issue":"8","key":"39_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. Journal of Computer and System Sciences\u00a075(8), 423\u2013434 (2009)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"39_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.20425","volume":"63","author":"M. Chudnovsky","year":"2010","unstructured":"Chudnovsky, M., Fradkin, A.O.: An approximate version of Hadwiger\u2019s conjecture for claw-free graphs. Journal of Graph Theory\u00a063(4), 259\u2013278 (2010)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/jgt.20192","volume":"54","author":"M. Chudnovsky","year":"2007","unstructured":"Chudnovsky, M., Ovetsky, A.: Coloring Quasi-Line Graphs. Journal of Graph Theory\u00a054(1), 41\u201350 (2007)","journal-title":"Journal of Graph Theory"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.D.: The Structure of Claw-Free Graphs. London Mathematical Society Lecture Note Series: Surveys in Combinatorics, vol.\u00a0327, pp. 153\u2013171 (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"6","key":"39_CR6","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1016\/j.jctb.2008.03.002","volume":"98","author":"M. Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Seymour, P.D.: Claw-free graphs. V. Global structure. Journal of Combinatorial Theory, Series B\u00a098(6), 1373\u20131410 (2008)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M., Philip, G., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Dominating Set is Fixed Parameter Tractable in Claw-free Graphs, arXiv:1011.6239v1 (cs.DS) (2010) (preprint)","DOI":"10.1016\/j.tcs.2011.09.010"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28639-4_1","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2004","unstructured":"Damaschke, P.: Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. In: Downey, R., Fellows, M., Dehne, P. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"39_CR9","first-page":"161","volume":"87","author":"R.G. Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congressus Numerantium\u00a087, 161\u2013178 (1992)","journal-title":"Congressus Numerantium"},{"key":"39_CR10","doi-asserted-by":"publisher","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, New York (1999)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00493-008-2244-x","volume":"28","author":"F. Eisenbrand","year":"2008","unstructured":"Eisenbrand, F., Oriolo, G., Stauffer, G., Ventura, P.: The Stable Set Polytope of Quasi-Line Graphs. Combinatorica\u00a028(1), 45\u201367 (2008)","journal-title":"Combinatorica"},{"issue":"1-3","key":"39_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R. Faudree","year":"1997","unstructured":"Faudree, R., Flandrin, E., Ryj\u00e1\u010dek, Z.: Claw-free graphs \u2013 A survey. Discrete Mathematics\u00a0164(1-3), 87\u2013147 (1997)","journal-title":"Discrete Mathematics"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Oriolo, G., Stauffer, G.: An algorithmic decomposition of claw-free graphs leading to an O(n 3)-algorithm for the weighted stable set problem. In: Proc. SODA 2011, pp. 630\u2013646. ACM-SIAM (2011)","DOI":"10.1137\/1.9781611973082.49"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11847250_13","volume-title":"Parameterized and Exact Computation","author":"H. Fernau","year":"2006","unstructured":"Fernau, H.: Edge Dominating Set: Efficient Enumeration-Based Exact Algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 142\u2013153. Springer, Heidelberg (2006)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/j.endm.2010.05.130","volume":"36","author":"A. Galluccio","year":"2010","unstructured":"Galluccio, A., Gentile, C., Ventura, P.: The stable set polytope of claw-free graphs with large stability number. Electronic Notes Discrete Mathematics\u00a036, 1025\u20131032 (2010)","journal-title":"Electronic Notes Discrete Mathematics"},{"key":"39_CR18","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 Inc., New York (1998)"},{"key":"39_CR19","volume-title":"Domination in graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"W.-L. Hsu","year":"1991","unstructured":"Hsu, W.-L., Tsai, K.-H.: Linear-time algorithms on circular arc graphs. Information Processing Letters\u00a040, 123\u2013129 (1991)","journal-title":"Information Processing Letters"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"39_CR22","unstructured":"King, A.D.: Claw-free graphs and two conjectures on \u03c9, \u0394, and \u03c7, PhD Thesis, McGill University, Montreal, Canada (2009)"},{"issue":"3","key":"39_CR23","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/jgt.20334","volume":"59","author":"A.D. King","year":"2008","unstructured":"King, A.D., Reed, B.A.: Bounding \u03c7 in Terms of \u03c9 and \u0394 for Quasi-Line Graphs. Journal of Graph Theory\u00a059(3), 215\u2013228 (2008)","journal-title":"Journal of Graph Theory"},{"key":"39_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized Complexity of Independence and Domination on Geometric Graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 154\u2013165. Springer, Heidelberg (2006)"},{"issue":"3","key":"39_CR25","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. Journal of Combinatorial Theory, Series B\u00a028(3), 284\u2013304 (1980)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"39_CR26","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S.: The effect of girth on the kernelization complexity of Connected Dominating Set. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2010, Schloss Dagstuhl, Daghstuhl, Germany. LIPIcs, vol.\u00a08, pp. 96\u2013107 (2010)"},{"issue":"2","key":"39_CR27","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weighted stable set of a claw-free graph. Journal of the Operations Research Society of Japan\u00a044(2), 194\u2013204 (2001)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"39_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-642-04128-0_62","volume-title":"Algorithms - ESA 2009","author":"G. Philip","year":"2009","unstructured":"Philip, G., Raman, V., Sikdar, S.: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 694\u2013705. Springer, Heidelberg (2009)"},{"issue":"2-3","key":"39_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0166-218X(99)00052-9","volume":"92","author":"J. Plesn\u00edk","year":"1999","unstructured":"Plesn\u00edk, J.: Constrained weighted matchings and edge coverings in graphs. Discrete Applied Mathematics\u00a092(2-3), 229\u2013241 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"39_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Mathematics\u00a029(1), 53\u201376 (1980)","journal-title":"Discrete Mathematics"},{"key":"39_CR31","unstructured":"Stauffer, G.: Personal communication"},{"issue":"3","key":"39_CR32","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM Journal on Applied Mathematics\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T20:30:12Z","timestamp":1712521812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}