{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:29:21Z","timestamp":1772792961804,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319038407","type":"print"},{"value":"9783319038414","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_12","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"131-142","source":"Crossref","is-referenced-by-count":11,"title":["Extending Partial Representations of Circle Graphs"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"Radoslav","family":"Fulek","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Klav\u00edk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Battista, G.D., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: SODA 2010, pp. 202\u2013221 (2010)","DOI":"10.1137\/1.9781611973075.19"},{"key":"12_CR2","unstructured":"Balko, M., Klav\u00edk, P., Otachi, Y.: Bounded representations of interval and proper interval graphs. In: ISAAC (to appear, 2013)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. In: SODA 2013, pp. 1030\u20131043 (2013)","DOI":"10.1137\/1.9781611973105.74"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02579301","volume":"7","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Reducing prime graphs and recognizing circle graphs. Combinatorica\u00a07(3), 243\u2013254 (1987)","journal-title":"Combinatorica"},{"issue":"1-2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0012-365X(87)90132-4","volume":"66","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Unimodularity and circle graphs. Discrete Mathematics\u00a066(1-2), 203\u2013208 (1987)","journal-title":"Discrete Mathematics"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics\u00a0164, 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.jal.2007.05.001","volume":"6","author":"B. Courcelle","year":"2008","unstructured":"Courcelle, B.: Circle graphs and monadic second-order logic. J. Applied Logic\u00a06(3), 416\u2013442 (2008)","journal-title":"J. Applied Logic"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W. Cunningham","year":"1982","unstructured":"Cunningham, W.: Decomposition of directed graphs. SIAM J. Alg. and Disc. Methods\u00a03, 214\u2013228 (1982)","journal-title":"SIAM J. Alg. and Disc. Methods"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"1998","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. Journal of Algorithms\u00a036(2), 205\u2013240 (1998)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H. Fraysseix de","year":"1981","unstructured":"de Fraysseix, H.: Local complementation and interlacement graphs. Discrete Mathematics\u00a033(1), 29\u201335 (1981)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/PL00009461","volume":"22","author":"H. Fraysseix de","year":"1999","unstructured":"de Fraysseix, H., de Mendez, P.O.: On a characterization of gauss codes. Discrete & Computational Geometry\u00a022(2), 287\u2013295 (1999)","journal-title":"Discrete & Computational Geometry"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Even, S., Itai, A.: Queues, stacks, and graphs. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computation, pp. 71\u201376 (1971)","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"C.P. Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.: Recognizing circle graphs in polynomial time. J. ACM\u00a036(3), 435\u2013473 (1989)","journal-title":"J. ACM"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Gioan, E., Paul, C., Tedder, M., Corneil, D.: Practical and efficient circle graph recognition. Algorithmica, 1\u201330 (2013)","DOI":"10.1007\/s00453-013-9745-8"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.7155\/jgaa.00259","volume":"16","author":"K.R. Jampani","year":"2012","unstructured":"Jampani, K.R., Lubiw, A.: The simultaneous representation problem for chordal, comparability and permutation graphs. Journal of Graph Algortihms and Applications\u00a016(2), 283\u2013315 (2012)","journal-title":"Journal of Graph Algortihms and Applications"},{"key":"12_CR16","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.\u00a07501, pp. 671\u2013682. Springer, Heidelberg (2012)"},{"key":"12_CR17","doi-asserted-by":"crossref","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 (in preparation, 2013)","DOI":"10.1007\/978-3-319-08404-6_22"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-35261-4_47","volume-title":"Algorithms and Computation","author":"P. Klav\u00edk","year":"2012","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 444\u2013454. Springer, Heidelberg (2012)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-20877-5_28","volume-title":"Theory and Applications of Models of Computation","author":"P. Klav\u00edk","year":"2011","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Vysko\u010dil, T.: Extending partial representations of interval graphs. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 276\u2013285. Springer, Heidelberg (2011)"},{"issue":"1-3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"A. Kostochka","year":"1997","unstructured":"Kostochka, A., Kratochv\u00edl, J.: Covering and coloring polygon-circle graphs. Discrete Mathematics\u00a0163(1-3), 299\u2013305 (1997)","journal-title":"Discrete Mathematics"},{"key":"12_CR21","unstructured":"Naji, W.: Graphes de Cordes: Une Caracterisation et ses Applications. PhD thesis, l\u2019Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble (1985)"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S. Oum","year":"2005","unstructured":"Oum, S.: Rank-width and vertex-minors. J. Comb. Theory, Ser. B\u00a095(1), 79\u2013100 (2005)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11618058_34","volume-title":"Graph Drawing","author":"M. Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 380\u2013385. Springer, Heidelberg (2006)"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"J.P. Spinrad","year":"1994","unstructured":"Spinrad, J.P.: Recognition of circle graphs. J. of Algorithms\u00a016(2), 264\u2013282 (1994)","journal-title":"J. of Algorithms"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Field Institute Monographs (2003)","DOI":"10.1090\/fim\/019"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:54:27Z","timestamp":1558749267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}