{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:52Z","timestamp":1725524632737},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_30","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"313-318","source":"Crossref","is-referenced-by-count":0,"title":["Connected Rectilinear Graphs on Point Sets"],"prefix":"10.1007","author":[{"given":"Maarten","family":"L\u00f6ffler","sequence":"first","affiliation":[]},{"given":"Elena","family":"Mumford","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Durocher, S., Kirkpatrick, D.: On the hardness of turn-angle-restricted rectilinear cycle cover problems. In: CCCG 2002, pp. 13\u201316 (2002)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.: Topologically sweeping an arrangement. J. Comput. Syst. Sci.\u00a038, 165\u2013194 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-24595-7_14","volume-title":"Graph Drawing","author":"A. Efrat","year":"2004","unstructured":"Efrat, A., Erten, C., Kobourov, S.: Fixed-location circular-arc drawing of planar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 147\u2013158. Springer, Heidelberg (2004)"},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S. Fekete","year":"1997","unstructured":"Fekete, S., Woeginger, G.: Angle-restricted tours in the plane. Comput. Geom. Theory Appl.\u00a08(4), 195\u2013218 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"M. Fredman","year":"1976","unstructured":"Fredman, M.: How good is the information theory bound in sorting? Theoret. Comput. Sci.\u00a01, 355\u2013361 (1976)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2002","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. on Computing\u00a031(2), 601\u2013625 (2002)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(88)90032-4","volume":"29","author":"F. Hoffman","year":"1988","unstructured":"Hoffman, F., Kriegel, K.: Embedding rectilinear graphs in linear time. Inf. Process. Lett.\u00a029(2), 75\u201379 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.: The complexity of detecting crossingfree configurations in the plane. BIT\u00a033(4), 580\u2013595 (1993)","journal-title":"BIT"},{"key":"30_CR9","unstructured":"L\u00f6ffler, M., Mumford, E.: Connected rectilinear polygons on point sets (2008), http:\/\/www.cs.uu.nl\/research\/techreps\/UU-CS-2008-028.html"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J.: Uniqueness of orthogonal connect-the-dots. In: Toussaint, G. (ed.) Computational Morphology, pp. 97\u2013104 (1988)","DOI":"10.1016\/B978-0-444-70467-2.50013-8"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-37623-2_20","volume-title":"Graph Drawing","author":"J. Pach","year":"1999","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 263\u2013274. Springer, Heidelberg (1999)"},{"key":"30_CR12","unstructured":"Rappaport, D.: On the complexity of computing orthogonal polygons from a set of points. Technical Report TR-SOCS-86.9, McGill Univ., Montreal, PQ (1986)"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0214027","volume":"14","author":"G. Vijayan","year":"1985","unstructured":"Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM J. on Computing\u00a014(2), 355\u2013372 (1985)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T20:06:46Z","timestamp":1558123606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}