{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:05Z","timestamp":1725550025342},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_30","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:08:27Z","timestamp":1129802907000},"page":"375-389","source":"Crossref","is-referenced-by-count":10,"title":["Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/jgt.20041","volume":"48","author":"J.M. Byskov","year":"2005","unstructured":"Byskov, J.M.: On the Number of Maximal Bipartite Subgraphs of a Graph. Journal of Graph Theory\u00a048(2), 127\u2013135 (2005)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/0402004","volume":"2","author":"H. Choi","year":"1989","unstructured":"Choi, H., Nakajima, K., Rim, C.S.: Graph Bipartization and Via Minimization. SIAM Journal of Discrete Mathematics\u00a02(1), 38\u201347 (1989)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"30_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity for the Skeptic. In: The Proc. of 18th CCC, pp. 147\u2013169 (2003)","DOI":"10.1109\/CCC.2003.1214417"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, V., Yannakakis, M.: Approximate Max-Flow Min-(Multi) Cut Theorems and Their Applications. SIAM Journal on Computing\u00a025(2), 235\u2013251 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(02)00402-X","volume":"130","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Hirsch, E.A., Niedermeier, R., Rossmanith, P.: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics\u00a0130(2), 139\u2013155 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11534273_15","volume-title":"Algorithms and Data Structures","author":"J. Guo","year":"2005","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Neidermeier, R., Wernicke, S.: Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 158\u2013168. Springer, Heidelberg (2005)"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms\u00a01(1), 89\u2013102 (2003)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.4153\/CJM-1982-036-8","volume":"34","author":"S. Poljak","year":"1982","unstructured":"Poljak, S., Turzik, D.: A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem. Canad. J. Math.\u00a034(3), 519\u2013524 (1982)","journal-title":"Canad. J. Math."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Raman, V., Saurabh, S.: Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. In: The Proc. of 1st International Workshop on Exact and Parameterized Algorithms (IWPEC), pp. 260\u2013270 (2004)","DOI":"10.1007\/978-3-540-28639-4_23"},{"key":"30_CR11","unstructured":"Raman, V., Saurabh, S., Sikdar, S.: Exact Algorithms for Odd Cycle Transversal and Other Problems. Technical Report, IMSC-2005-06-16, The Institute of Mathematical Sciences (2005)"},{"key":"30_CR12","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. Operations Research Letters\u00a032, 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Rizzi, R., Bafna, V., Istrail, S., Lancia, G.: Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. In: The Proc of WABI, pp. 29\u201343 (2002)","DOI":"10.1007\/3-540-45784-4_3"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S. Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the Nonseparating Independent Set Problem and Feedback Set Problem for Graphs with no Vertex Degree Exceeding Three. Discrete Mathematics\u00a072, 355\u2013360 (1988)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jalgor.2004.01.001","volume":"51","author":"M. Wahlstr\u00f6m","year":"2004","unstructured":"Wahlstr\u00f6m, M.: Exact algorithms for finding minimum transversals in rank-3 hypergraphs. Journal of Algorithms\u00a051(2), 107\u2013121 (2004)","journal-title":"Journal of Algorithms"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G. Woeginger","year":"2003","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Zhunag, X., Pande, S.: Resolving Register Bank Conflicts for a Network Processor. In: Proc. of 12th PACT, pp. 260\u2013278 (2003)","DOI":"10.1109\/PACT.2003.1238022"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:20Z","timestamp":1619493200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11560586_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}