{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:01Z","timestamp":1759639081220,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_19","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"234-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs"],"prefix":"10.1007","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Carolin","family":"Rehs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"19_CR1","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71840-8","volume-title":"Classes of Directed Graphs","year":"2018","unstructured":"Bang-Jensen, J., Gutin, G. (eds.): Classes of Directed Graphs. SMM. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-71840-8"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed pathwidth and monotonicity in digraph searching. Graphs Comb. 22, 161\u2013172 (2006)","journal-title":"Graphs Comb."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"E El-Mallah","year":"1988","unstructured":"El-Mallah, E., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circuits Syst. 35(3), 354\u2013362 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.jctb.2015.09.001","volume":"116","author":"R Ganian","year":"2016","unstructured":"Ganian, R., et al.: Are there any good digraph width measures? J. Comb. Theory Ser. B 116, 250\u2013286 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"doi-asserted-by":"crossref","unstructured":"Gurski, F., Rehs, C.: Computing directed path-width and directed tree-width of recursively defined digraphs. ACM Computing Research Repository, abs\/1806.04457, p. 16 (2018)","key":"19_CR5","DOI":"10.1007\/978-3-319-94776-1_22"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-94776-1_22","volume-title":"Computing and Combinatorics","author":"F Gurski","year":"2018","unstructured":"Gurski, F., Rehs, C.: Directed path-width and directed tree-width of directed co-graphs. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 255\u2013267. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_22"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1073\/pnas.39.4.315","volume":"39","author":"F Harary","year":"1953","unstructured":"Harary, F., Uhlenbeck, G.E.: On the number of husimi trees: I. Proc. Nat. Acad. Sci. 39(4), 315\u2013322 (1953)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory Ser. B 82, 138\u2013155 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"unstructured":"Kintali, S., Zhang, Q.: Forbidden directed minors and directed pathwidth. Reseach report (2015)","key":"19_CR9"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2016.12.008","volume":"662","author":"S Kintali","year":"2017","unstructured":"Kintali, S., Zhang, Q.: Forbidden directed minors and Kelly-width. Theor. Comput. Sci. 662, 40\u201347 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1089\/cmb.2010.0252","volume":"18","author":"B Paten","year":"2011","unstructured":"Paten, B., et al.: Cactus graphs for genome comparisons. J. Comput. Biol. 18(3), 469\u2013481 (2011)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1101\/gr.123356.111","volume":"21","author":"B Paten","year":"2011","unstructured":"Paten, B., Earl, D., Nguyen, N., Diekhans, M., Zerbino, D., Haussler, D.: Cactus: algorithms for genome multiple sequence alignment. Genome Res. 21(9), 1512\u201311528 (2011)","journal-title":"Genome Res."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree width. J. Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"unstructured":"Scheffler, P.: Die baumweite von graphen als mass f\u00fcr die kompliziertheit algorithmischer probleme. Ph.D. thesis, Akademie der Wissenschaften in der DDR, Berlin (1989)","key":"19_CR14"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:16:52Z","timestamp":1709810212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","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":"92","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":"35","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":"6","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":"38% - 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":"3.3","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)"}}]}}