{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:51:50Z","timestamp":1743000710107,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_8","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"98-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Edge-Cut Width: An Algorithmically Driven Analogue of\u00a0Treewidth Based on\u00a0Edge Cuts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1929-055X","authenticated-orcid":false,"given":"Cornelius","family":"Brand","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9577-4142","authenticated-orcid":false,"given":"Esra","family":"Ceylan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7762-8045","authenticated-orcid":false,"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0881-8259","authenticated-orcid":false,"given":"Christian","family":"Hatschka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8038-905X","authenticated-orcid":false,"given":"Viktoriia","family":"Korchemna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"7","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1007\/s00224-020-09981-w","volume":"64","author":"M Bentert","year":"2020","unstructured":"Bentert, M., Haag, R., Hofer, C., Koana, T., Nichterlein, A.: Parameterized complexity of min-power asymmetric connectivity. Theory Comput. Syst. 64(7), 1158\u20131182 (2020)","journal-title":"Theory Comput. Syst."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c$${}^{\\text{k}}$$ n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","DOI":"10.1137\/130947374"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1137\/120903518","volume":"27","author":"HL Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J. Discret. Math. 27(4), 2108\u20132142 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bonnet, \u00c9., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width I: tractable FO model checking. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 601\u2013612. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00062"},{"key":"8_CR5","unstructured":"Bredereck, R., Heeger, K., Knop, D., Niedermeier, R.: Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. In: Lu, P., Zhang, G. (eds.) 30th International Symposium on Algorithms and Computation, ISAAC 2019, 8\u201311 December 2019, Shanghai University of Finance and Economics, Shanghai, China. LIPIcs, vol. 149, pp. 44:1\u201344:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"8_CR7","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":"8_CR8","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, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., et al.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2), 143\u2013153 (2011)","journal-title":"Inf. Comput."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-017-1199-3","volume":"171","author":"K Fleszar","year":"2017","unstructured":"Fleszar, K., Mnich, M., Spoerhase, J.: New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171, 433\u2013461 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1199-3","journal-title":"Math. Program."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discret. Math. Theor. Comput. Sci. 17(2), 77\u2013100 (2015). http:\/\/dmtcs.episciences.org\/2136","DOI":"10.46298\/dmtcs.2136"},{"issue":"7","key":"8_CR13","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.dam.2009.10.018","volume":"158","author":"R Ganian","year":"2010","unstructured":"Ganian, R., Hlinen\u00fd, P.: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discret. Appl. Math. 158(7), 851\u2013867 (2010)","journal-title":"Discret. Appl. Math."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-662-48054-0_29","volume-title":"Mathematical Foundations of Computer Science 2015","author":"R Ganian","year":"2015","unstructured":"Ganian, R., Kim, E.J., Szeider, S.: Algorithmic applications of tree-cut width. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 348\u2013360. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_29"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00453-020-00758-8","volume":"83","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Klute, F., Ordyniak, S.: On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica 83(1), 297\u2013336 (2021)","journal-title":"Algorithmica"},{"key":"8_CR16","unstructured":"Ganian, R., Korchemna, V.: The complexity of Bayesian network learning: Revisiting the superstructure. In: Proceedings of NeurIPS 2021, The Thirty-Fifth Conference on Neural Information Processing Systems (2021, to appear)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.artint.2017.12.006","volume":"257","author":"R Ganian","year":"2018","unstructured":"Ganian, R., Ordyniak, S.: The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257, 61\u201371 (2018)","journal-title":"Artif. Intell."},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/s00453-020-00772-w","volume":"83","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Ordyniak, S.: The power of cut-based parameters for computing edge-disjoint paths. Algorithmica 83(2), 726\u2013752 (2021)","journal-title":"Algorithmica"},{"issue":"6","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1007\/s00453-020-00795-3","volume":"83","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Ordyniak, S., Ramanujan, M.S.: On structural parameterizations of the edge disjoint paths problem. Algorithmica 83(6), 1605\u20131637 (2021)","journal-title":"Algorithmica"},{"key":"8_CR20","unstructured":"Giannopoulou, A.C., Kwon, O., Raymond, J., Thilikos, D.M.: Lean tree-cut decompositions: obstructions and algorithms. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, 13\u201316 March 2019. LIPIcs, vol. 126, pp. 32:1\u201332:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.jcss.2021.07.005","volume":"123","author":"PA Golovach","year":"2022","unstructured":"Golovach, P.A., Komusiewicz, C., Kratsch, D., Le, V.B.: Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123, 76\u2013102 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2017.06.013","volume":"690","author":"D G\u00f6z\u00fcpek","year":"2017","unstructured":"G\u00f6z\u00fcpek, D., \u00d6zkan, S., Paul, C., Sau, I., Shalom, M.: Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690, 91\u2013103 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1137\/15M1034337","volume":"30","author":"GZ Gutin","year":"2016","unstructured":"Gutin, G.Z., Jones, M., Wahlstr\u00f6m, M.: The mixed Chinese postman problem parameterized by pathwidth and treedepth. SIAM J. Discret. Math. 30(4), 2177\u20132205 (2016)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-016-0245-5","volume":"80","author":"EJ Kim","year":"2018","unstructured":"Kim, E.J., Oum, S., Paul, C., Sau, I., Thilikos, D.M.: An FPT 2-approximation for tree-cut decomposition. Algorithmica 80(1), 116\u2013135 (2018)","journal-title":"Algorithmica"},{"key":"8_CR25","unstructured":"Korhonen, T.: Single-exponential time 2-approximation algorithm for treewidth. CoRR abs\/2104.07463 (2021). https:\/\/arxiv.org\/abs\/2104.07463"},{"key":"8_CR26","unstructured":"Magne, L., Paul, C., Sharma, A., Thilikos, D.M.: Edge-treewidth: algorithmic and combinatorial properties. CoRR abs\/2112.07524 (2021)"},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/130924056","volume":"28","author":"D Marx","year":"2014","unstructured":"Marx, D., Wollan, P.: Immersions in highly edge connected graphs. SIAM J. Discret. Math. 28(1), 503\u2013520 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-60440-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Nederlof","year":"2020","unstructured":"Nederlof, J., Pilipczuk, M., Swennenhuis, C.M.F., W\u0119grzycki, K.: Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 27\u201339. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_3"},{"key":"8_CR29","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity. Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4"},{"issue":"1","key":"8_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435385","volume":"5","author":"S Oum","year":"2008","unstructured":"Oum, S.: Approximating rank-width and clique-width quickly. ACM Trans. Algorithms 5(1), 1\u201320 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"8_CR31","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jcss.2009.04.003","volume":"76","author":"M Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci. 76(2), 103\u2013114 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR33","unstructured":"Scheffler, P.: Practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical report TR 396\/1994. FU Berlin, Fachbereich 3 Mathematik (1994)"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jctb.2014.07.003","volume":"110","author":"P Wollan","year":"2015","unstructured":"Wollan, P.: The structure of graphs not admitting a fixed immersion. J. Comb. Theory Ser. B 110, 47\u201366 (2015)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:17:02Z","timestamp":1664536622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}