{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:05:13Z","timestamp":1725674713843},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_39","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"458-469","source":"Crossref","is-referenced-by-count":6,"title":["On the Bend-Number of Planar and Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Heldt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kolja","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"14","key":"39_CR1","doi-asserted-by":"publisher","first-page":"3174","DOI":"10.1016\/j.dam.2009.06.015","volume":"157","author":"A. Asinowski","year":"2009","unstructured":"Asinowski, A., Suk, A.: Edge intersection graphs of systems of paths on a grid with a bounded number of bends. Discrete Appl. Math.\u00a0157(14), 3174\u20133180 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"39_CR2","first-page":"1","volume":"12","author":"T. Biedl","year":"2010","unstructured":"Biedl, T., Stern, M.: On edge-intersection graphs of k-bend paths in grids. Discrete Math. Theor. Comput. Sci.\u00a012(1), 1\u201312 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1-2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/12.46293","volume":"39","author":"M.L. Brady","year":"1990","unstructured":"Brady, M.L., Sarrafzadeh, M.: Stretching a knock-knee layout for multilayer wiring. IEEE Trans. Comput.\u00a039(1), 148\u2013151 (1990)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Combin. Probab. Comput.\u00a03(2), 233\u2013246 (1994)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0012-365X(90)90293-Q","volume":"80","author":"E.S. El-Mallah","year":"1990","unstructured":"El-Mallah, E.S., Colbourn, C.J.: On two dual classes of planar graphs. Discrete Math.\u00a080(1), 21\u201340 (1990)","journal-title":"Discrete Math."},{"issue":"8","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.disc.2007.07.064","volume":"308","author":"M.C. Golumbic","year":"2008","unstructured":"Golumbic, M.C., Lipshteyn, M., Stern, M.: Representing edge intersection graphs of paths on degree 4 trees. Discrete Math.\u00a0308(8), 1381\u20131387 (2008)","journal-title":"Discrete Math."},{"issue":"3","key":"39_CR8","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"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.endm.2005.06.064","volume":"22","author":"D. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, D., Ochem, P.: On some arboricities in planar graphs. Electronic Notes in Discrete Mathematics\u00a022, 427\u2013432 (2005), 7th International Colloquium on Graph Theory","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"39_CR10","unstructured":"Gy\u00e1rf\u00e1s, A., West, D.: Multitrack interval graphs. In: Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, vol.\u00a0109, pp. 109\u2013116 (1995)"},{"issue":"3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190030302","volume":"3","author":"F. Harary","year":"1979","unstructured":"Harary, F., Trotter Jr., W.T.: On double and multiple interval graphs. J. Graph Theory\u00a03(3), 205\u2013211 (1979)","journal-title":"J. Graph Theory"},{"key":"39_CR12","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: Edge-intersection graphs of grid paths \u2013 the bend-number, preprint, arXiv:1009.2861v1 (math.CO) (2010)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Heldt, D., Knauer, K., Ueckerdt, T.: On the bend-number of planar and outerplanar graphs, preprint, arXiv:1112.3353v1 (math.CO) (2011)","DOI":"10.1007\/978-3-642-29344-3_39"},{"key":"39_CR14","unstructured":"Kostochka, A.V., West, D.B.: Every outerplanar graph is the union of two interval graphs. In: Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, vol.\u00a0139, pp. 5\u20138 (1999)"},{"issue":"2","key":"39_CR15","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 dual of planar graphs. Networks\u00a015(2), 145\u2013157 (1985)","journal-title":"Networks"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Lai, Y.-T., Leinwand, S.M.: An algorithm for building rectangular floor-plans. In: 21st Design Automation Conference (DAC 1984), pp. 663\u2013664 (1984)","DOI":"10.1109\/DAC.1984.1585874"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.endm.2009.07.005","volume":"34","author":"B. Ries","year":"2009","unstructured":"Ries, B.: Some properties of edge intersection graphs of single bend path on a grid. Electronic Notes in Discrete Mathematics\u00a034, 29\u201333 (2009); European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"39_CR18","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0095-8956(83)90050-3","volume":"35","author":"E.R. Scheinerman","year":"1983","unstructured":"Scheinerman, E.R., West, D.B.: The interval number of a planar graph: three intervals suffice. J. Combin. Theory Ser. B\u00a035(3), 224\u2013239 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"39_CR19","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 maps. Journal of the London Mathematical Society\u00a028, 336\u2013342 (1953)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:35:38Z","timestamp":1620128138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}