{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:15Z","timestamp":1725664815173},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:38:48Z","timestamp":1330277928000},"page":"318-333","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An alternative method to crossing minimization on hierarchical graphs"],"prefix":"10.1007","author":[{"given":"Petra","family":"Mutzel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/21.23105","volume":"18","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and E. Nardelli: Hierarchies and Planarity Theory. IEEE Transactions on Systems, Man and Cybernetics 18 (1988) 1035\u20131046","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"no.11","key":"25_CR2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","volume":"SMC-10","author":"M.J. Carpano","year":"1980","unstructured":"Carpano, M.J.: Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Transactions on Systems, Man and Cybernetics, SMC-10, no. 11 (1980) 705\u2013715","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"25_CR3","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids and certain polyhedra. in: Combinatorial Structures and Their Applications, Gordon and Breach, London (1970) 69\u201387"},{"key":"25_CR4","first-page":"121","volume-title":"Operations Research Proceedings 1994","author":"S. Dresbach","year":"1994","unstructured":"Dresbach, S.: A New Heuristic Layout Algorithm for DAGs. in: Derigs, Bachem & Drexl (eds.), Operations Research Proceedings 1994, Springer Verlag, Berlin (1994) 121\u2013126"},{"key":"25_CR5","first-page":"89","volume":"21-A","author":"P. Eades","year":"1986","unstructured":"Eades, P., and D. Kelly: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combinatoria 21-A (1986) 89\u201398","journal-title":"Ars Combinatoria"},{"key":"25_CR6","unstructured":"Eades, P., B.D. McKay, and N.C. Wormald: On an edge crossing problem. Proc. 9th Australian Computer Science Conference, Australian National University (1986) 327\u2013334"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"10","author":"P. Eades","year":"1994","unstructured":"Eades, P., and N.C. Wormald: Edge crossings in Drawings of Bipartite Graphs. Algorithmica 10 (1994) 379\u2013403","journal-title":"Algorithmica"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"Eades, P. and S. Whitesides: Drawing graphs in two layers. Theoretical Computer Science 131 (1994) 361\u2013374","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","unstructured":"Fukuda, A.: Face Lattices. Personal Communication (1996)"},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., L. Lov\u00e1sz, and A. Schrijver: The Ellipsoid Method and its Consequences in Combinatorial Optimization. Combinatorica 1 (1981) 169\u2013197","journal-title":"Combinatorica"},{"key":"25_CR11","unstructured":"Gr\u00f6tschel, M. and M.W. Padberg: Polyhedral theory. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley-Interscience (1985)"},{"key":"25_CR12","unstructured":"Heath, L.S. and S.V. Pemmaraju: Recognizing Leveled-Planar Dags in Linear Time. Lecture Notes in Comp. Sci. 1027, in: F. Brandenburg (ed.), Proceedings on Graph Drawing '95, Passau (1996) 300\u2013311"},{"key":"25_CR13","unstructured":"J\u00fcnger, M. und P. Mutzel: Solving the maximum planar subgraph problem by branch and cut. In: L.A. Wolsey and G. Rinaldi (eds.), Proceedings of the 3rd IPCO Conference, Erice (1993) 479\u2013492"},{"key":"25_CR14","unstructured":"J\u00fcnger, M. und P. Mutzel: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16, No. 1, Special Issue on Graph Drawing, G. Di Battista and R. Tamassia (eds.), (1996) 33\u201359, also Report No. 93.145, Universit\u00e4t zu K\u00f6ln, (1993)"},{"key":"25_CR15","unstructured":"J\u00fcnger, M. und P. Mutzel: Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Lecture Notes in Comp. Sci. 1027, in: F. Brandenburg (ed.), Proc. on Graph Drawing '95, Passau (1996) 337\u2013348"},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1090\/dimacs\/020\/02","volume":"20","author":"M. J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., G. Reinelt, and S. Thienel: Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20 (1995) 111\u2013152","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"25_CR17","unstructured":"Karp, R.M. and C.H. Papadimitriou: On Linear Characterizations of Combinatorial Optimization Problems. Proc. of the 21st Annual Symp. on the Foundations of Computer Science IEEE (1980) 1\u20139"},{"key":"25_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, Chichester, UK (1990)"},{"key":"25_CR19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/00207169008803941","volume":"37","author":"E. M\u00e4kinen","year":"1990","unstructured":"M\u00e4kinen, E.: Experiments on Drawing 2-Level Hierarchical Graphs. Intern. J. Computer Math. 37 (1990) 129\u2013135","journal-title":"Intern. J. Computer Math."},{"key":"25_CR20","unstructured":"Mutzel, P.: The Maximum Planar Subgraph Problem. Dissertation, Universit\u00e4t zu K\u00f6ln (1994)"},{"key":"25_CR21","unstructured":"Padberg, M.W. and M.R. Rao: The Russian Method for Linear Inequalities III: Bounded Integer Programming. GBA Working Paper 81\u201339, New York University (1981)"},{"key":"25_CR22","first-page":"511","volume":"17","author":"M.W. Padberg","year":"1983","unstructured":"Padberg, M.W. and L.A. Wolsey: Trees and Cuts. Annals of Discrete Mathematics 17 (1983) 511\u2013517","journal-title":"Annals of Discrete Mathematics"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., S. Tagawa, and M. Toda: Methods for Visual Understanding of Hierarchical System Structures. IEEE Trans. Syst. Man, Cybern., SMC-11 (1981) 109\u2013125","journal-title":"IEEE Trans. Syst. Man, Cybern."},{"key":"25_CR24","first-page":"1","volume":"EC77-38","author":"N. Tomii","year":"1977","unstructured":"Tomii, N., Y. Kambayashi, and Y. Shuzo: On Planalization Algorithms of 2-Level Graphs. Papers of tech. group on electronic computers, IECEJ, EC77-38 (1977) 1\u201312","journal-title":"Papers of tech. group on electronic computers, IECEJ"},{"key":"25_CR25","volume-title":"Computational Aspects of VLSI","author":"J.D. Ullman","year":"1984","unstructured":"Ullman, J.D.: Computational Aspects of VLSI. Computer Science Press, Rockville, MD (1984)"},{"key":"25_CR26","unstructured":"Vingron, M., H.-P. Lenhof, and P. Mutzel: Computational Molecular Biology. In: Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, S. Martello (eds.), Chapter 23, to appear (1996)"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0377-2217(95)00356-8","volume":"90","author":"V. Valls","year":"1996","unstructured":"Valls, V., R. Marti, and P. Lino: A Branch and Bound Algorithm for Minimizing the Number of Crossing Arcs in Bipartite Graphs. Journal of Operational Research 90 (1996) 303\u2013319","journal-title":"Journal of Operational Research"},{"key":"25_CR28","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","volume":"SMC-7","author":"J.N. Warfield","year":"1977","unstructured":"Warfield, J.N.: Crossing Theory and Hierarchy Mapping. IEEE Trans. Syst. Man, Cybern., SMC-7 (1977) 505\u2013523","journal-title":"IEEE Trans. Syst. Man, Cybern."},{"issue":"no.2","key":"25_CR29","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0092-8240(86)80006-4","volume":"48","author":"M.S. Waterman","year":"1986","unstructured":"Waterman, M.S. and J. R. Griggs: Interval graphs and maps of DNA. Bull. Math. Biology 48, no. 2 (1986) 189\u2013195","journal-title":"Bull. Math. Biology"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T03:20:06Z","timestamp":1593746406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_57"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}