{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:37:16Z","timestamp":1743136636163,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_34","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"487-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recognizing k-equistable Graphs in FPT Time"],"prefix":"10.1007","author":[{"given":"Eun Jung","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"34_CR1","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. In: Proceedings of the Workshop on Studies in Integer Programming, Bonn (1975). Ann. of Discrete Math., 1, 145\u2013162. North-Holland, Amsterdam (1977)"},{"key":"34_CR2","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 - 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)"},{"key":"34_CR3","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","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, London (2013)"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-39890-5_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Kloks","year":"2003","unstructured":"Kloks, T., Lee, C.-M., Liu, J., M\u00fcller, H.: On the recognition of general partition graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 273\u2013283. Springer, Heidelberg (2003)"},{"issue":"1\u20133","key":"34_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(03)00397-4","volume":"132","author":"E Korach","year":"2003","unstructured":"Korach, E., Peled, U.N.: Equistable series-parallel graphs. Discrete Appl. Math. 132(1\u20133), 149\u2013162 (2003). Stability in graphs and related topics","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"34_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.dam.2006.06.018","volume":"156","author":"E Korach","year":"2008","unstructured":"Korach, E., Peled, U.N., Rotics, U.: Equistable distance-hereditary graphs. Discrete Appl. Math. 156(4), 462\u2013477 (2008)","journal-title":"Discrete Appl. Math."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.dam.2013.01.022","volume":"165","author":"VE Levit","year":"2014","unstructured":"Levit, V.E., Milani\u010d, M.: Equistable simplicial, very well-covered, and line graphs. Discrete Appl. Math. 165, 205\u2013212 (2014)","journal-title":"Discrete Appl. Math."},{"key":"34_CR8","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)"},{"key":"34_CR9","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold graphs and related topics. Ann. Discrete Math. 56. North-Holland Publishing Co., Amsterdam (1995)"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/jgt.3190180307","volume":"18","author":"NVR Mahadev","year":"1994","unstructured":"Mahadev, N.V.R., Peled, U.N., Sun, F.: Equistable graphs. J. Graph Theor. 18(3), 281\u2013299 (1994)","journal-title":"J. Graph Theor."},{"issue":"13","key":"34_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0012-365X(93)90512-R","volume":"113","author":"K McAvaney","year":"1993","unstructured":"McAvaney, K., Robertson, J., DeTemple, D.: A characterization and hereditary properties for partition graphs. Discrete Math. 113(13), 131\u2013142 (1993)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"34_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discrete Math."},{"issue":"11","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1016\/j.dam.2011.03.011","volume":"159","author":"\u0160 Miklavi\u010d","year":"2011","unstructured":"Miklavi\u010d, \u0160., Milani\u010d, M.: Equistable graphs, general partition graphs, triangle graphs, and graph products. Discrete Appl. Math. 159(11), 1148\u20131159 (2011)","journal-title":"Discrete Appl. Math."},{"key":"34_CR14","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)","journal-title":"Ann. Oper. Res."},{"key":"34_CR15","unstructured":"Milani\u010d, M., Rudolf, G.: Structural results for equistable graphs and related classes. RUTCOR Research Report 25-2009 (2009)"},{"key":"34_CR16","unstructured":"Milani\u010d, M., Trotignon, N.: Equistarable graphs and counterexamples to three conjectures onequistable graphs (2014). \n                      arXiv:1407.1670\n                      \n                     [math.CO]"},{"issue":"1","key":"34_CR17","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)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"34_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0166-218X(03)00401-3","volume":"132","author":"UN Peled","year":"2003","unstructured":"Peled, U.N., Rotics, U.: Equistable chordal graphs. Discrete Appl. Math. 132(1\u20133), 203\u2013210 (2003). Stability in graphs and related topics","journal-title":"Discrete Appl. Math."},{"key":"34_CR19","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.G., 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, Part I. LNCS, vol. 5125, pp. 634\u2013645. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:11:42Z","timestamp":1558314702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}