{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:06:22Z","timestamp":1742929582148,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596044"},{"type":"electronic","value":"9783319596051"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_13","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T15:06:26Z","timestamp":1495465586000},"page":"139-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[]},{"given":"Shouwei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Markarian","sequence":"additional","affiliation":[]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Podlipyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-319-48749-6_35","volume-title":"Combinatorial Optimization and Applications","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Li, S., Markarian, C., Meyer auf der Heide, F., Podlipyan, P.: On the parameterized parallel complexity and the vertex cover problem. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 477\u2013488. Springer, Cham (2016). doi:10.1007\/978-3-319-48749-6_35"},{"key":"13_CR2","unstructured":"Bodlaender, H., Downey, R., Fellows, M.: Applications of parameterized complexity to problems of parallel and distributed computation (1994, unpublished extended abstract)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11917496_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"HL Bodlaender","year":"2006","unstructured":"Bodlaender, H.L.: Treewidth: characterizations, applications, and computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 1\u201314. Springer, Heidelberg (2006). doi:10.1007\/11917496_1"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"39","key":"13_CR5","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1016\/j.tcs.2011.05.022","volume":"412","author":"B-M Bui-Xuan","year":"2011","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. Theoret. Comput. Sci. 412(39), 5187\u20135204 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/BFb0057945","volume-title":"Euro-Par 1998 Parallel Processing","author":"M Cesati","year":"1998","unstructured":"Cesati, M., Di Ianni, M.: Parameterized parallel complexity. In: Pritchard, D., Reeve, J. (eds.) Euro-Par 1998. LNCS, vol. 1470, pp. 892\u2013896. Springer, Heidelberg (1998). doi:10.1007\/BFb0057945"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.-C.: Partitive hypergraphs. Discret. Math. 37(1), 35\u201350 (1981)","journal-title":"Discret. Math."},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-60618-1_83","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Dahlhaus","year":"1995","unstructured":"Dahlhaus, E.: Efficient parallel modular decomposition (extended abstract). In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 290\u2013302. Springer, Heidelberg (1995). doi:10.1007\/3-540-60618-1_83"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Clique-width: on the price of generality. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 825\u2013834. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611973068.90"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Algorithmic lower bounds for problems parameterized by clique-width. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 493\u2013502. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.42"},{"issue":"5","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 163\u2013176. Springer, Cham (2013). doi:10.1007\/978-3-319-03898-8_15"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-32589-2_38","volume-title":"Mathematical Foundations of Computer Science 2012","author":"R Ganian","year":"2012","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Ne\u0161et\u0159il, J., Obdr\u017e\u00e1lek, J., Ossona de Mendez, P., Ramadurai, R.: When trees grow low: shrubs and fast MSO$$_1$$. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 419\u2013430. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32589-2_38"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/jcss.1998.1592","volume":"57","author":"T Hagerup","year":"1998","unstructured":"Hagerup, T., Katajainen, J., Nishimura, N., Ragde, P.: Characterizing multiterminal flow networks and computing flows in networks of small treewidth. J. Comput. Syst. Sci. 57(3), 366\u2013375 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.1996.0002","volume":"20","author":"J Lagergren","year":"1996","unstructured":"Lagergren, J.: Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms 20(1), 20\u201344 (1996)","journal-title":"J. Algorithms"},{"key":"13_CR18","unstructured":"Miller, G.L., Reif, J.H.: Parallel tree contraction-part I: fundamentals (1989)"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02088292","volume":"22","author":"S Miyano","year":"1989","unstructured":"Miyano, S.: The lexicographically first maximal subgraph problems: P-completeness and NC algorithms. Math. Syst. Theory 22(1), 47\u201373 (1989)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S-I Oum","year":"2005","unstructured":"Oum, S.-I.: Rank-width and vertex-minors. J. Comb. Theory Ser. B 95(1), 79\u2013100 (2005)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:26:20Z","timestamp":1710343580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}