{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:35:34Z","timestamp":1769585734857,"version":"3.49.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319501055","type":"print"},{"value":"9783319501062","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_17","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"209-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Compact Layered Drawings of General Directed Graphs"],"prefix":"10.1007","author":[{"given":"Adalat","family":"Jabrayilov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Mallach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"R\u00fcegg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"von Hanxleden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Informatica 1(3), 200\u2013213 (1972)","journal-title":"Acta Informatica"},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades, P., Lin, X., Smyth, W.F.: A fast and effective heuristic for the feedback arc set problem. Inf. Process. Lett. 47(6), 319\u2013323 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"17_CR3","first-page":"424","volume":"13","author":"P Eades","year":"1990","unstructured":"Eades, P., Sugiyama, K.: How to draw a directed graph. J. Inf. Process. 13(4), 424\u2013437 (1990)","journal-title":"J. Inf. Process."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. Softw. Eng. 19(3), 214\u2013230 (1993)","journal-title":"Softw. Eng."},{"key":"17_CR5","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. 2528, pp. 98\u2013109. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-36151-0_10"},{"key":"17_CR6","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":"P Healy","year":"2002","unstructured":"Healy, P., Nikolov, N.S.: How to layer a directed acyclic graph. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 16\u201330. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-45848-4_2"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Jabrayilov, A., Mallach, S., Mutzel, P., R\u00fcegg, U., von Hanxleden, R.: Compact layered drawings of general directed graphs. \n                      arXiv:1609.01755\n                      \n                     [cs.DS] (2016)","DOI":"10.1007\/978-3-319-50106-2_17"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-77537-9_38","volume-title":"Graph Drawing","author":"L Nachmanson","year":"2008","unstructured":"Nachmanson, L., Robertson, G., Lee, B.: Drawing graphs with GLEE. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 389\u2013394. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-77537-9_38"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1064546.1180618","volume":"10","author":"NS Nikolov","year":"2005","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 10, 1\u201327 (2005). Article No. 2.7","journal-title":"J. Exp. Algorithmics"},{"key":"17_CR10","first-page":"196","volume-title":"Lecture Notes in Computer Science","author":"Ulf R\u00fcegg","year":"2016","unstructured":"R\u00fcegg, U., Ehlers, T., Sp\u00f6nemann, M., von Hanxleden, R.: A generalization of the directed graph layering problem. In: Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016) (2016)"},{"issue":"2","key":"17_CR11","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 Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1112\/jlms\/s1-42.1.330","volume":"42","author":"HS Wilf","year":"1967","unstructured":"Wilf, H.S.: The eigenvalues of a graph and its chromatic number. J. Lond. Math. Soc. 42, 330\u2013332 (1967)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:41:13Z","timestamp":1600476073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}