{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T13:22:23Z","timestamp":1755696143309,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_19","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"257-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parameterized Complexity of\u00a0Weighted Multicut in\u00a0Trees"],"prefix":"10.1007","author":[{"given":"Esther","family":"Galby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5686-8314","authenticated-orcid":false,"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5810-7949","authenticated-orcid":false,"given":"Philipp","family":"Schepper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2212-1359","authenticated-orcid":false,"given":"Roohani","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9753-0523","authenticated-orcid":false,"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/140961808","volume":"47","author":"N Bousquet","year":"2018","unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S.: Multicut is FPT. SIAM J. Comput. 47(1), 166\u2013207 (2018). https:\/\/doi.org\/10.1137\/140961808","journal-title":"SIAM J. Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Daligault, J., Thomass\u00e9, S., Yeo, A.: A polynomial kernel for multicut in trees. In: Albers, S., Marion, J. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, 26\u201328 February 2009, Freiburg, Germany, Proceedings. LIPIcs, vol. 3, pp. 183\u2013194. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2009). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2009.1824","DOI":"10.4230\/LIPIcs.STACS.2009.1824"},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1016\/j.jcss.2012.03.001","volume":"78","author":"J Chen","year":"2012","unstructured":"Chen, J., Fan, J.H., Kanj, I., Liu, Y., Zhang, F.: Multicut in trees viewed through the eyes of vertex cover. J. Comput. Syst. Sci. 78(5), 1637\u20131650 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s00453-016-0139-6","volume":"78","author":"R Chitnis","year":"2016","unstructured":"Chitnis, R., Egri, L., Marx, D.: List H-coloring a graph by removing few vertices. Algorithmica 78(1), 110\u2013146 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0139-6","journal-title":"Algorithmica"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2700209","volume":"11","author":"RH Chitnis","year":"2015","unstructured":"Chitnis, R.H., Cygan, M., Hajiaghayi, M.T., Marx, D.: Directed subset feedback vertex set is fixed-parameter tractable. ACM Trans. Algorithms 11(4), 28:1-28:28 (2015). https:\/\/doi.org\/10.1145\/2700209","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/12086217X","volume":"42","author":"RH Chitnis","year":"2013","unstructured":"Chitnis, R.H., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SIAM J. Comput. 42(4), 1674\u20131696 (2013). https:\/\/doi.org\/10.1137\/12086217X","journal-title":"SIAM J. Comput."},{"key":"19_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994). https:\/\/doi.org\/10.1137\/S0097539792225297","journal-title":"SIAM J. Comput."},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Galby, E., Marx, D., Schepper, P., Sharma, R., Tale, P.: Parameterized complexity of weighted multicut in trees. CoRR abs\/2205.10105 (2022). https:\/\/doi.org\/10.48550\/arXiv.2205.10105","DOI":"10.48550\/arXiv.2205.10105"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3\u201320 (1997). https:\/\/doi.org\/10.1007\/BF02523685","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/net.20081","volume":"46","author":"J Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R.: Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3), 124\u2013135 (2005). https:\/\/doi.org\/10.1002\/net.20081","journal-title":"Networks"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jda.2005.07.005","volume":"4","author":"J Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. J. Discrete Algorithms 4(4), 608\u2013622 (2006). https:\/\/doi.org\/10.1016\/j.jda.2005.07.005","journal-title":"J. Discrete Algorithms"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-12691-3_22","volume-title":"Combinatorial Optimization and Applications","author":"I Kanj","year":"2014","unstructured":"Kanj, I., et al.: Algorithms for cut problems on trees. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 283\u2013298. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12691-3_22"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Kim, E.J., Kratsch, S., Pilipczuk, M., Wahlstr\u00f6m, M.: Solving hard cut problems via flow-augmentation. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10\u201313 January 2021, pp. 149\u2013168. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.11","DOI":"10.1137\/1.9781611976465.11"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Kim, E.J., Kratsch, S., Pilipczuk, M., Wahlstr\u00f6m, M.: Directed flow-augmentation. In: Leonardi, S., Gupta, A. (eds.) STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, 20\u201324 June 2022, pp. 938\u2013947. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520018 Full version: arXiv:2111.03450","DOI":"10.1145\/3519935.3520018"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/120904202","volume":"29","author":"S Kratsch","year":"2015","unstructured":"Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlstr\u00f6m, M.: Fixed-parameter tractability of multicut in directed acyclic graphs. SIAM J. Discret. Math. 29(1), 122\u2013144 (2015). https:\/\/doi.org\/10.1137\/120904202","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3390887","volume":"67","author":"S Kratsch","year":"2020","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Representative sets and irrelevant vertices: new tools for kernelization. J. ACM 67(3), 16:1-16:50 (2020). https:\/\/doi.org\/10.1145\/3390887","journal-title":"J. ACM"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.ic.2012.10.016","volume":"222","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Marx, D.: Clustering with local restrictions. Inf. Comput. 222, 278\u2013292 (2013). https:\/\/doi.org\/10.1016\/j.ic.2012.10.016","journal-title":"Inf. Comput."},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-642-31594-7_63","volume-title":"Automata, Languages, and Programming","author":"D Lokshtanov","year":"2012","unstructured":"Lokshtanov, D., Ramanujan, M.S.: Parameterized tractability of multiway cut with parity constraints. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 750\u2013761. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_63"},{"issue":"3","key":"19_CR20","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351(3), 394\u2013406 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2005.10.007","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/110855247","volume":"43","author":"D Marx","year":"2014","unstructured":"Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. SIAM J. Comput. 43(2), 355\u2013388 (2014). https:\/\/doi.org\/10.1137\/110855247","journal-title":"SIAM J. Comput."},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/BFb0036950","volume-title":"Automata, Languages and Programming","author":"M Yannakakis","year":"1983","unstructured":"Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.S., Papadimitriou, C.H.: Cutting and partitioning a graph after a fixed pattern. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 712\u2013722. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036950"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:17:45Z","timestamp":1664536665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_19","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)"}}]}}