{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:07:42Z","timestamp":1743113262181,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_22","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:33Z","timestamp":1737497433000},"page":"312-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degreewidth on\u00a0Semi-complete Digraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-2965-872X","authenticated-orcid":false,"given":"Ryan","family":"Keeney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3166-9212","authenticated-orcid":false,"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM J. Discret. Math. 20(1), 137\u2013142 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Barbero, F., Paul, C., Pilipczuk, M.: Exploring the complexity of layout parameters in tournaments and semicomplete digraphs. ACM Trans. Algorithms 14(3) (2018)","DOI":"10.1145\/3196276"},{"key":"22_CR3","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Electron. Colloq. Comput. Complexity (49) (2003). https:\/\/eccc.weizmann.ac.il\/report\/2003\/049\/"},{"key":"22_CR4","unstructured":"Bessy, S., et al.: Packing arc-disjoint cycles in tournaments. In: MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Aachen, Germany, vol.\u00a0138, pp. 27:1\u201327:14 (2019). https:\/\/hal.science\/hal-02277436"},{"key":"22_CR5","unstructured":"Bessy, S., Bougeret, M., Thiebaut, J.: Triangle packing in (sparse) tournaments: approximation and kernelization. In: 25th Annual European Symposium on Algorithms, ESA 2017, 4\u20136 September 2017, Vienna, Austria. LIPIcs, vol.\u00a087, pp. 14:1\u201314:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548306007887","volume":"16","author":"P Charbit","year":"2007","unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is np-hard for tournaments. Comb. Probab. Comput. 16(1), 1\u20134 (2007)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jctb.2011.05.001","volume":"102","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M., Fradkin, A., Seymour, P.: Tournament immersion and cutwidth. J. Combin. Theory Ser. B 102(1), 93\u2013101 (2012)","journal-title":"J. Combin. Theory Ser. B"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Davot, T., Isenmann, L., Roy, S., Thiebaut, J.: DegreeWidth: a new parameter for solving problems on tournaments. In: Graph-Theoretic Concepts in Computer Science, pp. 246\u2013260. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-43380-1_18"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.jctb.2019.01.006","volume":"138","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Pilipczuk, M.: On width measures and topological problems on semi-complete digraphs. J. Combin. Theory Ser. B 138, 78\u2013165 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"22_CR10","unstructured":"Fradkin, A.: Forbidden structures and algorithms in graphs and digraphs. Ph.D. thesis, Princeton University (2011)"},{"key":"22_CR11","unstructured":"Pilipczuk, M.: Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. CoRR abs\/1210.5363 (2012). http:\/\/arxiv.org\/abs\/1210.5363"},{"key":"22_CR12","unstructured":"Thiebaut, J.: Algorithmic and structural results on directed cycles in dense digraphs. Ph.D. thesis (2019)"}],"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-75409-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:37Z","timestamp":1737497437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","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":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}