{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:12Z","timestamp":1725558792260},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_23","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"199-208","source":"Crossref","is-referenced-by-count":1,"title":["Imbalance Is Fixed Parameter Tractable"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: UAI, pp. 7\u201315 (2001)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.12.001","volume":"148","author":"T.C. Biedl","year":"2005","unstructured":"Biedl, T.C., Chan, T.M., Ganjali, Y., Hajiaghayi, M.T., Wood, D.R.: Balanced vertex-orderings of graphs. Discrete Applied Mathematics\u00a0148(1), 27\u201348 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"23_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci.\u00a075(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms\u00a021(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"key":"23_CR6","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","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. Monographs in Computer Science. Springer, New York (1999)"},{"key":"23_CR7","series-title":"An EATCS Series","volume-title":"Texts in Theoretical Computer Science","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. In: Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin (2006)"},{"issue":"10","key":"23_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.ipl.2009.01.003","volume":"109","author":"S. Gaspers","year":"2009","unstructured":"Gaspers, S., Messinger, M.-E., Nowakowski, R.J., Pralat, P.: Clean the graph before you draw it? Inf. Process. Lett.\u00a0109(10), 463\u2013467 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"23_CR9","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":"23_CR10","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. Theor. Comput. Sci.\u00a0172(1-2), 175\u2013193 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/11533719_86","volume-title":"Computing and Combinatorics","author":"J. K\u00e1ra","year":"2005","unstructured":"K\u00e1ra, J., Kratochv\u00edl, J., Wood, D.R.: On the complexity of the balanced vertex ordering problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 849\u2013858. Springer, Heidelberg (2005)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"K\u00e1ra, J., Kratochv\u00edl, J., Wood, D.R.: On the complexity of the balanced vertex ordering problem. Discrete Mathematics & Theoretical Computer Science\u00a09(1) (2007)","DOI":"10.46298\/dmtcs.383"},{"issue":"6","key":"23_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Inf. Process. Lett.\u00a042(6), 345\u2013350 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L.M. Kirousis","year":"1985","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Interval graphs and searching. Discrete Mathematics\u00a055(2), 181\u2013184 (1985)","journal-title":"Discrete Mathematics"},{"key":"23_CR15","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","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)"},{"issue":"1-2","key":"23_CR16","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. Comput. Geom.\u00a09(1-2), 83\u2013110 (1998)","journal-title":"Comput. Geom."},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.12.001","volume":"56","author":"D.M. Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Cutwidth i: A linear time fixed parameter algorithm. J. Algorithms\u00a056(1), 1\u201324 (2005)","journal-title":"J. Algorithms"},{"issue":"1","key":"23_CR18","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":"299","key":"23_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(02)00044-0","volume":"1-3","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Theor. Comput. Sci.\u00a01-3(299), 151\u2013178 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-004-1091-4","volume":"39","author":"D.R. Wood","year":"2004","unstructured":"Wood, D.R.: Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout. Algorithmica\u00a039(3), 235\u2013253 (2004)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:43:53Z","timestamp":1635579833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}