{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T17:43:37Z","timestamp":1777916617188,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030307851","type":"print"},{"value":"9783030307868","type":"electronic"}],"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-30786-8_5","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"53-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Meike","family":"Hatzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Rabinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Wiederrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.jctb.2006.12.006","volume":"97","author":"I Adler","year":"2007","unstructured":"Adler, I.: Directed tree-width examples. J. Comb. Theory Ser. B 97(5), 718\u2013725 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: algorithmic techniques and results. In: Pr\u00edvara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 19\u201336. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0029946"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1\u201316. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30577-4_1"},{"key":"5_CR5","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, 1st edn. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","edition":"1"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2017)"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00493-011-1687-5","volume":"31","author":"B Guenin","year":"2011","unstructured":"Guenin, B., Thomas, R.: Packing directed circuits exactly. Combinatorica 31(4), 397\u2013421 (2011)","journal-title":"Combinatorica"},{"issue":"1","key":"5_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(1), 138\u2013154 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.dam.2017.09.019","volume":"248","author":"J Jeong","year":"2017","unstructured":"Jeong, J., S\u00e6ther, S.H., Telle, J.A.: Maximum matching width: new characterizations and a fast algorithm for dominating set. Discrete Appl. Math. 248, 114\u2013124 (2017)","journal-title":"Discrete Appl. Math."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Kreutzer, S.: The directed grid theorem. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pp. 655\u2013664 (2015)","DOI":"10.1145\/2746539.2746586"},{"key":"5_CR11","unstructured":"Kotzig, A.: On the theory of finite graphs with a linear factor I\u2013III [Slovak with German summary]. Fyz. Casopis Slovensk. Akad. Vied, 9\u201310 (1959\/1960)"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0095-8956(87)90021-9","volume":"43","author":"L Lov\u00e1sz","year":"1987","unstructured":"Lov\u00e1sz, L.: Matching structure and the matching lattice. J. Comb. Theory Ser. B 43(2), 187\u2013222 (1987)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR13","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol. 367. American Mathematical Society, Providence (2009)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/1097-0118(200009)35:1<46::AID-JGT4>3.0.CO;2-W","volume":"35","author":"W McCuaig","year":"2000","unstructured":"McCuaig, W.: Even dicycles. J. Graph Theory 35(1), 46\u201368 (2000)","journal-title":"J. Graph Theory"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/jgt.1029","volume":"38","author":"W McCuaig","year":"2001","unstructured":"McCuaig, W.: Brace generation. J. Graph Theory 38(3), 124\u2013169 (2001)","journal-title":"J. Graph Theory"},{"issue":"1","key":"5_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.37236\/1832","volume":"11","author":"W McCuaig","year":"2004","unstructured":"McCuaig, W.: P\u00f3lya\u2019s permanent problem. Electron. J. Comb. 11(1), 79 (2004)","journal-title":"Electron. J. Comb."},{"key":"5_CR17","unstructured":"Norine, S.: Matching structure and Pfaffian orientations of graphs. Ph.D. thesis. Georgia Institute of Technology (2005)"},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.jctb.2007.01.002","volume":"97","author":"S Norine","year":"2007","unstructured":"Norine, S., Thomas, R.: Generating bricks. J. Comb. Theory Ser. B 97(5), 769\u2013817 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/S1571-0653(05)80061-7","volume":"3","author":"B Reed","year":"1999","unstructured":"Reed, B.: Introducing directed tree width. Electron. Notes Discrete Math. 3, 222\u2013229 (1999)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory Ser. B 41(1), 92\u2013114 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR21","unstructured":"Robertson, N., Seymour, P.D.: Graph minors I\u2013XXIII. J. Comb. Theory Ser. B (1982\u20132010)"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"929","DOI":"10.2307\/121059","volume":"150","author":"N Robertson","year":"1999","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Ann. Math. 150(3), 929\u2013975 (1999)","journal-title":"Ann. Math."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Thomas, R.: A survey of Pfaffian orientations of graphs. In: Proceedings of the International Congress of Mathematicians, vol. 3, pp. 963\u2013984. Citeseer (2006)","DOI":"10.4171\/022-3\/47"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T04:01:21Z","timestamp":1611115281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","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":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 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":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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.4","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":"1-2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}