{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:00:57Z","timestamp":1742922057592,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_19","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T08:53:14Z","timestamp":1330332794000},"page":"186-197","source":"Crossref","is-referenced-by-count":4,"title":["Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles"],"prefix":"10.1007","author":[{"given":"Martin","family":"Fink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Henrik","family":"Haunert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-16926-7_14","volume-title":"Graph Theoretic Concepts in Computer Science","author":"K. Arikushi","year":"2010","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Mori\u0107, F., T\u00f3th, C.: Graphs that Admit Right Angle Crossing Drawings. In: WG 2010. LNCS, vol.\u00a06410, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/jgaa.00132","volume":"10","author":"S. Cabello","year":"2006","unstructured":"Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Alg. Appl.\u00a010(2), 353\u2013366 (2006)","journal-title":"J. Graph Alg. Appl."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory Comput. Syst.\u00a049(3), 565\u2013575 (2011)","journal-title":"Theory Comput. Syst."},{"key":"19_CR4","series-title":"LNCS","volume-title":"GD 2011","author":"E. Giacomo Di","year":"2012","unstructured":"Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M.: Orthogeodesic Point-set Embedding of Trees. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS. Springer, Heidelberg (to appear, 2012)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing Graphs with Right Angle Crossings. In: Dehne, F., Gavrilova, M.L., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput.\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Fink, M., Haunert, J.H., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. ArXiv e-print abs\/1107.4970v1 (2011)","key":"19_CR7","DOI":"10.1007\/978-3-642-25878-7_43"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/s00454-008-9130-6","volume":"42","author":"X. Goaoc","year":"2009","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C.S., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete Comput. Geom.\u00a042(4), 542\u2013569 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified positions. Amer. Math. Mon.\u00a098, 165\u2013166 (1991)","journal-title":"Amer. Math. Mon."},{"doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: Proc. 7th Int. IEEE Asia-Pacific Symp. Inform. Visual (APVIS 2008), pp. 41\u201346 (2008)","key":"19_CR10","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-11805-0_21","volume-title":"Graph Drawing","author":"B. Katz","year":"2010","unstructured":"Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-Geodesic Embedding of Planar Graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 207\u2013218. Springer, Heidelberg (2010)"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. Graph Alg. Appl.\u00a06(1), 115\u2013129 (2002)","journal-title":"J. Graph Alg. Appl."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Inform. Process. Lett.\u00a037(1), 21\u201325 (1991)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Combin.\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs Combin."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s004539910006","volume":"26","author":"A. Papakostas","year":"2000","unstructured":"Papakostas, A., Tollis, I.G.: Efficient orthogonal drawings of high degree graphs. Algorithmica\u00a026, 100\u2013125 (2000)","journal-title":"Algorithmica"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0196-6774(86)90006-4","volume":"7","author":"R. Raghavan","year":"1986","unstructured":"Raghavan, R., Cohoon, J., Sahni, S.: Single bend wiring. J. Algorithms\u00a07(2), 232\u2013257 (1986)","journal-title":"J. Algorithms"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(93)90124-C","volume":"119","author":"F. Rendl","year":"1993","unstructured":"Rendl, F., Woeginger, G.: Reconstructing sets of orthogonal line segments in the plane. Discrete Math.\u00a0119, 167\u2013174 (1993)","journal-title":"Discrete Math."},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0020-0190(01)00221-6","volume":"81","author":"S. Skulrattanakulchai","year":"2002","unstructured":"Skulrattanakulchai, S.: 4-edge-coloring graphs of maximum degree 3 in linear time. Inform. Process. Lett.\u00a081(4), 191\u2013195 (2002)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:37:53Z","timestamp":1558298273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}