{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:56Z","timestamp":1725798656560},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_26","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"299-310","source":"Crossref","is-referenced-by-count":4,"title":["Intersection Graphs of L-Shapes and Segments in the Plane"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]},{"given":"Kolja","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-03841-4_11","volume-title":"Graph Drawing","author":"N. Aerts","year":"2013","unstructured":"Aerts, N., Felsner, S.: Straight line triangle representations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 119\u2013130. Springer, Heidelberg (2013)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00143892","volume":"5","author":"N. Alon","year":"1988","unstructured":"Alon, N., Scheinerman, E.: Degrees of freedom versus dimension for containment orders. Order\u00a05, 11\u201316 (1988)","journal-title":"Order"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.7155\/jgaa.00253","volume":"16","author":"A. Asinowski","year":"2012","unstructured":"Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex intersection graphs of paths on a grid. J. Graph Algorithms Appl.\u00a016(2), 129\u2013150 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00454-013-9538-5","volume":"50","author":"S. Cabello","year":"2013","unstructured":"Cabello, S., Cardinal, J., Langerman, S.: The clique problem in ray intersection graphs. Discrete & Computational Geometry\u00a050(3), 771\u2013783 (2013)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s00454-009-9196-9","volume":"43","author":"J. Chalopin","year":"2010","unstructured":"Chalopin, J., Gon\u00e7alves, D., Ochem, P.: Planar graphs have 1-string representations. Discrete & Computational Geometry\u00a043(3), 626\u2013647 (2010)","journal-title":"Discrete & Computational Geometry"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-34611-8_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Chaplick","year":"2012","unstructured":"Chaplick, S., Jel\u00ednek, V., Kratochv\u00edl, J., Vysko\u010dil, T.: Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 274\u2013285. Springer, Heidelberg (2012)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-45043-3_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Chaplick","year":"2013","unstructured":"Chaplick, S., Kobourov, S.G., Ueckerdt, T.: Equilateral L-contact graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol.\u00a08165, pp. 139\u2013151. Springer, Heidelberg (2013)"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.7155\/jgaa.00300","volume":"17","author":"S. Chaplick","year":"2013","unstructured":"Chaplick, S., Ueckerdt, T.: Planar graphs as VPG-graphs. Journal of Graph Algorithms and Applications\u00a017(4), 475\u2013494 (2013)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4","key":"26_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00453-006-0157-x","volume":"47","author":"H. Fraysseix de","year":"2007","unstructured":"de Fraysseix, H., Ossona de Mendez, P.O.: Representations by contact and intersection of segments. Algorithmica\u00a047(4), 453\u2013463 (2007)","journal-title":"Algorithmica"},{"issue":"9","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.dam.2005.12.009","volume":"155","author":"H. Fraysseix de","year":"2007","unstructured":"de Fraysseix, H., Ossona de Mendez, P.O.: Stretching of Jordan arc contact systems. Discrete Applied Mathematics\u00a0155(9), 1079\u20131095 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix De","year":"1990","unstructured":"De Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Felsner, S., Knauer, K., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of L-shapes and segments in the plane. arXiv preprint arXiv:1405.1476 (2014)","DOI":"10.1007\/978-3-662-44465-8_26"},{"issue":"10","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1016\/j.disc.2012.01.024","volume":"312","author":"M.C. Francis","year":"2012","unstructured":"Francis, M.C., Kratochv\u00edl, J., Vysko\u010dil, T.: Segment representation of a subclass of co-planar graphs. Discrete Mathematics\u00a0312(10), 1815\u20131818 (2012)","journal-title":"Discrete Mathematics"},{"key":"26_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman (1979)"},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/net.20305","volume":"54","author":"M.C. Golumbic","year":"2009","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Edge intersection graphs of single bend paths on a grid. Networks\u00a054(3), 130\u2013138 (2009)","journal-title":"Networks"},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"M.C. Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Mathematics\u00a043(1), 37\u201346 (1983)","journal-title":"Discrete Mathematics"},{"issue":"3-4","key":"26_CR18","first-page":"413","volume":"19","author":"A. Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastos. Mat.\u00a019(3-4), 413\u2013441 (1987)","journal-title":"Zastos. Mat."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2013.10.035","volume":"167","author":"D. Heldt","year":"2014","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths: The bend-number. Discrete Appl. Math.\u00a0167, 144\u2013162 (2014)","journal-title":"Discrete Appl. Math."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Kobourov, S.G., Ueckerdt, T., Verbeek, K.: Combinatorial and geometric properties of planar Laman graphs. In: SODA, pp. 1668\u20131678. SIAM (2013)","DOI":"10.1137\/1.9781611973105.120"},{"issue":"1-3","key":"26_CR21","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0012-365X(97)81834-1","volume":"178","author":"J. Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Kub\u011bna, A.: On intersection representations of co-planar graphs. Discrete Mathematics\u00a0178(1-3), 251\u2013255 (1998)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matousek, J.: Intersection graphs of segments. Journal of Combinatorial Theory, Series B\u00a062(2), 289\u2013315 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2-3","key":"26_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(87)90190-7","volume":"64","author":"F. Luccio","year":"1987","unstructured":"Luccio, F., Mazzone, S., Wong, C.K.: A note on visibility graphs. Discrete Mathematics\u00a064(2-3), 209\u2013219 (1987)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0012-365X(92)90688-C","volume":"108","author":"M. Middendorf","year":"1992","unstructured":"Middendorf, M., Pfeiffer, F.: The max clique problem in classes of string-graphs. Discrete Mathematics\u00a0108(1), 365\u2013372 (1992)","journal-title":"Discrete Mathematics"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Pawlik, A., Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free intersection graphs of line segments with large chromatic number. Journal of Combinatorial Theory, Series B (2013)","DOI":"10.1007\/s00454-013-9534-9"},{"key":"26_CR26","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs. PhD thesis, Princeton University (1984)"},{"key":"26_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"133","author":"H.E. Warren","year":"1968","unstructured":"Warren, H.E.: Lower bounds for approximation by nonlinear manifolds. Trans. Amer. Math. Soc.\u00a0133, 167\u2013178 (1968)","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:19:31Z","timestamp":1558970371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}