{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:02:14Z","timestamp":1742403734524},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_17","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"155-166","source":"Crossref","is-referenced-by-count":18,"title":["An Efficient Implementation of Sugiyama\u2019s Algorithm for Layered Graph Drawing"],"prefix":"10.1007","author":[{"given":"Markus","family":"Eiglsperger","sequence":"first","affiliation":[]},{"given":"Martin","family":"Siebenhaller","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","first-page":"105","volume-title":"Graph Drawing Software","author":"D. Auber","year":"2003","unstructured":"Auber, D.: Tulip \u2013 A Huge Graph Visualization Framework. In: J\u00fcnger, M. (ed.) Graph Drawing Software, pp. 105\u2013126. Springer, Heidelberg (2003)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-36151-0_13","volume-title":"Graph Drawing","author":"W. Barth","year":"2002","unstructured":"Barth, W., J\u00fcnger, M., Mutzel, P.: Simple and Efficient Bilayer Cross Counting. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 130\u2013141. Springer, Heidelberg (2002)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bastert, O., Matuszewski, C.: Layered drawings of digraphs. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, pp. 104\u2013139. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44969-8_5"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45848-4_3","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., K\u00f6pf, B.: Fast and Simple Horizontal Coordinate Assignment. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 31\u201344. Springer, Heidelberg (2002)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. Coffman","year":"1972","unstructured":"Coffman, E., Graham, R.: Optimal scheduling for two processor systems. Acta Informatica\u00a01, 200\u2013213 (1972)","journal-title":"Acta Informatica"},{"key":"17_CR6","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)"},{"key":"17_CR7","first-page":"89","volume":"21.A","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combin.\u00a021.A, 89\u201398 (1986)","journal-title":"Ars Combin."},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N.: Edge crossings in drawings of bipartite graphs. Algorithmica\u00a011(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-62495-3_46","volume-title":"Graph Drawing","author":"A. Frick","year":"1997","unstructured":"Frick, A.: Upper bounds on the number of hidden nodes in Sugiyama\u2019s algorithm. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 169\u2013183. Springer, Heidelberg (1997)"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. Gansner","year":"1993","unstructured":"Gansner, E., Koutsofios, E., North, S., Vo, K.: A technique for drawing directed graphs. IEEE Transactions on Software Engineering\u00a019(3), 214\u2013229 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"17_CR11","unstructured":"Graphviz \u2013 open source graph drawing software, \n                    \n                      http:\/\/www.research.att.com\/sw\/tools\/graphviz\/"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Graph Drawing","author":"C. Matuszewski","year":"1999","unstructured":"Matuszewski, C., Sch\u00f6nfeld, R., Molitor, P.: Using sifting of k-layer straightline crossing minimization. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 217\u2013224. Springer, Heidelberg (1999)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45848-4_2","volume-title":"Graph Drawing","author":"N. Nikolov","year":"2002","unstructured":"Nikolov, N., Healy, P.: How to layer a directed acyclic graph. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 16\u201330. Springer, Heidelberg (2002)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-58950-3_371","volume-title":"Graph Drawing","author":"G. Sander","year":"1995","unstructured":"Sander, G.: Graph layout through the VCG tool. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 194\u2013205. Springer, Heidelberg (1995)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"3","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.E.: Self-Adjusting Binary Search Trees. Journal of the ACM\u00a03, 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, SMC\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, SMC"},{"key":"17_CR18","unstructured":"VCG \u2013 Visualization of Compiler Graphs, \n                    \n                      http:\/\/rw4.cs.uni-sb.de\/users\/sander\/html\/gsvcg1.html"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-46648-7_6","volume-title":"Graph Drawing","author":"V. Waddle","year":"1999","unstructured":"Waddle, V., Malhotra, A.: An ElogE line crossing algorithm for levelled graphs. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 59\u201370. Springer, Heidelberg (1999)"},{"key":"17_CR20","unstructured":"yFiles \u2013 a Java Graph Layout and Visualization Library, \n                    \n                      http:\/\/www.yworks.com"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:41:58Z","timestamp":1620013318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}