乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:04:45Z","timestamp":1725674685903},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_35","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T10:19:29Z","timestamp":1334053169000},"page":"408-419","source":"Crossref","is-referenced-by-count":2,"title":["New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting"],"prefix":"10.1007","author":[{"given":"Archontia C.","family":"Giannopoulou","sequence":"first","affiliation":[]},{"given":"Sudeshna","family":"Kolay","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving max-r-sat above a tight lower bound. In: SODA, pp. 511\u2013517 (2010)","DOI":"10.1137\/1.9781611973075.44"},{"key":"35_CR2","series-title":"Bolyai Soc. Math. Stud.","first-page":"185","volume-title":"Contemporary Combinatorics","author":"B. Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Better bounds for Max Cut. In: Contemporary Combinatorics. Bolyai Soc. Math. Stud., vol.\u00a010, pp. 185\u2013246. J\u00e1nos Bolyai Math. Soc., Budapest (2002)"},{"key":"35_CR3","unstructured":"Crowston, R., Fellows, M.R., Gutin, G., Jones, M., Rosamond, F.A., Thomass\u00e9, S., Yeo, A.: Simultaneously satisfying linear equations over F\n 2: Maxlin2 and max-r-lin2 parameterized above average. In: FSTTCS. LIPIcs, vol.\u00a013, pp. 229\u2013240 (2011)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-13731-0_17","volume-title":"Algorithm Theory - SWAT 2010","author":"R. Crowston","year":"2010","unstructured":"Crowston, R., Gutin, G., Jones, M., Kim, E.J., Ruzsa, I.Z.: Systems of Linear Equations over \n \n \n \n $\\mathbb{F}_2$\n and Problems Parameterized above Average. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 164\u2013175. Springer, Heidelberg (2010)"},{"key":"35_CR5","series-title":"LNCS","first-page":"184","volume-title":"LATIN","author":"R. Crowston","year":"2012","unstructured":"Crowston, R., Gutin, G., Jones, M., Raman, V., Saurabh, S.: Parameterized complexity of maxSat above average. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 184\u2013194. Springer, Heidelberg (2012)"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-39890-5_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Dehne","year":"2003","unstructured":"Dehne, F., Fellows, M.R., Rosamond, F.A.: An FPT Algorithm for Set Splitting. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 180\u2013191. Springer, Heidelberg (2003)"},{"key":"35_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"C.S. Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite subgraphs. Canad. J. Math.\u00a025, 475\u2013485 (1973)","journal-title":"Canad. J. Math."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02760037","volume":"3","author":"P. Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P.: On some extremal problems in graph theory. Israel J. Math.\u00a03, 113\u2013116 (1965)","journal-title":"Israel J. Math."},{"key":"35_CR10","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":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0166-218X(02)00463-8","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Applied Mathematics\u00a0131(2), 373\u2013383 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.jcss.2010.06.001","volume":"77","author":"G. Gutin","year":"2011","unstructured":"Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci.\u00a077(2), 422\u2013429 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-15775-2_28","volume-title":"Algorithms \u2013 ESA 2010","author":"G. Gutin","year":"2010","unstructured":"Gutin, G., van Iersel, L., Mnich, M., Yeo, A.: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 326\u2013337. Springer, Heidelberg (2010)"},{"issue":"4","key":"35_CR14","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR15","series-title":"LNCS","first-page":"118","volume-title":"IPEC","author":"E.J. Kim","year":"2012","unstructured":"Kim, E.J., Williams, R.: Improved Parameterized Algorithms for above Average Constraint Satisfaction. In: Rossmanith, P. (ed.) IPEC 2011. LNCS, vol.\u00a07112, pp. 118\u2013131. Springer, Heidelberg (2012)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-11269-0_24","volume-title":"Parameterized and Exact Computation","author":"D. Lokshtanov","year":"2009","unstructured":"Lokshtanov, D., Saurabh, S.: Even Faster Algorithm for Set Splitting! In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 288\u2013299. Springer, Heidelberg (2009)"},{"issue":"2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: Maxsat and maxcut. J. Algorithms\u00a031(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"35_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M. Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci.\u00a075(2), 137\u2013153 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-17493-3_20","volume-title":"Parameterized and Exact Computation","author":"J. Nederlof","year":"2010","unstructured":"Nederlof, J., van Rooij, J.M.M.: Inclusion\/Exclusion Branching for Partial Dominating Set and Set Splitting. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 204\u2013215. Springer, Heidelberg (2010)"},{"key":"35_CR20","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"publisher","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.\u00a031. Oxford University Press, Oxford (2006)"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R.: Some topics in analysis of boolean functions. In: STOC, pp. 569\u2013578 (2008)","DOI":"10.1145\/1374376.1374458"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:35:36Z","timestamp":1620113736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}