{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:53Z","timestamp":1725500753144},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_28","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T11:36:53Z","timestamp":1358768213000},"page":"298-309","source":"Crossref","is-referenced-by-count":2,"title":["Circular Graph Drawings with Large Crossing Angles"],"prefix":"10.1007","author":[{"given":"Hooman","family":"Reisi Dehkordi","sequence":"first","affiliation":[]},{"given":"Quan","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"The Rome graphs (2010), \n                    \n                      http:\/\/www.graphdrawing.org\/data\/index.html"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-18381-2_6","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"E.N. Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem Is NP-Hard. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 74\u201385. Springer, Heidelberg (2011)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing Reduction in Circular Layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 332\u2013343. Springer, Heidelberg (2004)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Reisi Dehkordi, H., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing. International Journal of Computational Geometry and Applications (to appear, 2012)","DOI":"10.1142\/S021819591250015X"},{"key":"28_CR5","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall (July 1998)"},{"key":"28_CR6","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., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"39","key":"28_CR7","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W. Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theoretical Computer Science\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theoretical Computer Science"},{"key":"28_CR8","unstructured":"Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Computing: The Australasian Theory Symposium (2010)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-642-25878-7_15","volume-title":"GD 2011","author":"P. Eades","year":"2012","unstructured":"Eades, P., Liotta, G.: Right Angle Crossing Graphs and 1-Planarity. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 148\u2013153. Springer, Heidelberg (2012)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-25011-8_13","volume-title":"Combinatorial Algorithms","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-Layer Right Angle Crossing Drawings. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 156\u2013169. Springer, Heidelberg (2011)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: Proceedings of PacificVis, pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-18469-7_40","volume-title":"Graph Drawing","author":"Q. Nguyen","year":"2011","unstructured":"Nguyen, Q., Eades, P., Hong, S.-H., Huang, W.: Large Crossing Angles in Circular Layouts. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 397\u2013399. Springer, Heidelberg (2011)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1996","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 435\u2013446. Springer, Heidelberg (1996)"},{"key":"28_CR14","unstructured":"Reisi Dehkordi, H., Nguyen, Q., Eades, P., Hong, S.H.: Circular graph drawings with large crossing angles. Technical Report TR691, School of Information Technologies, University of Sydney"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:35:01Z","timestamp":1620120901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}