{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:41:27Z","timestamp":1742935287596,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_12","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"148-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0511-1976","authenticated-orcid":false,"given":"Jungho","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4856-5863","authenticated-orcid":false,"given":"Lars","family":"Jaffke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1820-1962","authenticated-orcid":false,"given":"O-joung","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paloma T.","family":"Lima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"3","key":"12_CR1","first-page":"501","volume":"69","author":"R Belmonte","year":"2014","unstructured":"Belmonte, R., Golovach, P.A., Heggernes, P., Hof, P.V., Kami\u0144ski, M., Paulusma, D.: Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica 69(3), 501\u2013521 (2014)","journal-title":"Algorithmica"},{"issue":"35","key":"12_CR2","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theoret. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"12_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(03)00424-9","volume":"310","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, H.O., Le, V.B.: Tree spanners on chordal graphs: complexity and algorithms. Theoret. Comput. Sci. 310(1\u20133), 329\u2013354 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"12_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0166-218X(93)90232-D","volume":"44","author":"YW Chang","year":"1993","unstructured":"Chang, Y.W., Jacobson, M.S., Monma, C.L., West, D.B.: Subtree and substar intersection numbers. Discret. Appl. Math. 44(1\u20133), 205\u2013220 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27\u201339 (1984)","journal-title":"Discret. Appl. Math."},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"12_CR7","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":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization. Cambridge University Press, Cambridge (2019)","DOI":"10.1017\/9781107415157"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D Fulkerson","year":"1965","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"12_CR10","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8369-7","volume-title":"Graph Theory and Sparse Matrix Computation","author":"A George","year":"2012","unstructured":"George, A., Gilbert, J.R., Liu, J.W.: Graph Theory and Sparse Matrix Computation. IMA, vol. 56. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4613-8369-7"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","volume":"45","author":"J Gustedt","year":"1993","unstructured":"Gustedt, J.: On the pathwidth of chordal graphs. Discret. Appl. Math. 45(3), 233\u2013248 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"18","key":"12_CR12","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.dam.2011.10.017","volume":"160","author":"F Havet","year":"2012","unstructured":"Havet, F., Sales, C.L., Sampaio, L.: b-coloring of tight graphs. Discret. Appl. Math. 160(18), 2709\u20132715 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/s00224-014-9580-6","volume":"57","author":"P Heggernes","year":"2015","unstructured":"Heggernes, P., van\u2019t Hof, P.V., van Leeuwen, E.J., Saei, R.: Finding disjoint paths in split graphs. Theor. Comput. Syst. 57(1), 140\u2013159 (2015)","journal-title":"Theor. Comput. Syst."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-11409-0_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F Kammer","year":"2010","unstructured":"Kammer, F., Tholey, T.: The k-disjoint paths problem on chordal graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 190\u2013201. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_17"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"KI Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K.I., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Combin. Theor. Ser. B 102(2), 424\u2013435 (2012)","journal-title":"J. Combin. Theor. Ser. B"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2017.04.043","volume":"248","author":"S Mengel","year":"2018","unstructured":"Mengel, S.: Lower bounds on the mim-width of some graph classes. Discret. Appl. Math. 248, 28\u201332 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-006-1225-y","volume":"47","author":"SD Nikolopoulos","year":"2007","unstructured":"Nikolopoulos, S.D., Palios, L.: Detecting holes and antiholes in graphs. Algorithmica 47(2), 119\u2013138 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theor. Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Combin. Theor. Ser. B"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"12_CR21","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics and its Applications, vol. 24. Oxford University Press, Oxford (2003)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2018.06.037","volume":"254","author":"A Silva","year":"2019","unstructured":"Silva, A.: Graphs with small fall-spectrum. Discret. Appl. Math. 254, 183\u2013188 (2019)","journal-title":"Discret. Appl. Math."},{"key":"12_CR23","unstructured":"Vatshelle, M.: New Width Parameters of Graphs. Ph.D. thesis, University of Bergen, Norway (2012)"},{"issue":"1","key":"12_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00224-014-9568-2","volume":"58","author":"R Watrigant","year":"2016","unstructured":"Watrigant, R., Bougeret, M., Giroudeau, R.: Approximating the Sparsest $$k$$-subgraph in chordal graphs. Theor. Comput. Syst. 58(1), 111\u2013132 (2016)","journal-title":"Theor. Comput. Syst."}],"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-60440-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:01:20Z","timestamp":1710266480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","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":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"34% - 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.7","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":"2.1","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 virtually 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)"}}]}}