{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:47Z","timestamp":1725543467942},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_26","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"268-279","source":"Crossref","is-referenced-by-count":0,"title":["Acyclic Orientation of Drawings"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Ackerman","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11537311_33","volume-title":"Fundamentals of Computation Theory","author":"A. Grigoriev","year":"2005","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 378\u2013387. Springer, Heidelberg (2005)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Pach, J., Radoicic, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. In: Proc. 20th ACM Symp. on Computational Geometry (SoCG), Brooklyn, NY, pp. 68\u201375 (2004)","DOI":"10.1145\/997817.997831"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica\u00a017(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Dietz, P., Sleator, D.: Two algorithms for maintaining order in a list. In: Proc. 19th Ann. ACM Symp. on Theory of Computing (STOC), NYC, NY, pp. 365\u2013372 (1987)","DOI":"10.1145\/28395.28434"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th Ann. ACM Symp. on Theory of Computing (STOC), San Diego, CA, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","first-page":"130","volume-title":"STACS 86","author":"R. Tamassia","year":"1985","unstructured":"Tamassia, R., Tollis, I.G.: Algorithms for visibility representations of planar graphs. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol.\u00a0210, pp. 130\u2013141. Springer, Heidelberg (1985)"},{"key":"26_CR7","unstructured":"Even, S.: Graph Algorithms. Computer Science Press (1979)"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Theoretical Computer Science\u00a02(3), 339\u2013344 (1976)","journal-title":"Theoretical Computer Science"},{"key":"26_CR9","unstructured":"Habert, L., Pocchiola, M.: A homotopy theorem for arrangements of double pseudolines. In: Proc. 20th European Workshop on Comput. Geom. (EWCG), Delphi, Greece, pp. 211\u2013214 (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:19Z","timestamp":1619507959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11785293_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}