{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:06Z","timestamp":1725502026408},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_38","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"389-394","source":"Crossref","is-referenced-by-count":7,"title":["Drawing Graphs with GLEE"],"prefix":"10.1007","author":[{"given":"Lev","family":"Nachmanson","sequence":"first","affiliation":[]},{"given":"George","family":"Robertson","sequence":"additional","affiliation":[]},{"given":"Bongshin","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Drawing graphs with GLEE technical report, Lev Nachmanson, George Robertson and Bongshin Lee, ftp:\/\/ftp.research.microsoft.com\/pub\/tr\/TR-2007-72.pdf"},{"key":"38_CR2","unstructured":"Graphviz todo list (December 22, 2005), http:\/\/www.graphviz.org\/doc\/todo.html"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0054318","volume-title":"LATIN\u201998: Theoretical Informatics","author":"J. Abello","year":"1998","unstructured":"Abello, J., Gansner, E.R.: Short and smooth polygonal paths. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 151\u2013162. Springer, Heidelberg (1998)"},{"key":"38_CR4","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":"38_CR5","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)"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E.G. Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal Scheduling for Two-Processor Systems. Acta Informatica\u00a01(3), 200\u2013213 (1972)","journal-title":"Acta Informatica"},{"key":"38_CR7","first-page":"262","volume-title":"Graph Drawing","author":"D.P. Dobkin","year":"1998","unstructured":"Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.: Implementing a general-purpose edge router. In: Di Battista, G. (ed.) Graph Drawing, Rome, Italy, September 18-20, 1997, pp. 262\u2013271. Springer, Heidelberg (1998)"},{"key":"38_CR8","first-page":"155","volume-title":"Graph Drawing","author":"M. Eiglsperger","year":"2004","unstructured":"Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An efficient implementation of sugiyama\u2019s algorithm for layered graph drawing. In: Pach, J. (ed.) Graph Drawing, New York, pp. 155\u2013166. Springer, Heidelberg (2004)"},{"issue":"3","key":"38_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E.R. Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.: A Technique for Drawing Directed Graphs. IEEE Transactions on Software Engineering\u00a019(3), 214\u2013230 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2002","unstructured":"Goodrich, M.T., Kobourov, S.G. (eds.): GD 2002. LNCS, vol.\u00a02528. Springer, Heidelberg (2002)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-36151-0_10","volume-title":"Graph Drawing","author":"P. Healy","year":"2002","unstructured":"Healy, P., Nikolov, N.S.: A branch-and-cut approach to the directed acyclic graph layering problem. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 98\u2013109. Springer, Heidelberg (2002)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Lutterkort, D., Peters, J.: Smooth paths in a polygonal channel. In: Symposium on Computational Geometry, pp. 316\u2013321 (1999)","DOI":"10.1145\/304893.304985"},{"issue":"2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cad.2004.04.004","volume":"37","author":"A. Myles","year":"2005","unstructured":"Myles, A., Peters, J.: Threading splines through 3d channels. Computer-Aided Design\u00a037(2), 139\u2013148 (2005)","journal-title":"Computer-Aided Design"},{"issue":"5","key":"38_CR14","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.dam.2005.05.023","volume":"154","author":"N.S. Nikolov","year":"2006","unstructured":"Nikolov, N.S., Tarassov, A.: Graph layering by promotion of nodes. Discrete Applied Mathematics\u00a0154(5), 848\u2013860 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Nikolov, N.S., Tarassov, A., Branke, J.: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. J. Exp. Algorithmics\u00a010(2.7) (2005)","DOI":"10.1145\/1064546.1180618"},{"issue":"2","key":"38_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-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\u00a0SMC-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":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:56Z","timestamp":1619507756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_38","relation":{},"subject":[]}}