{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T13:04:55Z","timestamp":1758632695563,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_17","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"230-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending Partial Representations of\u00a0Circular-Arc Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8108-567X","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0531-9769","authenticated-orcid":false,"given":"Peter","family":"Stumpf","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0071-9149","authenticated-orcid":false,"given":"Peter","family":"Zeman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015)","key":"17_CR1","DOI":"10.1145\/2629341"},{"issue":"2","key":"17_CR2","first-page":"1","volume":"12","author":"T Bl\u00e4sius","year":"2015","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms (TALG) 12(2), 1\u201346 (2015)","journal-title":"ACM Trans. Algorithms (TALG)"},{"unstructured":"Bok, J., Jedli\u010dkov\u00e1, N.: A note on simultaneous representation problem for interval and circular-arc graphs. arXiv preprint arXiv:1811.04062 (2018)","key":"17_CR3"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-12340-0_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2014","unstructured":"Chaplick, S., Dorbec, P., Kratochv\u00edl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 139\u2013151. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_12"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/jgt.22436","volume":"91","author":"S Chaplick","year":"2019","unstructured":"Chaplick, S., Fulek, R., Klav\u00edk, P.: Extending partial representations of circle graphs. J. Graph Theory 91(4), 365\u2013394 (2019)","journal-title":"J. Graph Theory"},{"doi-asserted-by":"crossref","unstructured":"Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., Wolff, A.: Extending partial representations of rectangular duals with given contact orientations. arXiv preprint arXiv:2102.02013 (2021)","key":"17_CR7","DOI":"10.1007\/978-3-030-75242-2_24"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput. 25(2), 390\u2013403 (1996)","journal-title":"SIAM J. Comput."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(77)90005-6","volume":"5","author":"Z Galil","year":"1977","unstructured":"Galil, Z., Meggido, N.: Cyclic ordering is NP-complete. Theoret. Comput. Sci. 5, 179\u2013182 (1977)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"MR Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discret. Methods 1(2), 216\u2013227 (1980)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: Algorithms on circular-arc graphs. Networks 4(4), 357\u2013369 (1974)","journal-title":"Networks"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"WL Hsu","year":"1985","unstructured":"Hsu, W.L.: Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM J. Comput. 14(1), 224\u2013231 (1985)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"WL Hsu","year":"2003","unstructured":"Hsu, W.L., McConnell, R.M.: PC trees and circular-ones arrangements. Theoret. Comput. Sci. 296(1), 99\u2013116 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4), 466\u2013492 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00453-009-9304-5","volume":"59","author":"BL Joeris","year":"2011","unstructured":"Joeris, B.L., Lin, M.C., McConnell, R.M., Spinrad, J.P., Szwarcfiter, J.L.: Linear-time recognition of Helly circular-arc models and graphs. Algorithmica 59(2), 215\u2013239 (2011)","journal-title":"Algorithmica"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-33090-2_58","volume-title":"Algorithms \u2013 ESA 2012","author":"P Klav\u00edk","year":"2012","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Krawczyk, T., Walczak, B.: Extending partial representations of function graphs and permutation graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 671\u2013682. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_58"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s00453-016-0133-z","volume":"77","author":"P Klav\u00edk","year":"2017","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Rutter, I., Saitoh, T., Saumell, M., Vysko\u010dil, T.: Extending partial representations of proper and unit interval graphs. Algorithmica 77(4), 1071\u20131104 (2017)","journal-title":"Algorithmica"},{"unstructured":"Klav\u00edk, P., et al.: Extending partial representations of proper and unit interval graphs. CoRR abs\/1207.6960 (2012). https:\/\/arxiv.org\/abs\/1207.6960","key":"17_CR21"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2015.02.007","volume":"576","author":"P Klav\u00edk","year":"2015","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theoret. Comput. Sci. 576, 85\u2013101 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"17_CR23","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00453-016-0186-z","volume":"78","author":"P Klav\u00edk","year":"2017","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T., Vysko\u010dil, T.: Extending partial representations of interval graphs. Algorithmica 78(3), 945\u2013967 (2017)","journal-title":"Algorithmica"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-319-68705-6_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Krawczyk","year":"2017","unstructured":"Krawczyk, T., Walczak, B.: Extending partial representations of trapezoid graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 358\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_27"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-74839-7_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MC Lin","year":"2007","unstructured":"Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: Proper Helly circular-arc graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 248\u2013257. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74839-7_24"},{"issue":"7\u20138","key":"17_CR26","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.dam.2012.11.005","volume":"161","author":"MC Lin","year":"2013","unstructured":"Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math. 161(7\u20138), 1037\u20131059 (2013)","journal-title":"Discret. Appl. Math."},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11809678_10","volume-title":"Computing and Combinatorics","author":"MC Lin","year":"2006","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Characterizations and linear time recognition of Helly circular-arc graphs. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 73\u201382. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11809678_10"},{"issue":"18","key":"17_CR28","doi-asserted-by":"publisher","first-page":"5618","DOI":"10.1016\/j.disc.2008.04.003","volume":"309","author":"MC Lin","year":"2009","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Characterizations and recognition of circular-arc graphs and subclasses: a survey. Discret. Math. 309(18), 5618\u20135635 (2009). Combinatorics 2006, A Meeting in Celebration of Pavol Hell 's 60th Birthday (1\u20135 May 2006)","journal-title":"Discret. Math."},{"issue":"2","key":"17_CR29","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"RM McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica 37(2), 93\u2013147 (2003)","journal-title":"Algorithmica"},{"issue":"5","key":"17_CR30","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Int. J. Found. Comput. Sci. 17(5), 1061\u20131070 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"17_CR31","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":"17_CR32","doi-asserted-by":"publisher","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","volume":"39","author":"A Tucker","year":"1971","unstructured":"Tucker, A.: Matrix characterizations of circular-arc graphs. Pac. J. Math. 39, 535\u2013545 (1971)","journal-title":"Pac. J. Math."},{"issue":"1\u20132","key":"17_CR33","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"A Tucker","year":"1974","unstructured":"Tucker, A.: Structure theorems for some circular-arc graphs. Discret. Math. 7(1\u20132), 167\u2013195 (1974)","journal-title":"Discret. Math."},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A Tucker","year":"1980","unstructured":"Tucker, A.: An efficient test for circular-arc graphs. SIAM J. Comput. 9(1), 1\u201324 (1980)","journal-title":"SIAM J. Comput."}],"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-15914-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:18:05Z","timestamp":1664536685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"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","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":"12","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)"}}]}}