{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:36Z","timestamp":1781345676161,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540921813","type":"print"},{"value":"9783540921820","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_28","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"294-305","source":"Crossref","is-referenced-by-count":72,"title":["Graph Layout Problems Parameterized by Vertex Cover"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D. Adolphson","year":"1973","unstructured":"Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math.\u00a025, 403\u2013423 (1973)","journal-title":"SIAM J. Appl. Math."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"J. of Scheduling"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11604686_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Blin","year":"2005","unstructured":"Blin, G., Fertin, G., Hermelin, D., Vialette, S.: Fixed-parameter algorithms for protein similarity search under RNA structure constraints. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 271\u2013282. Springer, Heidelberg (2005)"},{"key":"28_CR4","first-page":"116","volume-title":"Proceedings of SIGIR 1993","author":"R.A. Botafogo","year":"1993","unstructured":"Botafogo, R.A.: Cluster analysis for hypertext systems. In: Proceedings of SIGIR 1993, pp. 116\u2013125. ACM Press, New York (1993)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P. Chinn","year":"1982","unstructured":"Chinn, P., Chvatalova, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices \u2013 a survey. Journal of Graph Theory\u00a06, 223\u2013254 (1982)","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K.L. Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las Vegas Algorithms for Linear and Integer Programming When the Dimension is Small. Journal of the Association for Computing Machinery\u00a042(2), 488\u2013499 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"28_CR7","first-page":"12","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs Inf. Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"I. Recognizable Sets of Finite Graphs Inf. Comput."},{"key":"28_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"28_CR9","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Losievskaja, E., Rosamond, F.A., Saurabh, S.: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees, CoRR abs\/0804.3028 (2008)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-73001-9_28","volume-title":"Computation and Logic in the Real World","author":"M.R. Fellows","year":"2007","unstructured":"Fellows, M.R., Rosamond, F.A.: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, pp. 268\u2013277. Springer, Heidelberg (2007)"},{"key":"28_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, E.: An Application of Simultaneous Diophantine Approximation in Combinatorial Optimization. Combinatorica\u00a07, 49\u201365 (1987)","journal-title":"Combinatorica"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica\u00a037(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00493-004-0015-x","volume":"24","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and l\n                    \n                      \n                    \n                    $_{\\mbox{1}}$\n                  -embeddings of graphs. Combinatorica\u00a024(2), 233\u2013269 (2004)","journal-title":"Combinatorica"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-69903-3_30","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"P. Heggernes","year":"2008","unstructured":"Heggernes, P., Meister, D., Proskurowski, A.: Minimum distortion embeddings into a path of bipartite permutation and threshold graphs. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 331\u2013342. Springer, Heidelberg (2008)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.jco.2005.04.004","volume":"21","author":"S. Heinz","year":"2005","unstructured":"Heinz, S.: Complexity of integer quasiconvex polynomial optimization. Journal of Complexity\u00a021, 543\u2013556 (2005)","journal-title":"Journal of Complexity"},{"key":"28_CR17","first-page":"225","volume-title":"Handbook on Operations Research and Management Sciences","author":"M. Junguer","year":"1995","unstructured":"Junguer, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. In: Handbook on Operations Research and Management Sciences, vol.\u00a07, pp. 225\u2013330. North-Holland, Amsterdam (1995)"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s Convex Body Theorem and Integer Programming. Mathematics of Operations Research\u00a012, 415\u2013440 (1987)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"1-2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G. Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci.\u00a0172(1-2), 175\u2013193 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR21","first-page":"11","volume-title":"Proceedings of STOC","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R.: A randomized fully polynomial approximation scheme for all terminal network reliability problem. In: Proceedings of STOC, pp. 11\u201317. ACM Press, New York (1996)"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/PL00009496","volume":"23","author":"L. Khachiyan","year":"2000","unstructured":"Khachiyan, L., Porkolab, L.: Integer Optimization on Convex Semialgebraic Sets. Discrte Computational Geometry\u00a023, 207\u2013224 (2000)","journal-title":"Discrte Computational Geometry"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"28_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The Geometry of Graphs and Some of its Algorithmic Applications. Combinatorica\u00a015(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/BFb0036931","volume-title":"Proceedings of ICALP 1983","author":"F. Makedon","year":"1983","unstructured":"Makedon, F., Sudborough, I.H.: Minimizing width in linear layouts. In: ICALP 1983. LNCS, vol.\u00a0154, pp. 478\u2013490. Springer, Heidelberg (1983)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","first-page":"497","volume-title":"Algorithms - ESA \u201995","author":"P. Mutzel","year":"1995","unstructured":"Mutzel, P.: A polyhedral approach to planar augmentation and related problems. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 497\u2013507. Springer, Heidelberg (1995)"},{"key":"28_CR27","series-title":"Oxford Lecture Series in Mathematics and its Applications","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 Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry\u00a09, 83\u2013110 (1998)","journal-title":"Computational Geometry"},{"issue":"1","key":"28_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jalgor.2004.12.003","volume":"56","author":"D.M. Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Cutwidth II: Algorithms for partial w-trees of bounded degree. J. Algorithms\u00a056(1), 25\u201349 (2005)","journal-title":"J. Algorithms"},{"issue":"1-3","key":"28_CR30","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(02)00044-0","volume":"299","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Theoret. Comput. Sci.\u00a0299(1-3), 151\u2013178 (2003)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T10:10:44Z","timestamp":1551694244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}