{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:30Z","timestamp":1759638030101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_20","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T01:24:59Z","timestamp":1448501099000},"page":"231-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Klawitter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","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,11,27]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E Asplund","year":"1960","unstructured":"Asplund, E., Gr\u00fcnbaum, B.: On a coloring problem. Mathematica Scandinavica 8, 181\u2013188 (1960)","journal-title":"Mathematica Scandinavica"},{"key":"20_CR2","first-page":"213","volume-title":"Thirty Essays in Geometric Graph Theory","author":"S Felsner","year":"2012","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays in Geometric Graph Theory, pp. 213\u2013248. Springer, New York (2012)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3, 233\u2013246 (1994)","journal-title":"Comb. Probab. Comput."},{"issue":"7","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"E Fusy","year":"2009","unstructured":"Fusy, E.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309(7), 1870\u20131894 (2009)","journal-title":"Discrete Math."},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/s00454-014-9583-8","volume":"51","author":"RJ Kang","year":"2014","unstructured":"Kang, R.J., M\u00fcller, T.: Arrangements of pseudocircles and circles. Discrete Comput. Geom. 51, 896\u2013925 (2014)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"20_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of \n                      \n                        \n                      \n                      $$4$$\n                    -connected plane graphs and its applications in graph drawing problems. Theor. Comput. Sci. 172(1\u20132), 175\u2013193 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Klawitter, J., N\u00f6llenburg, M., Ueckerdt, T.: Combinatorial properties of triangle-free rectangle arrangements and the squarability problem. CoRR, \n                      arXiv:1509.00835\n                      \n                    , September 2015","DOI":"10.1007\/978-3-319-27261-0_20"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 15, 145\u2013157 (1985)","journal-title":"Networks"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323\u2013343 (1989)","journal-title":"Order"},{"key":"20_CR11","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: 1st ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138\u2013148 (1990)"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. J. Comb. Theor. Ser. B 40(1), 9\u201320 (1986)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing graphs. J. London Math. Soc. 28, 336\u2013342 (1953)","journal-title":"J. London Math. Soc."},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T20:11:46Z","timestamp":1569269506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_20","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":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}