{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:30Z","timestamp":1725563730072},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_23","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"267-277","source":"Crossref","is-referenced-by-count":5,"title":["Feedback Vertex Sets in Tournaments"],"prefix":"10.1007","author":[{"given":"Serge","family":"Gaspers","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF00649265","volume":"1","author":"J.S. Banks","year":"1985","unstructured":"Banks, J.S.: Sophisticated voting outcomes and agenda control. Soc. Choice Welfare\u00a01(4), 295\u2013306 (1985)","journal-title":"Soc. Choice Welfare"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion\u2013exclusion. SIAM J. Comput.\u00a039(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"23_CR3","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J.M. Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett.\u00a032(6), 547\u2013556 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/jgt.20041","volume":"48","author":"J.M. Byskov","year":"2005","unstructured":"Byskov, J.M., Madsen, B.A., Skjernaa, B.: On the number of maximal bipartite subgraphs of a graph. J. Graph Theory\u00a048(2), 127\u2013132 (2005)","journal-title":"J. Graph Theory"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.jda.2009.08.001","volume":"8","author":"M. Dom","year":"2010","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R., Truss, A.: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms\u00a08(1), 320\u2013331 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"23_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small maximal independent sets and faster exact graph coloring. J. Graph. Algorithms Appl.\u00a07(2), 131\u2013140 (2003)","journal-title":"J. Graph. Algorithms Appl."},{"issue":"7-9","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.tcs.2009.11.012","volume":"411","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Gaspers, S., Kratsch, D., Liedloff, M., Saurabh, S.: Iterative compression and exact algorithms. Theor. Comput. Sci.\u00a0411(7-9), 1045\u20131053 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica\u00a052(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms\u00a05(1), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-70575-8_18","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 210\u2013221. Springer, Heidelberg (2008)"},{"key":"23_CR11","unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proc. of STACS 2010, LIPIcs. Schloss Dagstuhl - Leibniz Center of Informatics (2010)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-92248-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Gaspers","year":"2008","unstructured":"Gaspers, S., Kratsch, D., Liedloff, M.: On independent sets and bicliques in graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 171\u2013182. Springer, Heidelberg (2008)"},{"key":"23_CR13","unstructured":"Gaspers, S., Mnich, M.: On feedback vertex sets in tournaments. arXiv Technical Report (May 2009), \n                    \n                      http:\/\/arxiv.org\/abs\/0905.0567"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11944836_15","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"S. Gupta","year":"2006","unstructured":"Gupta, S., Raman, V., Saurabh, S.: Fast exponential algorithms for maximum r-regular induced subgraph problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 139\u2013151. Springer, Heidelberg (2006)"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.2307\/2315334","volume":"73","author":"F. Harary","year":"1966","unstructured":"Harary, F., Moser, L.: The theory of round robin tournaments. Amer. Math. Monthly\u00a073(3), 231\u2013246 (1966)","journal-title":"Amer. Math. Monthly"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02476378","volume":"15","author":"H.G. Landau","year":"1953","unstructured":"Landau, H.G.: On dominance relations and the structure of animal societies. III. The condition for a score structure. Bull. Math. Biophys.\u00a015, 143\u2013148 (1953)","journal-title":"Bull. Math. Biophys."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Information Processing Letters\u00a05(3), 66\u201367 (1976)","journal-title":"Information Processing Letters"},{"key":"23_CR18","unstructured":"Miller, R.E., Muller, D.E.: A problem of maximum consistent subsets. IBM Research Report RC-240, J. T. Watson Research Center, Yorktown Heights, NY (1960)"},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1017\/S0013091500009639","volume":"17","author":"J.W. Moon","year":"1971","unstructured":"Moon, J.W.: On maximal transitive subtournaments. Proc. Edinburgh Math. Soc.\u00a017(4), 345\u2013349 (1971)","journal-title":"Proc. Edinburgh Math. Soc."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math.\u00a03, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF02986686","volume":"10","author":"V. Neumann-Lara","year":"1994","unstructured":"Neumann-Lara, V.: A short proof of a theorem of Reid and Parker on tournaments. Graphs Combin.\u00a010, 363\u2013366 (1994)","journal-title":"Graphs Combin."},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00224-007-1334-2","volume":"41","author":"V. Raman","year":"2007","unstructured":"Raman, V., Saurabh, S., Sikdar, S.: Efficient exact algorithms through enumerating maximal independent sets and other techniques. Theor. Comput. Syst.\u00a041(3), 563\u2013587 (2007)","journal-title":"Theor. Comput. Syst."},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B.A. Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett.\u00a032(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"23_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0021-9800(70)80061-8","volume":"9","author":"K.B. Reid","year":"1970","unstructured":"Reid, K.B., Parker, E.T.: Disproof of a conjecture of Erd\u0151s and Moser on tournaments. J. Combin. Theory\u00a09(3), 225\u2013238 (1970)","journal-title":"J. Combin. Theory"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(00)00339-5","volume":"117","author":"B. Schwikowski","year":"2002","unstructured":"Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Appl. Math.\u00a0117, 253\u2013265 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"23_CR26","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput.\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"23_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, you shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Combinatorial Optimization - Eureka, you shrink!, vol.\u00a02570, pp. 185\u2013207. Springer, Berlin (2003)"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-540-28639-4_25","volume-title":"Parameterized and Exact Computation","author":"G.J. Woeginger","year":"2004","unstructured":"Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 281\u2013290. Springer, Heidelberg (2004)"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.dam.2007.03.023","volume":"156","author":"G.J. Woeginger","year":"2008","unstructured":"Woeginger, G.J.: Open problems around exact algorithms. Discrete Appl. Math.\u00a0156(3), 397\u2013405 (2008)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T06:45:03Z","timestamp":1552977903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}