{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:28Z","timestamp":1725896428560},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_5","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"20-23","source":"Crossref","is-referenced-by-count":0,"title":["Intractability in Graph Drawing and Geometry: FPT Approaches"],"prefix":"10.1007","author":[{"given":"Sue","family":"Whitesides","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms\u00a052(2), 134\u2013151 (2004)","journal-title":"J. Algorithms"},{"key":"5_CR2","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.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Everett, H., Fekete, S., Houle, M.E., Lubiw, A., Meijer, H., Romanik, K., Rote, G., Shermer, T., Whitesides, S., Zelle, C.: A visibility representation for graphs in three dimensions. J. Graph Algorithms Appl.\u00a02(2) (1998)","DOI":"10.7155\/jgaa.00006"},{"key":"5_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"V. Dujmovi\u0107","year":"2008","unstructured":"Dujmovi\u0107, V., Fellows, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica\u00a052(2), 167\u2013176 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00453-005-1181-y","volume":"45","author":"V. Dujmovi\u0107","year":"2006","unstructured":"Dujmovi\u0107, V., Fellows, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: A fixed parameter approach to 2-layer planarization. Algorithmica\u00a045(2), 159\u2013182 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00453-004-1093-2","volume":"40","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica\u00a040(1), 15\u201331 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoret. Comput. Sci.\u00a0131(2), 361\u2013374 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR9","unstructured":"Fernau, H.: Parameterized Algorithmics: a Graph Theoretic Approach. Habilitationsschrift, U. T\u00fcbingen (2005)"},{"key":"5_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1093\/comjnl\/bxm053","volume":"51","author":"P. Giannopoulos","year":"2008","unstructured":"Giannopoulos, P., Knauer, C., Whitesides, S.: Parameterized complexity of geometric problems. Comput. J.\u00a051(3), 372\u2013384 (2008)","journal-title":"Comput. J."},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.7155\/jgaa.00103","volume":"9","author":"M. Suderman","year":"2005","unstructured":"Suderman, M., Whitesides, S.: Experiments with the fixed-parameter approach for two-layer planarization. J. Graph Algorithms Appl.\u00a09(1), 149\u2013163 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-00219-9_7","volume-title":"Graph Drawing","author":"J. \u0160tola","year":"2009","unstructured":"\u0160tola, J.: Unimaximal sequences of pairs in rectangle visibility drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 61\u201366. Springer, Heidelberg (2009)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-540-24595-7_21","volume-title":"Graph Drawing","author":"J. \u0160tola","year":"2004","unstructured":"\u0160tola, J.: 3D visibility representations of complete graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 226\u2013237. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:36Z","timestamp":1619782476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}