{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:19Z","timestamp":1725798679881},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_39","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"457-468","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Approximations via d-Skew-Symmetric Multicut"],"prefix":"10.1007","author":[{"given":"Sudeshna","family":"Kolay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranabendu","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: $O(\\sqrt{\\log n})$ approximation algorithms for min uncut, min 2cnf deletion, and directed cut problems. In: STOC, pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Sidiropoulos, A.: Approximation algorithms for euler genus and related problems. In: FOCS, pp. 167\u2013176 (2013)","DOI":"10.1109\/FOCS.2013.26"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Makarychev, Y., Sidiropoulos, A.: On graph crossing number and edge planarization. In: Randall, D. (ed.) SODA, pp. 1050\u20131069. SIAM (2011)","DOI":"10.1137\/1.9781611973082.80"},{"issue":"2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canadian J. Math."},{"key":"39_CR6","unstructured":"Gaspers, S., Ordyniak, S., Ramanujan, M.S., Saurabh, S., Szeider, S.: Backdoors to q-horn. In: STACS, pp. 67\u201379 (2013)"},{"issue":"3","key":"39_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01261321","volume":"16","author":"A.V. Goldberg","year":"1996","unstructured":"Goldberg, A.V., Karzanov, A.V.: Path problems in skew-symmetric graphs. Combinatorica\u00a016(3), 353\u2013382 (1996)","journal-title":"Combinatorica"},{"issue":"3","key":"39_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10107-004-0505-z","volume":"100","author":"A.V. Goldberg","year":"2004","unstructured":"Goldberg, A.V., Karzanov, A.V.: Maximum skew-symmetric flows and matchings. Math. Program.\u00a0100(3), 537\u2013568 (2004)","journal-title":"Math. Program."},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-73420-8_33","volume-title":"Automata, Languages and Programming","author":"M. Grohe","year":"2007","unstructured":"Grohe, M., Gr\u00fcber, M.: Parameterized approximability of the disjoint cycle problem. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 363\u2013374. Springer, Heidelberg (2007)"},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.I.: Finding branch-decompositions and rank-decompositions. SIAM J. Comput.\u00a038(3), 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"key":"39_CR11","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":"39_CR12","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Representative sets and irrelevant vertices: New tools for kernelization. In: FOCS, pp. 450\u2013459 (2012)","DOI":"10.1109\/FOCS.2012.46"},{"issue":"3","key":"39_CR13","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.\u00a0351(3), 394\u2013406 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR14","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"},{"issue":"4","key":"39_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B. Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett.\u00a032(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.4153\/CJM-1967-101-8","volume":"19","author":"W.T. Tutte","year":"1967","unstructured":"Tutte, W.T.: Antisymmetrical digraphs. Canadian J. Math.\u00a019, 1101\u20131117 (1967)","journal-title":"Canadian J. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T20:36:13Z","timestamp":1565728573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}