{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:44:58Z","timestamp":1725655498268},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630661"},{"type":"electronic","value":"9783642608315"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/978-3-642-60831-5_10","type":"book-chapter","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T00:16:28Z","timestamp":1327450588000},"page":"58-67","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen f\u00fcr diskrete Probleme und ihre Anwendungen"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Lengauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"626","volume":"265","author":"HKB Beck","year":"1992","unstructured":"H.K.B. Beck, H.-P. Galil, R. Henkel, and E. Sedlmayr. Chemistry in circumstellar shells, 1. chromospheric radiation fields and dust formation in optically thin shells of M-giants.Astron. Astrophys., 265: 626 \u2013 642, 1992.","journal-title":"Astron. Astrophys"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0021792","volume":"1027","author":"FJ Brandenburg","year":"1996","unstructured":"F.J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms.Proc. Graph Drawing \u201995, LNCS, 1027:76\u201387, 1996","journal-title":"Proc. Graph Drawing \u201995"},{"key":"10_CR3","first-page":"4","volume-title":"Informatik Spektrum","author":"FJ Brandenburg","year":"1997","unstructured":"F.J. Brandenburg, M. Junger, and P. Mutzel. Algorithmen zum automatischen Zeichnen von Graphen.Informatik Spektrum, 4, 1997."},{"key":"10_CR4","first-page":"1027","volume-title":"Proceedings Graph Drawing \u201995. LNCS","year":"1996","unstructured":"F. J. Brandenburg (ed.). Proceedings Graph Drawing\u201995. LNCS, 1027, 1996."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"C. De Simone and M. J\u00fcnger. On the two-connected planar spanning subgraph polytope.Technical Report No. 96.229, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1996, erscheint in Discrete Applied Mathematics.","DOI":"10.1016\/S0166-218X(97)00087-5"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: an annotated bibliography.Comput. Geometry: Theory Appl., 4: 235 \u2013 282, 1994.","journal-title":"Comput. Geometry: Theory Appl"},{"key":"10_CR7","volume-title":"Congressus Numerantium","author":"P Eades","year":"1984","unstructured":"P. Eades. A heuristic for graph drawing.Congressus Numerantium, 42:149\u2013160, 1984."},{"key":"10_CR8","volume-title":"Manuskript, Universit\u00e4t Passau","author":"M Himsolt","year":"1996","unstructured":"M. Himsolt. A graph file format.Manuskript, Universit\u00e4t Passau, 1996."},{"key":"10_CR9","volume-title":"Proc. 3rd IPCO Conference","author":"M J\u00fcnger","year":"1993","unstructured":"M. J\u00fcnger and P. Mutzel. Solving the maximum planar subgraph problem by branch and cut. In L.A. Wolsey and G. Rinaldi (Ed.),Proc. 3rd IPCO Conference, Erice, 479\u2013492, 1993."},{"key":"10_CR10","volume-title":"Proc. Graph Drawing \u20199I, LNCS","author":"M J\u00fcnger","year":"1995","unstructured":"M. J\u00fcnger and P. Mutzel. The polyhedral approach to the maximum planar subgraph problem: New chances for related problems.Proc. Graph Drawing \u20199I, LNCS, 894:119\u2013130, 1995."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M J\u00fcnger","year":"1996","unstructured":"M. J\u00fcnger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools.Algorithmica, 16: 33 \u2013 59, 1996.","journal-title":"Algorithmica"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BFb0021817","volume-title":"Proc. Graph Drawing \u201995, LNCS","author":"M J\u00fcnger","year":"1996","unstructured":"M. J\u00fcnger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization.Proc. Graph Drawing \u201995, LNCS, 1027:337\u2013348, 1996, revidierte Version erscheint in J. Graph Algorithms and Applications."},{"key":"10_CR13","volume-title":"Technical Report No. 97.260, Institut f\u00fcr Informatik, Universit\u00e4t zu k\u00f6ln","author":"M J\u00fcnger","year":"1997","unstructured":"M. J\u00fcnger and S. Thienel. The design of the branch and cut system ABACUS. Technical Report No. 97.260,Institut f\u00fcr Informatik, Universit\u00e4t zu k\u00f6ln, 1997."},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"K. Kuratowski. Sur le problem des courbes gauches en topologie.Fund. Math., 15: 271 \u2013 283, 1930.","journal-title":"Fund. Math"},{"key":"10_CR15","volume-title":"Technical Report No. 96.24.2, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln","author":"S Leipert","year":"1996","unstructured":"S. Leipert. The Tree Interface - Version 1.0 User Manual.Technical Report No. 96.24.2, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1996."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01940648","volume":"16","author":"K Mehlhorn","year":"1996","unstructured":"K. Mehlhorn and P. Mutzel. On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm.Algorithmica, 16: 233 \u2013 242, 1996.","journal-title":"Algorithmica"},{"key":"10_CR17","first-page":"96","volume":"38","author":"K Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Comm. Assoc.Comput. Mach., 38:96\u2013102, 1995.","journal-title":"Comm. Assoc. Comput. Mach"},{"key":"10_CR18","first-page":"494","volume":"979","author":"P Mutzel","year":"1995","unstructured":"P. Mutzel. A polyhedral approach to planar augmentation and related problems.Proc. ESA \u201995, LNCS, 979: 494 \u2013 507, 1995.","journal-title":"Proc. ESA \u201995, LNCS"},{"key":"10_CR19","volume-title":"Proc. Graph Drawing \u201996, LNCS","author":"P Mutzel","year":"1997","unstructured":"P. Mutzel. An alternative approach for drawing hierarchical graphs.Proc. Graph Drawing \u201996, LNCS, erscheint 1997."},{"volume-title":"Proceedings Graph Drawing \u201996. LNCS","year":"1997","key":"10_CR20","unstructured":"S. North (ed.). Proceedings Graph Drawing\u201996. LNCS, erscheint 1997."},{"key":"10_CR21","first-page":"435","volume-title":"Validating graph drawing aesthetics. Proc. Graph Drawing \u201995, LNCS","author":"HC Purchase","year":"1996","unstructured":"H.C. Purchase, R.F. Cohen, and M. James. Validating graph drawing aesthetics.Proc. Graph Drawing \u201995, LNCS, 1027:435\u2013446, 1996."},{"key":"10_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","volume-title":"Design of Survivable Networks. Lecture Notes in Mathematics","author":"M Stoer","year":"1992","unstructured":"M. Stoer.Design of Survivable Networks. Lecture Notes in Mathematics, SpringerVerlag, Berlin, 1992."},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures.IEEE Trans. Syst. Man, Cybern., SMC-11:109\u2013125, 1981.","journal-title":"IEEE Trans. Syst. Man, Cybern"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16:421\u2013444, 1987.","journal-title":"SIAM J. Computing"},{"key":"10_CR25","first-page":"894","volume-title":"Proceedings Graph Drawing \u201994. LNCS","year":"1995","unstructured":"R. Tamassia and I.G. Tollis (eds.). Proceedings Graph Drawing\u201994. LNCS, 894, 1995."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"W.T. Tutte . How to draw a graph.Proc. London Math. Soc., 13:743\u2013768, 1963","journal-title":"Proc. London Math. Soc"}],"container-title":["Informatik aktuell","Informatik \u201997 Informatik als Innovationsmotor"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-60831-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T12:09:38Z","timestamp":1620302978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-60831-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630661","9783642608315"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-60831-5_10","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[1997]]}}}