{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:34:43Z","timestamp":1743089683860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"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_38","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"499-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Track Layout Is Hard"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Bannister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William E.","family":"Devanny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34, 553\u2013579 (2005)","journal-title":"SIAM J. Comput."},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach, J., ed.: Towards a Theory of Geometric Graphs, vol. 342, pp. 55\u201366. Contemporary Mathematics - American Mathematical Society (2004)","DOI":"10.1090\/conm\/342\/06130"},{"key":"38_CR3","first-page":"497","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discrete Math. Theor. Comput. Sci. 6, 497\u2013521 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21, 927\u2013958 (1992)","journal-title":"SIAM J. Comput."},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-45803-7_18","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 210\u2013221. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45803-7_18"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-03841-4_30","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2013","unstructured":"Bannister, M.J., Eppstein, D., Simons, J.A.: Fixed parameter tractability of crossing minimization of almost-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 340\u2013351. Springer, Heidelberg (2013). doi: 10.1007\/978-3-319-03841-4_30"},{"key":"38_CR7","first-page":"203","volume":"1","author":"F Harary","year":"1972","unstructured":"Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Math. 1, 203\u2013209 (1972)","journal-title":"Utilitas Math."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin, R.: $$S$$-functions for graphs. J. Geom. 8, 171\u2013186 (1976)","journal-title":"J. Geom."},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layered separators for queue layouts, 3D graph drawing and nonrepetitive coloring. In: Proceedings of 54th Symposium on Foundations of Computer Science (FOCS 2013), pp. 280\u2013289. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.38"},{"key":"38_CR11","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layered separators in minor-closed graph classes with applications. Electronic preprint arXiv:1306.1595 (2013)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC\u201311","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. SMC\u201311, 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"38_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":"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: 10.1007\/3-540-45848-4_2"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7, 363\u2013398 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"38_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.46298\/dmtcs.346","volume":"7","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7, 155\u2013201 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"38_CR17","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-40104-6_9","volume-title":"Algorithms and Data Structures","author":"MJ Bannister","year":"2013","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 97\u2013108. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40104-6_9"},{"key":"38_CR19","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity (Graphs, Structures, and Algorithms)","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity (Graphs, Structures, and Algorithms). Algorithms and Combinatorics, vol. 28. Springer, Heidelberg (2012)"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-662-45803-7_23","volume-title":"Graph Drawing","author":"Z Abel","year":"2014","unstructured":"Abel, Z., Demaine, E.D., Demaine, M.L., Eppstein, D., Lubiw, A., Uehara, R.: Flat foldings of plane graphs with prescribed angles and edge lengths. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 272\u2013283. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45803-7_23"},{"key":"38_CR21","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1137\/090760301","volume":"24","author":"HJ Bandelt","year":"2010","unstructured":"Bandelt, H.J., Chepoi, V., Eppstein, D.: Combinatorics and geometry of finite and infinite squaregraphs. SIAM J. Discrete Math. 24, 1399\u20131440 (2010)","journal-title":"SIAM J. Discrete Math."}],"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_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T14:34:20Z","timestamp":1657982060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}