{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:10:04Z","timestamp":1745964604808,"version":"3.40.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T00:00:00Z","timestamp":1361232000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00287-013-0682-3","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T05:22:38Z","timestamp":1361251358000},"page":"162-173","source":"Crossref","is-referenced-by-count":2,"title":["Algorithm Engineering im Graphenzeichnen"],"prefix":"10.1007","volume":"36","author":[{"given":"Martin","family":"Gronemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,19]]},"reference":[{"key":"682_CR1","unstructured":"Bachmaier C, Brandenburg FJ, Effinger P, Gutwenger C, Katajainen J, Klein K, Sp\u00f6nemann M, Stegmaier M, Wybrow M (2011) The open graph archive: a community-driven effort. In: Proc Graph Drawing 2011, LNCS, vol 7034, Springer, 435\u2013440"},{"key":"682_CR2","doi-asserted-by":"crossref","unstructured":"Batini C, Talamo M, Tamassia R (1984) Computer aided layout of entity relationship diagrams. J Syst Softw 4:163\u2013173","DOI":"10.1016\/0164-1212(84)90006-2"},{"key":"682_CR3","unstructured":"de Berg M, Onak K, Sidiropoulos A (2010) Fat polygonal partitions with applications to visualization and embeddings. CoRR, abs\/1009.1866"},{"key":"682_CR4","doi-asserted-by":"crossref","unstructured":"Buchheim C, Chimani M, Ebner D, Gutwenger C, J\u00fcnger M, Klau GW, Mutzel P, Weiskircher R (2008) A branch-and-cut approach to the crossing number problem. Discrete Optim 5(2):373\u2013388","DOI":"10.1016\/j.disopt.2007.05.006"},{"key":"682_CR5","unstructured":"Buchheim C, Chimani M, Gutwenger C, J\u00fcnger M, Mutzel P (2012) Crossings and planarization. In: Tamassia R (ed) Handbook of Graph Drawing and Visualization, Chap. 2. CRC Press. http:\/\/www.cs.brown.edu\/\u223crt\/gdhandbook\/chapters\/crossings.pdf, last access 14.2.2013. To appear"},{"key":"682_CR6","doi-asserted-by":"crossref","unstructured":"Cabello S, Mohar B (2011) Crossing number and weighted crossing number of near-planar graphs. Algorithmica 60(3):484\u2013504","DOI":"10.1007\/s00453-009-9357-5"},{"key":"682_CR7","doi-asserted-by":"crossref","unstructured":"Chimani M, Gutwenger C (2009) Non-planar core reduction of graphs. Discrete Math 309(7):1838\u20131855","DOI":"10.1016\/j.disc.2007.12.078"},{"key":"682_CR8","doi-asserted-by":"crossref","unstructured":"Chimani M, Gutwenger C (2012) Advances in the planarization method: Effective multiple edge insertions. J Graph Algor Appl 16(3):729\u2013757","DOI":"10.7155\/jgaa.00264"},{"key":"682_CR9","doi-asserted-by":"crossref","unstructured":"Chimani M, Gutwenger C, Mutzel P, Wolf C (2009) Inserting a vertex into a planar graph. In: Proc SODA 2009. ACM Press, 375\u2013383","DOI":"10.1137\/1.9781611973068.42"},{"key":"682_CR10","unstructured":"Chimani M, Hlin\u011bn\u00fd P (2011) A tighter insertion-based approximation of the crossing number. In: Proc ICALP 2011, LNCS, vol 6755. Springer, 122\u2013134. Full version at ArXiv, id 1104.5039"},{"key":"682_CR11","doi-asserted-by":"crossref","unstructured":"Chimani M, Hlin\u011bn\u00fd P, Mutzel P (2012) Vertex insertion approximates the crossing number of apex graphs. Eur J Comb 33(3):326\u2013335","DOI":"10.1016\/j.ejc.2011.09.009"},{"key":"682_CR12","doi-asserted-by":"crossref","unstructured":"Chimani M, Mutzel P, Bomze IM (2008) A new approach to exact crossing minimization. In: Proc ESA 2008, LNCS, vol 5193. Springer, 284\u2013296","DOI":"10.1007\/978-3-540-87744-8_24"},{"key":"682_CR13","doi-asserted-by":"crossref","unstructured":"Cortese PF, Battista GD, Moneta A, Patrignani M, Pizzonia M (2006) Topographic visualization of prefix propagation in the internet. IEEE Trans Vis Comput Graph 12(5):725\u2013732","DOI":"10.1109\/TVCG.2006.185"},{"key":"682_CR14","doi-asserted-by":"crossref","unstructured":"Di Battista G, Tamassia R (1996) On-line planarity testing. SIAM J Comput 25(5):956\u2013997","DOI":"10.1137\/S0097539794280736"},{"key":"682_CR15","doi-asserted-by":"crossref","unstructured":"Gansner ER, Hu Y, Kobourov SG (2010) GMap: Visualizing graphs and clusters as maps. In: Proc PacificVis 2010. IEEE, 201\u2013208","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"key":"682_CR16","doi-asserted-by":"crossref","unstructured":"Gansner ER, Hu Y, Kobourov SG, Volinsky C (2009) Putting recommendations on the map: visualizing clusters and relations. In: Proc RecSys 2009. ACM, 345\u2013348","DOI":"10.1145\/1639714.1639784"},{"key":"682_CR17","doi-asserted-by":"crossref","unstructured":"Girvan M, Newman MEJ (2002) Community Structure in Social and Biological Networks. Proc Natl Acad Sci 99:7821\u20137826","DOI":"10.1073\/pnas.122653799"},{"key":"682_CR18","doi-asserted-by":"crossref","unstructured":"Gronemann M, J\u00fcnger M (2012) Drawing clustered graphs as topographic maps. In: Proc Graph Drawing 2012. To appear","DOI":"10.1007\/978-3-642-36763-2_38"},{"key":"682_CR19","unstructured":"Gronemann M, J\u00fcnger M, Kriege N, Mutzel P (2012) MolMap: Visualizing molecule libraries as topographic maps. Tech. rep., Universit\u00e4t zu K\u00f6ln"},{"key":"682_CR20","unstructured":"Gutwenger C (2010) Application of SPQR-trees in the planarization approach for drawing graphs. Ph.D. thesis, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund. http:\/\/hdl.handle.net\/2003\/27430, last access 14.2.2013"},{"key":"682_CR21","doi-asserted-by":"crossref","unstructured":"Gutwenger C, Mutzel P (2003) An experimental study of crossing minimization heuristics. In: Liotta G (ed) Proc Graph Drawing 2003, LNCS, vol 2912. Springer, 13\u201324","DOI":"10.1007\/978-3-540-24595-7_2"},{"key":"682_CR22","unstructured":"Gutwenger C, Mutzel P, Weiskircher R (2001) Inserting an edge into a planar graph. In: Proc SODA 2001. ACM Press, 246\u2013255"},{"key":"682_CR23","doi-asserted-by":"crossref","unstructured":"Gutwenger C, Mutzel P, Weiskircher R (2005) Inserting an edge into a planar graph. Algorithmica 41(4), 289\u2013308","DOI":"10.1007\/s00453-004-1128-8"},{"key":"682_CR24","unstructured":"Hachul S, J\u00fcnger M (2004) Drawing large graphs with a potential-field-based multilevel algorithm. In: Proc Graph Drawing 2004, LNCS, vol 3383, 285\u2013295"},{"key":"682_CR25","unstructured":"Hlin\u011bn\u00fd P, Salazar G (2006) On the crossing number of almost planar graphs. In: Kaufmann M, Wagner D (eds) Proc Graph Drawing 2006, LNCS, vol 4372. Springer, 162\u2013173"},{"key":"682_CR26","doi-asserted-by":"crossref","unstructured":"J\u00fcnger M, Mutzel P (2004) Graph Drawing Software. Springer-Verlag","DOI":"10.1007\/978-3-642-18638-7"},{"key":"682_CR27","doi-asserted-by":"crossref","unstructured":"Purchase HC, Carrington DA, Allder JA (2002) Empirical evaluation of aesthetics-based graph layout. Empir Softw Eng 7(3):233\u2013255","DOI":"10.1023\/A:1016344215610"},{"key":"682_CR28","doi-asserted-by":"crossref","unstructured":"Schulz HJ (2011) Treevis.net: A tree visualization reference. IEEE Comput Graph Appl 31(6):11\u201315","DOI":"10.1109\/MCG.2011.103"},{"key":"682_CR29","doi-asserted-by":"crossref","unstructured":"Wise JA, Thomas JJ, Pennock K, Lantrip D, Pottier M, Schur A, Crow V (1995) Visualizing the non-visual: spatial analysis and interaction with information from text documents. In: Proc InfoVis 1995, 51\u201358. IEEE Computer Society","DOI":"10.1109\/INFVIS.1995.528686"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0682-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-013-0682-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0682-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:36:18Z","timestamp":1745962578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-013-0682-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,19]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["682"],"URL":"https:\/\/doi.org\/10.1007\/s00287-013-0682-3","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"type":"print","value":"0170-6012"},{"type":"electronic","value":"1432-122X"}],"subject":[],"published":{"date-parts":[[2013,2,19]]}}}