{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:53Z","timestamp":1742913173751,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_23","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T16:39:25Z","timestamp":1474994365000},"page":"269-281","source":"Crossref","is-referenced-by-count":0,"title":["A Faster Parameterized Algorithm for Group Feedback Edge Set"],"prefix":"10.1007","author":[{"given":"M. S.","family":"Ramanujan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-007-9130-6","volume":"55","author":"J Chen","year":"2009","unstructured":"Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1), 1\u201313 (2009)","journal-title":"Algorithmica"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Chitnis, R.H., Cygan, M., Hajiaghayi, M., Pilipczuk, M., Pilipczuk, M.: Designing FPT algorithms for cut problems using randomized contractions. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20\u201323 October 2012, pp. 460\u2013469 (2012)","DOI":"10.1109\/FOCS.2012.29"},{"key":"23_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1007\/s00453-014-9966-5","volume":"74","author":"M Cygan","year":"2016","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M.: On group feedback vertex set parameterized by the size of the cutset. Algorithmica 74(2), 630\u2013642 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"23_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2462896.2462899","volume":"5","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: On multiway cut parameterized above lower bounds. TOCT 5(1), 3 (2013)","journal-title":"TOCT"},{"issue":"4","key":"23_CR6","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Comput."},{"key":"23_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"23_CR8","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"issue":"1","key":"23_CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.jctb.2008.07.003","volume":"99","author":"J Geelen","year":"2009","unstructured":"Geelen, J., Gerards, B.: Excluding a group-labelled graph. J. Comb. Theory Ser. B 99(1), 247\u2013253 (2009)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"23_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.disopt.2010.05.003","volume":"8","author":"S Guillemot","year":"2011","unstructured":"Guillemot, S.: FPT algorithms for path-transversal and cycle-transversal problems. Discrete Optim. 8(1), 61\u201371 (2011)","journal-title":"Discrete Optim."},{"issue":"2","key":"23_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed graph. Michigan Math. J. 2(2), 143\u2013146 (1953)","journal-title":"Michigan Math. J."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Iwata, Y., Oka, K., Yoshida, Y.: Linear-time FPT algorithms via network flow. In: SODA, pp. 1749\u20131761 (2014)","DOI":"10.1137\/1.9781611973402.127"},{"key":"23_CR13","unstructured":"Iwata, Y., Wahlstr\u00f6m, M., Yoshida, Y.: Half-integrality, lp-branching and FPT algorithms (2013). CoRR, abs\/1310.2841"},{"issue":"2","key":"23_CR14","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.jctb.2005.08.001","volume":"96","author":"K Kawarabayashi","year":"2006","unstructured":"Kawarabayashi, K., Wollan, P.: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theory, Ser. B 96(2), 296\u2013301 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"23_CR15","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/2566616","volume":"11","author":"D Lokshtanov","year":"2014","unstructured":"Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms 11(2), 15:1\u201315:31 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"23_CR16","doi-asserted-by":"crossref","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)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"GL Nemhauser","year":"1974","unstructured":"Nemhauser, G.L., Trotter Jr., L.E.: Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48\u201361 (1974)","journal-title":"Math. Program."},{"key":"23_CR18","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Ramanujan, M.S., Saurabh, S.: Linear time parameterized algorithms via skew-symmetric multicuts. In: SODA, pp. 1739\u20131748 (2014)","DOI":"10.1137\/1.9781611973402.126"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Wahlstr\u00f6m, M.: Half-integrality, lp-branching and FPT algorithms. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 1762\u20131781 (2014)","DOI":"10.1137\/1.9781611973402.128"},{"issue":"1","key":"23_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00493-011-2551-5","volume":"31","author":"P Wollan","year":"2011","unstructured":"Wollan, P.: Packing cycles with modularity constraints. Combinatorica 31(1), 95\u2013126 (2011)","journal-title":"Combinatorica"}],"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-662-53536-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T08:09:58Z","timestamp":1657354198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}