{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:11:09Z","timestamp":1744888269885,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_27","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"370-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Aspects of\u00a0Small Quasi-Kernels"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3859-7290","authenticated-orcid":false,"given":"H\u00e9l\u00e8ne","family":"Langlois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5331-2863","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Meunier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2387-0952","authenticated-orcid":false,"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2308-6970","authenticated-orcid":false,"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288\u2013298. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_80"},{"key":"27_CR2","volume-title":"Digraphs: Theory Algorithms and Applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory Algorithms and Applications. Springer, Berlin (2008)"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/jgt.10135","volume":"44","author":"JA Bondy","year":"2003","unstructured":"Bondy, J.A.: Short proofs of classical theorems. J. Graph Theor. 44(3), 159\u2013165 (2003)","journal-title":"J. Graph Theor."},{"issue":"19\u201320","key":"27_CR4","doi-asserted-by":"publisher","first-page":"2336","DOI":"10.1016\/j.disc.2005.12.031","volume":"306","author":"E Boros","year":"2006","unstructured":"Boros, E., Gurvich, V.: Perfect graphs, kernels, and cores of cooperative games. Discrete Math. 306(19\u201320), 2336\u20132354 (2006)","journal-title":"Discrete Math."},{"key":"27_CR5","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BFb0066192","volume-title":"Hypergraph Seminar","author":"V Chv\u00e1tal","year":"1974","unstructured":"Chv\u00e1tal, V., Lov\u00e1sz, L.: Every directed graph has a semi-kernel. In: Berge, C., Ray-Chaudhuri, D. (eds.) Hypergraph Seminar. LNM, vol. 411, pp. 175\u2013175. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0066192"},{"key":"27_CR6","unstructured":"Chv\u00e1tal, V.: On the computational complexity of finding a kernel. Technical Report CRM300, Centre de Recherches Math\u00e9matiques, Universit\u00e9 de Montr\u00e9al (1973)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, pp. 624\u2013633 (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"27_CR8","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"27_CR9","unstructured":"Erd\u0151s, P.L., Sz\u00e9kely, L.A.: Two conjectures on quasi-kernels, open problems no. 4. in fete of combinatorics and computer science. Bolyai Society Mathematical Studies (2010)"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0166-218X(81)90003-2","volume":"3","author":"AS Fraenkel","year":"1981","unstructured":"Fraenkel, A.S.: Planar kernel and Grundy with $$d \\le 3$$, $$d_\\text{ out } \\le 2$$, $$d_\\text{ in } \\le 2$$ are NP-complete. Discrete Appl. Math. 3(4), 257\u2013262 (1981)","journal-title":"Discrete Appl. Math."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F Galvin","year":"1995","unstructured":"Galvin, F.: The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B 63, 153\u2013158 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Gutin, G., Koh, K.M., Tay, E.G., Yeo, A.: On the number of quasi-kernels in digraphs, Rep. Ser. 01-7 (2001)","DOI":"10.7146\/brics.v8i7.20461"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1002\/jgt.10169","volume":"46","author":"G Gutin","year":"2004","unstructured":"Gutin, G., Koh, K.M., Tay, E.G., Yeo, A.: On the number of quasi-kernels in digraphs. J. Graph Theor. 46(1), 8\u201356 (2004)","journal-title":"J. Graph Theor."},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/jgt.20310","volume":"58","author":"S Heard","year":"2008","unstructured":"Heard, S., Huang, J.: Disjoint quasi-kernels in digraphs. J. Graph Theor. 58(3), 251\u2013260 (2008)","journal-title":"J. Graph Theor."},{"key":"27_CR15","unstructured":"Igarashi, A.: Coalition formation in structured environments. In: Proceedings of the 16th Conference on Autonomous Agents and Multiagent Systems, pp. 1836\u20131837 (2017)"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"27_CR17","unstructured":"Kostochka, A., Luo, R., Shan, S.: Towards the Small Quasi-Kernel Conjecture. arXiv:2001.04003 [math] (2020)"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"key":"27_CR20","unstructured":"Morgenstern, O., Von Neumann, J.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1947)"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jda.2011.11.004","volume":"10","author":"M Walicki","year":"2012","unstructured":"Walicki, M., Dyrkolbotn, S.: Finding kernels or solving SAT. J. Discret. Algorithms 10, 146\u2013164 (2012)","journal-title":"J. Discret. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:18:44Z","timestamp":1664536724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}