{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:03Z","timestamp":1725558963745},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_28","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"332-343","source":"Crossref","is-referenced-by-count":39,"title":["Crossing Reduction in Circular Layouts"],"prefix":"10.1007","author":[{"given":"Michael","family":"Baur","sequence":"first","affiliation":[]},{"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. Technical Report 2004-14, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (August 2004)","DOI":"10.1007\/978-3-540-30559-0_28"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications\u00a07, 303\u2013326 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-62495-3_40","volume-title":"Graph Drawing","author":"U. Do\u02d8grus\u00f6z","year":"1997","unstructured":"Do\u011frus\u00f6z, U., Madden, B., Madden, P.: Circular layout in the Graph Layout Toolkit. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 92\u2013100. Springer, Heidelberg (1997)"},{"issue":"A","key":"28_CR4","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria\u00a021(A), 89\u201398 (1986)","journal-title":"Ars Combinatoria"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica\u00a011, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"28_CR6","unstructured":"He, H., S\u00fdkora, O.: New circular drawing algorithms. Unpublished manuscript"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/00207168808803629","volume":"24","author":"E. M\u00e1kinen","year":"1988","unstructured":"M\u00e4kinen, E.: On circular layouts. International Journal of Computer Mathematics\u00a024, 29\u201337 (1988)","journal-title":"International Journal of Computer Mathematics"},{"key":"28_CR8","unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NPcompleteness of a computer network layout problem. In: Proc. IEEE Intl. Symp. Circuits and Systems, 292\u2013295 (1987)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Graph Drawing","author":"C. Matuszewski","year":"1999","unstructured":"Matuszewski, C., Sch\u00f6nfeld, R., Molitor, P.: Using sifting for k-layer straightline crossing minimization. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 217\u2013224. Springer, Heidelberg (1999)"},{"key":"28_CR10","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"issue":"5","key":"28_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S.L. Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Information Processing Letters\u00a09(5), 229\u2013232 (1979)","journal-title":"Information Processing Letters"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. IEEE Intl. Conf. Computer Aided Design (ICCAD 1993), pp. 42\u201347 (1993)","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-59071-4_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Shahrokhi","year":"1995","unstructured":"Shahrokhi, F., S\u00fdkora, O., L\u00e1szl\u00f3, L., Sz\u00e9kely, A., Vrto, I.: Book embeddings and crossing numbers. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol.\u00a0903, pp. 256\u2013268. Springer, Heidelberg (1995)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-48518-X_4","volume-title":"Algorithm Engineering and Experimentation","author":"J.M. Six","year":"1999","unstructured":"Six, J.M., Tollis, I.G.: Circular drawings of biconnected graphs. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, pp. 57\u201373. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:21Z","timestamp":1605759741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}