{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:16:04Z","timestamp":1760080564500,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_20","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"257-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Linear-Time Parameterized Algorithm for Computing the Width of a DAG"],"prefix":"10.1007","author":[{"given":"Manuel","family":"C\u00e1ceres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Cairo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Mumey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 377\u2013391. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"key":"20_CR2","volume-title":"Digraphs Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs Theory, Algorithms and Applications, 1st edn. Springer, Berlin (2000)","edition":"1"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00453-007-0094-3","volume":"48","author":"P Bonizzoni","year":"2007","unstructured":"Bonizzoni, P.: A linear-time algorithm for the perfect phylogeny haplotype problem. Algorithmica 48(3), 267\u2013285 (2007). https:\/\/doi.org\/10.1007\/s00453-007-0094-3","journal-title":"Algorithmica"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s11083-011-9197-1","volume":"29","author":"B Bosek","year":"2012","unstructured":"Bosek, B., Felsner, S., Kloch, K., Krawczyk, T., Matecki, G., Micek, P.: On-line chain partitions of orders: a survey. Order 29(1), 49\u201373 (2012). https:\/\/doi.org\/10.1007\/s11083-011-9197-1","journal-title":"Order"},{"issue":"2","key":"20_CR5","first-page":"1","volume":"17","author":"S Bova","year":"2015","unstructured":"Bova, S., Ganian, R., Szeider, S.: Model checking existential logic on partially ordered sets. ACM Trans. Comput. Log. (TOCL) 17(2), 1\u201335 (2015)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: 2008 IEEE 24th International Conference on Data Engineering, pp. 893\u2013902. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: On the graph decomposition. In: 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, pp. 777\u2013784. IEEE (2014)","DOI":"10.1109\/BDCloud.2014.118"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383598","volume":"1","author":"CJ Colbourn","year":"1985","unstructured":"Colbourn, C.J., Pulleyblank, W.R.: Minimizing setups in ordered sets of fixed width. Order 1(3), 225\u2013229 (1985). https:\/\/doi.org\/10.1007\/BF00383598","journal-title":"Order"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161\u2013166 (1950). http:\/\/www.jstor.org\/stable\/1969503","DOI":"10.2307\/1969503"},{"key":"20_CR10","series-title":"Contemporary Mathematicians","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-1-4899-3558-8_2","volume-title":"The Dilworth Theorems","author":"RP Dilworth","year":"1990","unstructured":"Dilworth, R.P.: Some combinatorial problems on partially ordered sets. In: Bogart, K.P., Freese, R., Kung, J.P.S. (eds.) The Dilworth Theorems. CM, pp. 13\u201318. Springer, Boston (1990). https:\/\/doi.org\/10.1007\/978-1-4899-3558-8_2"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/B:ORDE.0000034609.99940.fb","volume":"20","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Raghavan, V., Spinrad, J.: Recognition algorithms for orders of small width and graphs of small Dilworth number. Order 20(4), 351\u2013364 (2003). https:\/\/doi.org\/10.1023\/B:ORDE.0000034609.99940.fb","journal-title":"Order"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Pilipczuk, M., Saurabh, S., Wrochna, M.: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January 2017, pp. 1419\u20131432. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.92","DOI":"10.1137\/1.9781611974782.92"},{"key":"20_CR13","first-page":"701","volume":"7","author":"DR Fulkerson","year":"1956","unstructured":"Fulkerson, D.R.: Note on Dilworth\u2019s decomposition theorem for partially ordered sets. Proc. Am. Math. Soc. 7, 701\u2013702 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Gajarsk\u1ef3, J., et al.: FO model checking on posets of bounded width. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 963\u2013974. IEEE (2015)","DOI":"10.1109\/FOCS.2015.63"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2017.05.017","volume":"689","author":"AC Giannopoulou","year":"2017","unstructured":"Giannopoulou, A.C., Mertzios, G.B., Niedermeier, R.: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs. Theor. Comput. Sci. 689, 67\u201395 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"6\u20137","key":"20_CR16","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.dam.2005.09.020","volume":"155","author":"J Gramm","year":"2007","unstructured":"Gramm, J., Nierhoff, T., Sharan, R., Tantau, T.: Haplotyping with missing data via perfect path phylogenies. Discrete Appl. Math. 155(6\u20137), 788\u2013805 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Ikiz, S., Garg, V.K.: Efficient incremental optimal chain partition of distributed program traces. In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), p. 18. IEEE (2006)","DOI":"10.1109\/ICDCS.2006.34"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1162\/EVCO_a_00046","volume":"19","author":"W Ja\u015bkowski","year":"2011","unstructured":"Ja\u015bkowski, W., Krawiec, K.: Formal analysis, hardness, and algorithms for extracting internal structure of test-based problems. Evol. Comput. 19(4), 639\u2013671 (2011)","journal-title":"Evol. Comput."},{"issue":"11","key":"20_CR20","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5(11), 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3439801","volume":"26","author":"T Koana","year":"2021","unstructured":"Koana, T., Korenwein, V., Nichterlein, A., Niedermeier, R., Zschoche, P.: Data reduction for maximum matching on real-world graphs: theory and experiments. J. Exp. Algorithmics (JEA) 26, 1\u201330 (2021)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301312","volume":"15","author":"V M\u00e4kinen","year":"2019","unstructured":"M\u00e4kinen, V., Tomescu, A.I., Kuosmanen, A., Paavilainen, T., Gagie, T., Chikhi, R.: Sparse dynamic programming on DAGs with small width. ACM Trans. Algorithms (TALG) 15(2), 1\u201321 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $$O(nm)$$ time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"issue":"2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00268499","volume":"6","author":"RE Tarjan","year":"1976","unstructured":"Tarjan, R.E.: Edge-disjoint spanning trees and depth-first search. Acta Informatica 6(2), 171\u2013185 (1976). https:\/\/doi.org\/10.1007\/BF00268499","journal-title":"Acta Informatica"},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jpdc.1996.1298","volume":"41","author":"AI Tomlinson","year":"1997","unstructured":"Tomlinson, A.I., Garg, V.K.: Monitoring functions on global states of distributed programs. J. Parallel Distrib. Comput. 41(2), 173\u2013189 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-44914-2_9","volume-title":"Discrete Optimization and Operations Research","author":"R van Bevern","year":"2016","unstructured":"van Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., Woeginger, G.J.: Precedence-constrained scheduling problems parameterized by partial order width. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 105\u2013120. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_9"},{"key":"20_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/9781315366890","volume-title":"Introduction to Combinatorics","author":"WD Wallis","year":"2016","unstructured":"Wallis, W.D., George, J.C.: Introduction to Combinatorics. CRC Press, Boca Raton (2016)"}],"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-030-86838-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:24:00Z","timestamp":1725809040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","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":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"30","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":"41% - 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":"11","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}