{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:56:25Z","timestamp":1762865785911},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_18","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"195-207","source":"Crossref","is-referenced-by-count":14,"title":["Lombardi Drawings of Graphs"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Aichholzer, O., Aigner, W., Aurenhammer, F., Dobi\u00e1\u0161ov\u00e1, K.\u010c., J\u00fcttler, B.: Arc triangulations. In: Proc. 26th Eur. Worksh. Comp. Geometry (EuroCG 2010), Dortmund, Germany, pp. 17\u201320 (2010)"},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(02)00446-5","volume":"85","author":"N. Alon","year":"2003","unstructured":"Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Information Processing Letters\u00a085(6), 301\u2013302 (2003), doi:10.1016\/S0020-0190(02)00446-5","journal-title":"Information Processing Letters"},{"key":"18_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), http:\/\/www.springerlink.com\/content\/fepu2a3hd195ffjg\/"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jagm.2000.1132","volume":"38","author":"T.C. Biedl","year":"2001","unstructured":"Biedl, T.C., Bose, P., Demaine, E.D., Lubiw, A.: Efficient algorithms for Petersen\u2019s matching theorem. J. Algorithms\u00a038(1), 110 (2001), doi:10.1006\/jagm.2000.1132","journal-title":"J. Algorithms"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-70904-6_7","volume-title":"Graph Drawing","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Schlieper, B.: Angle and distance constraints on tree drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 54\u201365. Springer, Heidelberg (2007), doi:10.1007\/978-3-540-70904-6_7"},{"key":"18_CR6","first-page":"23","volume-title":"Data Visualization 2000. Proc. 2nd Eurographics\/IEEE TCVG Symp. Visualization (VisSym 2000)","author":"U. Brandes","year":"2000","unstructured":"Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: Data Visualization 2000. Proc. 2nd Eurographics\/IEEE TCVG Symp. Visualization (VisSym 2000), pp. 23\u201332. Springer, Heidelberg (2000)"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00028","volume":"4","author":"U. Brandes","year":"2000","unstructured":"Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. J. Graph Algorithms Appl.\u00a04(3), 135\u2013155 (2000)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s004540010080","volume":"25","author":"C.C. Cheng","year":"2001","unstructured":"Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planar graphs with circular arcs. Discrete Comput. Geom.\u00a025(3), 405\u2013418 (2001), doi:10.1007\/s004540010080","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica\u00a021(1), 5\u201312 (2001), doi:10.1007\/s004930170002","journal-title":"Combinatorica"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista di","year":"1996","unstructured":"di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math.\u00a09(3), 349 (1996), doi:10.1137\/S0895480194264010","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi Drawings of Graphs. (September 2010) ArXiv e-prints, arXiv:1009.0579","DOI":"10.1007\/978-3-642-18469-7_18"},{"key":"18_CR12","volume-title":"Proc. 18th Int. Symp. on Graph Drawing (GD 2010)","author":"C.A. Duncan","year":"2010","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Drawing trees with perfect angular resolution and polynomial area. In: Proc. 18th Int. Symp. on Graph Drawing (GD 2010), Springer, Heidelberg (2010)"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.7155\/jgaa.00140","volume":"11","author":"A. Efrat","year":"2007","unstructured":"Efrat, A., Erten, C., Kobourov, S.G.: Fixed-location circular arc drawing of planar graphs. J. Graph Algorithms Appl.\u00a011(1), 145\u2013164 (2007), http:\/\/jgaa.info\/accepted\/2007\/EfratErtenKobourov2007.11.1.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005), doi:10.1007\/978-3-540-31843-9_46"},{"issue":"4","key":"18_CR15","first-page":"345","volume":"5","author":"H.N. Gabow","year":"1976","unstructured":"Gabow, H.N.: Using Euler partitions to edge color bipartite multigraphs. Int. J. Parallel Programming\u00a05(4), 345\u2013355 (1976), doi:10.1007\/BF00998632","journal-title":"Int. J. Parallel Programming"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 386\u2013398. Springer, Heidelberg (2007), doi:10.1007\/978-3-540-70904-6_37"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BFb0049393","volume-title":"Algorithms - ESA \u201994","author":"A. Garg","year":"1994","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: algorithms and bounds. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 12\u201323. Springer, Heidelberg (1994), doi:10.1007\/BFb0049393"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"1999","unstructured":"Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 167\u2013182. Springer, Heidelberg (1999), doi:10.1007\/3-540-37623-2_13"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BF01363288","volume":"156","author":"R. Halin","year":"1964","unstructured":"Halin, R.: \u00dcber simpliziale Zerf\u00e4llungen beliebiger (endlicher oder unendlicher) Graphen. Math. Ann.\u00a0156(3), 216\u2013225 (1964), doi:10.1007\/BF01363288","journal-title":"Math. Ann."},{"issue":"4","key":"18_CR20","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM\u00a048(4), 723\u2013760 (2001), doi:10.1145\/502090.502095","journal-title":"J. ACM"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996), doi:10.1007\/BF02086606","journal-title":"Algorithmica"},{"key":"18_CR22","first-page":"116","volume":"38","author":"D. K\u0151nig","year":"1931","unstructured":"K\u0151nig, D.: Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok\u00a038, 116\u2013119 (1931)","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"D.R. Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: K-degenerate graphs. Canad. J. Math.\u00a022, 1082\u20131096 (1970), http:\/\/www.smc.math.ca\/cjm\/v22\/p1082","journal-title":"Canad. J. Math."},{"key":"18_CR24","unstructured":"Lombardi, M., Hobbs, R.: Mark Lombardi: Global Networks. Independent Curators (2003)"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S. Malitz","year":"1994","unstructured":"Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math.\u00a07(2), 172\u2013183 (1994), doi:10.1137\/S0895480193242931","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"347","DOI":"10.2140\/pjm.1994.165.347","volume":"165","author":"F. Morgan","year":"1994","unstructured":"Morgan, F.: Soap bubbles in \u211d2 and in surfaces. Pacific J. Math.\u00a0165(2), 347\u2013361 (1994), http:\/\/projecteuclid.org\/euclid.pjm\/1102621620","journal-title":"Pacific J. Math."},{"issue":"1-3","key":"18_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0012-365X(92)90639-W","volume":"100","author":"H.M. Mulder","year":"1992","unstructured":"Mulder, H.M.: Julius Petersen\u2019s theory of regular graphs. Discrete Mathematics\u00a0100(1-3), 157\u2013175 (1992), doi:10.1016\/0012-365X(92)90639-W","journal-title":"Discrete Mathematics"},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren Graphs. Acta Math.\u00a015(1), 193\u2013220 (1891), doi:10.1007\/BF02392606","journal-title":"Acta Math."},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A. Schrijver","year":"1999","unstructured":"Schrijver, A.: Bipartite edge coloring in O(\u0394m) time. SIAM J. Comput.\u00a028(3), 841\u2013846 (1999), doi:10.1137\/S0097539796299266","journal-title":"SIAM J. Comput."},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-46648-7_11","volume-title":"Graph Drawing","author":"J.M. Six","year":"1999","unstructured":"Six, J.M., Tollis, I.G.: A framework for circular drawings of networks. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 107\u2013116. Springer, Heidelberg (1999)"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proc. 32nd ACM Symp. Theory of Computing (STOC 2000), pp. 343\u2013350 (2000), doi:10.1145\/335305.335345","DOI":"10.1145\/335305.335345"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:44:57Z","timestamp":1559983497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}