{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:23:50Z","timestamp":1742941430819,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_1","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Contact Graphs of Circular Arcs"],"prefix":"10.1007","author":[{"given":"Md. Jawaherul","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"701","DOI":"10.7155\/jgaa.00276","volume":"16","author":"MJ Alam","year":"2012","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs. J. Graph Algor. Appl. 16(3), 701\u2013728 (2012)","journal-title":"J. Graph Algor. Appl."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-662-45803-7_11","volume-title":"Graph Drawing","author":"MJ Alam","year":"2014","unstructured":"Alam, M.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Pupyrev, S.: Balanced circle packings for planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 125\u2013136. Springer, Heidelberg (2014)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Alam, M.J., Eppstein, D., Kaufmann, M., Kobourov, S.G., Pupyrev, S., Schulz, A., Ueckerdt, T.: Contact representations of sparse planar graphs. CoRR, abs\/1501.00318 (2015)","DOI":"10.1007\/978-3-319-21840-3_2"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jcta.2011.08.006","volume":"119","author":"O Bernardi","year":"2012","unstructured":"Bernardi, O., Fusy, \u00c9.: A bijection for triangulations, quadrangulations, pentagulations, etc. J. Combinatorial Th., Ser. A 119(1), 218\u2013244 (2012)","journal-title":"J. Combinatorial Th., Ser. A"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N de Castro","year":"2002","unstructured":"de Castro, N., Cobos, F., Dana, J., M\u00e1rquez, A., Noy, M.: Triangle-free planar graphs and segment intersection graphs. J. Graph Algor. Appl. 6(1), 7\u201326 (2002)","journal-title":"J. Graph Algor. Appl."},{"issue":"1\u20133","key":"1_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H de Fraysseix","year":"2001","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: On topological aspects of orientations. Discrete Math. 229(1\u20133), 57\u201372 (2001)","journal-title":"Discrete Math."},{"issue":"9","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.dam.2005.12.009","volume":"155","author":"H de Fraysseix","year":"2007","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Barycentric systems and stretchability. Discrete Applied Math. 155(9), 1079\u20131095 (2007)","journal-title":"Discrete Applied Math."},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00453-006-0157-x","volume":"47","author":"H de Fraysseix","year":"2007","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Representations by contact and intersection of segments. Algorithmica 47(4), 453\u2013463 (2007)","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00453-011-9525-2","volume":"63","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Gansner, E.R., Hu, Y., Kaufmann, M., Kobourov, S.G.: Optimal polygonal representation of planar graphs. Algorithmica 63(3), 672\u2013691 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/110834032","volume":"41","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537\u2013564 (2012)","journal-title":"SIAM J. Comput."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-30140-0_28","volume-title":"Algorithms \u2013 ESA 2004","author":"Z Fekete","year":"2004","unstructured":"Fekete, Z., Jord\u00e1n, T., Whiteley, W.: An inductive construction for plane laman graphs via vertex splitting. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 299\u2013310. Springer, Heidelberg (2004)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00454-012-9400-1","volume":"48","author":"D Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves, D., L\u00e9v\u00eaque, B., Pinlou, A.: Triangle contact representations and duality. Discrete Comput. Geom. 48(1), 239\u2013254 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"1_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.comgeo.2004.07.003","volume":"31","author":"R Haas","year":"2005","unstructured":"Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D.L., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. Th. Appl. 31(1\u20132), 31\u201361 (2005)","journal-title":"Comput. Geom. Th. Appl."},{"key":"1_CR14","unstructured":"Henneberg, L.: Die graphische Statik der starren Systeme. BG Teubner (1911)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jctb.1998.1846","volume":"74","author":"P Hlin\u011bn\u00fd","year":"1998","unstructured":"Hlin\u011bn\u00fd, P.: Classes and recognition of curve contact graphs. J. Combinatorial Th., Ser. B 74(1), 87\u2013103 (1998)","journal-title":"J. Combinatorial Th., Ser. B"},{"key":"1_CR16","first-page":"141","volume":"88","author":"P Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Ber. S\u00e4chs. Akad., Math.-Phys. Klasse 88, 141\u2013164 (1936)","journal-title":"Ber. S\u00e4chs. Akad., Math.-Phys. Klasse"},{"issue":"8","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1016\/j.disc.2007.07.104","volume":"308","author":"A Lee","year":"2008","unstructured":"Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Discrete Math. 308(8), 1425\u20131437 (2008)","journal-title":"Discrete Math."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2) (2008)","DOI":"10.1145\/1346330.1346336"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"1_CR20","unstructured":"Nixon, A.: Rigidity on Surfaces. PhD thesis, Lancaster University (2011)"},{"key":"1_CR21","unstructured":"Nixon, A., Owen, J.: An inductive construction of (2, 1)-tight graphs (2011) (unpublished preprint)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-45043-3_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Schulz","year":"2013","unstructured":"Schulz, A.: Drawing graphs with few arcs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 406\u2013417. Springer, Heidelberg (2013)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Whiteley, W.: Some matroids from discrete applied geometry. In: Matroid Theory. Contemp. Math., vol. 197, pp. 171\u2013311. Amer. Math. Soc. (1996)","DOI":"10.1090\/conm\/197\/02540"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:35:42Z","timestamp":1676468142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}