{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:38:43Z","timestamp":1725878323767},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_22","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:17:39Z","timestamp":1484029059000},"page":"283-294","source":"Crossref","is-referenced-by-count":0,"title":["Order-Preserving 1-String Representations of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Martin","family":"Derka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-013-9764-5","volume":"67","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Gerasch, A., Kaufmann, M., Kobourov, S.G.: Linear-time algorithms for hole-free rectilinear proportional contact graph representations. Algorithmica 67(1), 3\u201322 (2013)","journal-title":"Algorithmica"},{"key":"22_CR2","unstructured":"Biedl, T., Derka, M.: $$1$$ -string $${B}_1$$ -VPG-representations of planar partial 3-trees and some subclasses. In: Canadian Conference on Computational Geometry (CCCG 2015), pp. 37\u201342 (2015)"},{"issue":"2","key":"22_CR3","first-page":"191","volume":"7","author":"T Biedl","year":"2016","unstructured":"Biedl, T., Derka, M.: $$1$$ -string $${B}_2$$ -VPG representations of planar graphs. J. Comput. Geom. 7(2), 191\u2013215 (2016)","journal-title":"J. Comput. Geom."},{"key":"22_CR4","unstructured":"Biedl, T., Derka, M.: Order-preserving 1-string representations of planar graphs (2016). CoRR abs\/1609.08132"},{"key":"22_CR5","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Refining the hierarchies of classes of geometric intersection graphs (2016). CoRR abs\/1603.08974"},{"key":"22_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: ACM Symposium on Theory of Computing (STOC 2009), pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"issue":"3","key":"22_CR7","doi-asserted-by":"crossref","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 Comput. Geom. 43(3), 626\u2013647 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"22_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. 8165, pp. 139\u2013151. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-45043-3_13"},{"issue":"4","key":"22_CR9","doi-asserted-by":"crossref","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. J. Graph Algorithms Appl. 17(4), 475\u2013494 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.dam.2016.01.028","volume":"206","author":"S Felsner","year":"2016","unstructured":"Felsner, S., Knauer, K.B., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of L-shapes and segments in the plane. Discrete Appl. Math. 206, 48\u201355 (2016)","journal-title":"Discrete Appl. Math."},{"key":"22_CR11","unstructured":"Francis, M.C., Lahiri, A.: VPG and EPG bend-numbers of Halin graphs (2015). CoRR abs\/1505.06036"},{"key":"22_CR12","first-page":"109","volume":"63","author":"H Fraysseix de","year":"1991","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. Intuitive Geom. 63, 109\u2013117 (1991)","journal-title":"Intuitive Geom."},{"issue":"1","key":"22_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0020-0190(98)00139-2","volume":"68","author":"R Govindan","year":"1998","unstructured":"Govindan, R., Langston, M.A., Yan, X.: Approximating the pathwidth of outerplanar graphs. Inf. Process. Lett. 68(1), 17\u201323 (1998)","journal-title":"Inf. Process. Lett."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.comgeo.2016.05.001","volume":"60","author":"JM Keil","year":"2016","unstructured":"Keil, J.M., Mitchell, J.S., Pradhan, D., Vatshelle, M.: An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60, 19\u201325 (2016)","journal-title":"Comput. Geom."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Kobourov, S.G., Ueckerdt, T., Verbeek, K.: Combinatorial and geometric properties of planar Laman graphs. In: SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 1668\u20131678 (2013)","DOI":"10.1137\/1.9781611973105.120"},{"issue":"1","key":"22_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs II recognizing string graphs is NP-hard. J. Comb. Theor. Ser. B 52(1), 67\u201378 (1991)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2","key":"22_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theor. Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"22_CR18","doi-asserted-by":"crossref","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 Math. 108, 365\u2013372 (1992)","journal-title":"Discrete Math."},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(93)90176-T","volume":"111","author":"M Middendorf","year":"1993","unstructured":"Middendorf, M., Pfeiffer, F.: Weakly transitive orientations, hasse diagrams and string graphs. Discrete Math. 111, 393\u2013400 (1993)","journal-title":"Discrete Math."},{"issue":"2","key":"22_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs is in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR21","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs. Ph.D. thesis, Princeton University (1984)"},{"key":"22_CR22","first-page":"207","volume-title":"Graphs, Hypergraphs and Applications","author":"W Wessel","year":"1985","unstructured":"Wessel, W., P\u00f6schel, R.: On circle graphs. In: Sachs, H. (ed.) Graphs, Hypergraphs and Applications, pp. 207\u2013210. Teubner, Leipzig (1985)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:46:24Z","timestamp":1498376784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}