{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:15Z","timestamp":1759638855158},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_31","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"423-437","source":"Crossref","is-referenced-by-count":1,"title":["On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\\ell )$$ -graphs"],"prefix":"10.1007","author":[{"given":"Sancrey Rodrigues","family":"Alves","sequence":"first","affiliation":[]},{"given":"Konrad K.","family":"Dabrowski","sequence":"additional","affiliation":[]},{"given":"Luerbio","family":"Faria","sequence":"additional","affiliation":[]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[]},{"given":"U\u00e9verton","family":"dos Santos Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"8","key":"31_CR1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. System Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. System Sci."},{"issue":"1\u20133","key":"31_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","volume":"152","author":"A Brandst\u00e4dt","year":"1996","unstructured":"Brandst\u00e4dt, A.: Partitions of graphs into one or two independent sets and cliques. Discrete Math. 152(1\u20133), 47\u201354 (1996)","journal-title":"Discrete Math."},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-5060(08)70387-X","volume":"55","author":"V Chv\u00e1tal","year":"1993","unstructured":"Chv\u00e1tal, V., Slater, P.J.: A note on well-covered graphs. Ann. Discret. Math. 55, 179\u2013181 (1993)","journal-title":"Ann. Discret. Math."},{"key":"31_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)"},{"key":"31_CR5","unstructured":"Dell, H.: A simple proof that AND-compression of NP-complete problems is hard. Electronic Colloquium on Computational Complexity (ECCC), 21: 75 (2014)"},{"key":"31_CR6","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"31_CR7","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelbreg (2013)"},{"issue":"5","key":"31_CR8","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1137\/130927115","volume":"44","author":"A Drucker","year":"2015","unstructured":"Drucker, A.: New limits to classical and quantum instance compression. SIAM J. Comput. 44(5), 1443\u20131479 (2015)","journal-title":"SIAM J. Comput."},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(82)90215-1","volume":"42","author":"O Favaron","year":"1982","unstructured":"Favaron, O.: Very well-covered graphs. Discrete Math. 42, 177\u2013187 (1982)","journal-title":"Discrete Math."},{"issue":"3","key":"31_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1137\/S0895480100384055","volume":"16","author":"T Feder","year":"2003","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: List partitions. SIAM J. Discrete Math. 16(3), 449\u2013478 (2003)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"31_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tcs.2005.09.030","volume":"349","author":"T Feder","year":"2005","unstructured":"Feder, T., Hell, P., Klein, S., Nogueira, L.T., Protti, F.: List matrix partitions of chordal graphs. Theoret. Comput. Sci. 349(1), 52\u201366 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR13","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"31_CR14","unstructured":"Golzari, R.J., Zaare-Nahandi, R.: Unmixed $$r$$ -partite graphs. CoRR, abs\/1511.00228 (2015)"},{"issue":"6","key":"31_CR15","first-page":"1505","volume":"40","author":"H Haghighi","year":"2014","unstructured":"Haghighi, H.: A generalization of Villarreal\u2019s result for unmixed tripartite graphs. Bull. Iran. Math. Soc. 40(6), 1505\u20131514 (2014)","journal-title":"Bull. Iran. Math. Soc."},{"key":"31_CR16","unstructured":"Kolay, S., Panolan, F., Raman, V., Saurabh, S.: Parameterized algorithms on perfect graphs for deletion to $$(r,\\ell )$$ -graphs. In: Proceedings of MFCS 2016, vol. 58, LIPIcs, pp. 75: 1\u201375: 13 (2016)"},{"issue":"1","key":"31_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"31_CR18","unstructured":"Lesk, M., Plummer, M.D., Pulleyblank, W.R.: Equi-matchable graphs. In: Graph Theory and Combinatorics. Academic Press, pp. 239\u2013254 (1984)"},{"key":"31_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, vol. 31. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"31_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","volume":"8","author":"MD Plummer","year":"1970","unstructured":"Plummer, M.D.: Some covering concepts in graphs. J. Comb. Theory 8(1), 91\u201398 (1970)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"31_CR21","first-page":"20","volume":"2","author":"G Ravindra","year":"1977","unstructured":"Ravindra, G.: Well-covered graphs. J. Comb. Inform. Syst. Sci. 2(1), 20\u201321 (1977)","journal-title":"J. Comb. Inform. Syst. Sci."},{"issue":"3","key":"31_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230220304","volume":"22","author":"RS Sankaranarayana","year":"1992","unstructured":"Sankaranarayana, R.S., Stewart, L.K.: Complexity results for well-covered graphs. Networks 22(3), 247\u2013262 (1992)","journal-title":"Networks"},{"issue":"3","key":"31_CR23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1008293.1008294","volume":"5","author":"L Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.: Planar $$3$$ -colorability is polynomial complete. ACM SIGACT News 5(3), 19\u201325 (1973)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"31_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1006\/jctb.1996.0022","volume":"66","author":"D Tankus","year":"1996","unstructured":"Tankus, D., Tarsi, M.: Well-covered claw-free graphs. J. Comb.Theory, Ser. B 66(2), 293\u2013302 (1996)","journal-title":"J. Comb.Theory, Ser. B"},{"issue":"2","key":"31_CR25","first-page":"55","volume":"1","author":"J Topp","year":"1990","unstructured":"Topp, J., Volkmann, L.: Well covered and well dominated block graphs and unicyclic graphs. Mathematica Pannonica 1(2), 55\u201366 (1990)","journal-title":"Mathematica Pannonica"},{"issue":"2","key":"31_CR26","first-page":"393","volume":"41","author":"RH Villarreal","year":"2007","unstructured":"Villarreal, R.H.: Unmixed bipartite graphs. Revista Colombiana de Matem\u00e1ticas 41(2), 393\u2013395 (2007)","journal-title":"Revista Colombiana de Matem\u00e1ticas"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:24:37Z","timestamp":1498357477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}