{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:31:03Z","timestamp":1742401863694},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_22","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"229-240","source":"Crossref","is-referenced-by-count":14,"title":["A Fast Layout Algorithm for k-Level Graphs"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Leipert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg, M. J\u00fcnger, and P. Mutzel. Algorithmen zum automatischen Zeichnen von Graphen. Informatik-Spektrum 20, pages 199\u2013207, 1997.","DOI":"10.1007\/s002870050066"},{"key":"22_CR2","unstructured":"C. Buchheim, M. J\u00fcnger, and S. Leipert. A fast layout algorithm for k-level graphs. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1999."},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. R. Gansner","year":"1993","unstructured":"E. R. Gansner, E. Koutsofios, S. C. North, and K.-P. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214\u2013230, 1993.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312\u2013316, 1983.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"M. J\u00fcnger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications, 1:1\u201325, 1997.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-37623-2_44","volume-title":"Graph Drawing\u2019 98","author":"P. Mutzel","year":"1998","unstructured":"Petra Mutzel et al. A library of algorithms for graph drawing. In S. H. Whitesides, editor, Graph Drawing\u2019 98, volume 1547 of Lecture Notes in Computer Science, pages 456\u2013457. Springer Verlag, 1998."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BFb0021828","volume-title":"Graph Drawing\u2019 95","author":"G. Sander","year":"1996","unstructured":"G. Sander. A fast heuristic for hierarchical Manhattan layout. In F. J. Brandenburg, editor, Graph Drawing\u2019 95, volume 1027 of Lecture Notes in Computer Science, pages 447\u2013458. Springer Verlag, 1996."},{"issue":"2","key":"22_CR8","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 systems. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109\u2013125, 1981.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T18:07:49Z","timestamp":1550426869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}