{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:00Z","timestamp":1725453780796},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_39","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:31:28Z","timestamp":1368750688000},"page":"434-445","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Balanced Subgraph Problem Parameterized above Lower Bound"],"prefix":"10.1007","author":[{"given":"Robert","family":"Crowston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Muciaccia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCAD.2006.882642","volume":"26","author":"C. Chiang","year":"2007","unstructured":"Chiang, C., Kahng, A.B., Sinha, S., Xu, X., Zelikovsky, A.Z.: Fast and efficient bright-field AAPSM conflict detection and correction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a026(1), 11\u2013126 (2007)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"39_CR2","unstructured":"Crowston, R., Fellows, M., Gutin, G., Jones, M., Rosamond, F., Thomass\u00e9, S., Yeo, A.: Simultaneously Satisfying Linear Equations Over \n                    \n                      \n                    \n                    $\\mathbb{F}_2$\n                  : MaxLin2 and Max-r-Lin2 Parameterized Above Average. In: FSTTCS 2011. LIPICS, vol.\u00a013, pp. 229\u2013240 (2011)"},{"key":"39_CR3","unstructured":"Crowston, R., Gutin, G., Jones, M.: Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turz\u00edk Bound. In: FSTTCS 2012. LIPICS, vol.\u00a018, pp. 400\u2013411 (2012)"},{"key":"39_CR4","unstructured":"Crowston, R., Gutin, G., Jones, M., Muciaccia, G.: Maximum Balanced Subgraph Problem Parameterized Above Lower Bound. arXiv:1212.6848"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-31594-7_21","volume-title":"Automata, Languages, and Programming","author":"R. Crowston","year":"2012","unstructured":"Crowston, R., Jones, M., Mnich, M.: Max-Cut Parameterized above the Edwards-Erd\u0151s Bound. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 242\u2013253. Springer, Heidelberg (2012)"},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.biosystems.2006.08.001","volume":"90","author":"B. DasGupta","year":"2007","unstructured":"DasGupta, B., Enciso, G.A., Sontag, E.D., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. Biosystems\u00a090(1), 161\u2013178 (2007)","journal-title":"Biosystems"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"39_CR8","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0166-218X(03)00361-5","volume":"137","author":"N. G\u00fclp\u0131nar","year":"2004","unstructured":"G\u00fclp\u0131nar, N., Gutin, G., Mitra, G., Zverovitch, A.: Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs. Discrete Applied Mathematics\u00a0137, 359\u2013372 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR10","first-page":"58","volume":"6","author":"G. Gutin","year":"2003","unstructured":"Gutin, G., Zverovitch, A.: Extracting pure network submatrices in linear programs using signed graphs, Part 2. Communications of DQM\u00a06, 58\u201365 (2003)","journal-title":"Communications of DQM"},{"issue":"2","key":"39_CR11","doi-asserted-by":"publisher","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.\u00a02(2), 143\u2013146 (1953)","journal-title":"Michigan Math. J."},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-72845-0_23","volume-title":"Experimental Algorithms","author":"F. H\u00fcffner","year":"2007","unstructured":"H\u00fcffner, F., Betzler, N., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 297\u2013310. Springer, Heidelberg (2007)"},{"key":"39_CR13","unstructured":"Mnich, M., Philip, G., Saurabh, S., Such\u00fd, O.: Beyond Max-Cut: \u03bb-Extendible Properties Parameterized Above the Poljak-Turz\u00edk Bound. In: FSTTCS 2012. LIPICS, vol.\u00a018, pp. 412\u2013423 (2012)"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, Oxford UP (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"39_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0012-365X(86)90192-5","volume":"58","author":"S. Poljak","year":"1986","unstructured":"Poljak, S., Turz\u00edk, D.: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Discrete Mathematics\u00a058(1), 99\u2013104 (1986)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci.\u00a0351(3), 446\u2013458 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR17","unstructured":"Zaslavsky, T.: Bibliography of signed and gain graphs. Electronic Journal of Combinatorics, DS8 (1998)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:16:47Z","timestamp":1557699407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}