{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:31Z","timestamp":1725793831264},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_13","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T07:50:30Z","timestamp":1400313030000},"page":"150-161","source":"Crossref","is-referenced-by-count":3,"title":["Finding Small Stabilizers for Unstable Graphs"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Bock","sequence":"first","affiliation":[]},{"given":"Karthekeyan","family":"Chandrasekaran","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"K\u00f6nemann","sequence":"additional","affiliation":[]},{"given":"Britta","family":"Peis","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: O(\n                  \n                    \n                  \n                  $\\sqrt{ \\log n}$\n                ) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4007\/annals.2009.170.371","volume":"170","author":"N. Alon","year":"2009","unstructured":"Alon, N., Shapira, A., Sudakov, B.: Additive approximation for edge-deletion problems. Annals of Mathematics\u00a0170, 371\u2013411 (2009)","journal-title":"Annals of Mathematics"},{"key":"13_CR3","first-page":"1","volume":"11","author":"E. Balas","year":"1981","unstructured":"Balas, E.: Integer and fractional matchings. Annals of Discrete Mathematics\u00a011, 1\u201313 (1981)","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR4","unstructured":"Balinski, M.L.: On maximum matching, minimum covering and their connections. In: Proceedings of the Princeton Symposium on Mathematical Programming (1970)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M., Immorlica, N., Mahini, H.: The cooperative game theory foundations of network bargaining games. In: Proc., International Colloquium on Automata, Languages and Processing, pp. 67\u201378 (2010)","DOI":"10.1007\/978-3-642-14165-2_7"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-34611-8_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P. Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Bomhoff, M., Golovach, P.A., Kern, W., Paulusma, D.: Solutions for the stable roommates problem with payments. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 69\u201380. Springer, Heidelberg (2012)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bock, A., Chandrasekaran, K., K\u00f6nemann, J., Peis, B., Sanit\u00e0, L.: Finding small stabilizers for unstable graphs, Full version in preparation (2014)","DOI":"10.1007\/978-3-319-07557-0_13"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. In: Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2011)","DOI":"10.2200\/S00355ED1V01Y201107AIM016"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D. Hochbaum","year":"1982","unstructured":"Hochbaum, D.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing\u00a011(3), 555\u2013556 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-Prover 1-Round games. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/510014.510017"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Balanced outcomes in social exchange networks. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 295\u2013304 (2008)","DOI":"10.1145\/1374376.1376994"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Larson, K., Steiner, D.: Network bargaining: Using approximate blocking sets to stabilize unstable instances. In: Proceedings of the Symposium on Algorithmic Game Theory, pp. 216\u2013226 (2012)","DOI":"10.1007\/978-3-642-33996-7_19"},{"key":"13_CR13","unstructured":"Korach, E.: Flowers and Trees in a Ballet of K\n                4, or a Finite Basis Characterization of Non-K\u00f6nig-Egerv\u00e1ry Graphs, Tech. Report 115, IBM Israel Scientific Center (1982)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Korach, E., Nguyen, T., Peis, B.: Subgraph characterization of Red\/Blue-Split Graph and K\u00f6nig Egerv\u00e1ry Graphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 842\u2013850 (2006)","DOI":"10.1145\/1109557.1109650"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s00453-010-9412-2","volume":"61","author":"S. Mishra","year":"2011","unstructured":"Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The complexity of K\u00f6nig subgraph problems and above-guarantee vertex cover. Algorithmica\u00a061(4), 857\u2013881 (2011)","journal-title":"Algorithmica"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J. Nash","year":"1950","unstructured":"Nash, J.: The bargaining problem. Econometrica\u00a018, 155\u2013162 (1950)","journal-title":"Econometrica"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0166-218X(87)90053-9","volume":"16","author":"W.R. Pulleyblank","year":"1987","unstructured":"Pulleyblank, W.R.: Fractional matchings and the edmonds-gallai theorem. Discrete Appl. Math.\u00a016, 51\u201358 (1987)","journal-title":"Discrete Appl. Math."},{"key":"13_CR18","volume-title":"Combinatorial optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Springer, New York (2003)"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1971","unstructured":"Shapley, L.S., Shubik, M.: The assignment game: the core. International Journal of Game Theory\u00a01(1), 111\u2013130 (1971)","journal-title":"International Journal of Game Theory"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Sterboul, F.: A characterization of the graphs in which the transversal number equals the matching number. J.\u00a0Combin. Theory Ser.\u00a0B, 228\u2013229 (1979)","DOI":"10.1016\/0095-8956(79)90085-6"},{"key":"13_CR21","first-page":"13","volume":"3","author":"J.P. Uhry","year":"1975","unstructured":"Uhry, J.P.: Sur le probl\u00e8me du couplage maximal. RAIRO\u00a03, 13\u201320 (1975)","journal-title":"RAIRO"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:25:32Z","timestamp":1558891532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}