{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:55Z","timestamp":1725914695348},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_31","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"412-424","source":"Crossref","is-referenced-by-count":0,"title":["The Parameterized Complexity of\u00a0the\u00a0Equidomination Problem"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Schaudt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Senger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"31_CR1","unstructured":"Benzaken, C., Hammer, P.: Linear separation of dominating sets in graphs. In: Bollobs, B. (ed.) Advances in Graph Theory, Annals of Discrete Mathematics, vol. 3, pp. 1\u201310. Elsevier (1978), \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167506008704928"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-35261-4_30","volume-title":"Algorithms and Computation","author":"A Brandst\u00e4dt","year":"2012","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 267\u2013277. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35261-4_30"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming \u2014 CAAP\u201994","author":"A Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 68\u201384. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/BFb0017474"},{"key":"31_CR4","first-page":"5","volume":"25","author":"A Finbow","year":"1988","unstructured":"Finbow, A., Hartnell, B., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones. Ars Combin. 25, 5\u201310 (1988)","journal-title":"Ars Combin."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Gutin, G., Zverovich, V.E.: Upper domination and upper irredundance perfect graphs. Discrete Math. 190(1), 95\u2013105 (1998). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X98000363","DOI":"10.1016\/S0012-365X(98)00036-3"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-662-53174-7_34","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"EJ Kim","year":"2016","unstructured":"Kim, E.J., Milani\u010d, M., Schaudt, O.: Recognizing k-equistable graphs in FPT time. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 487\u2013498. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53174-7_34"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-34611-8_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"VE Levit","year":"2012","unstructured":"Levit, V.E., Milani\u010d, M., Tankus, D.: On the recognition of k-equistable graphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 286\u2013296. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34611-8_29"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201(13), 189\u2013241 (1999). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X98003197","DOI":"10.1016\/S0012-365X(98)00319-7"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10479-010-0720-3","volume":"188","author":"M Milani\u010d","year":"2011","unstructured":"Milani\u010d, M., Orlin, J., Rudolf, G.: Complexity results for equistable graphs and related classes. Ann. Oper. Res. 188, 359\u2013370 (2011). \nhttps:\/\/doi.org\/10.1007\/s10479-010-0720-3","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(90)90286-Q","volume":"29","author":"C Payan","year":"1980","unstructured":"Payan, C.: A class of threshold and domishold graphs: equistable and equidominating graphs. Discrete Math. 29(1), 47\u201352 (1980). \nhttps:\/\/doi.org\/10.1016\/0012-365X(90)90286-Q","journal-title":"Discrete Math."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Rautenbach, D., Zverovich, V.: Perfect graphs of strong domination and independent strong domination. Discrete Math. 226(1), 297\u2013311 (2001). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X00001163","DOI":"10.1016\/S0012-365X(00)00116-3"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 634\u2013645. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70575-8_52"},{"issue":"2","key":"31_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/jgt.3190150202","volume":"15","author":"IE Zverovich","year":"1991","unstructured":"Zverovich, I.E., Zverovich, V.E.: A characterization of domination perfect graphs. J. Graph Theor. 15(2), 109\u2013114 (1991). \nhttps:\/\/doi.org\/10.1002\/jgt.3190150202","journal-title":"J. Graph Theor."}],"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\/978-3-319-68705-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:15:47Z","timestamp":1509516947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}