{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:08:09Z","timestamp":1725757689633},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_13","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T07:57:26Z","timestamp":1384847846000},"page":"137-149","source":"Crossref","is-referenced-by-count":3,"title":["Computing Tree-Depth Faster Than 2 n"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[]},{"given":"Archontia C.","family":"Giannopoulou","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected hamiltonicity. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 173\u2013182. IEEE (2010)","DOI":"10.1109\/FOCS.2010.24"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., M\u00fcller, H., Tuza, Z.: Rankings of graphs. SIAM J. Discrete Math.\u00a011(1), 168\u2013181 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","volume":"50","author":"H.L. Bodlaender","year":"2012","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: A note on exact algorithms for vertex ordering problems on graphs. Theory Comput. Syst.\u00a050(3), 420\u2013432 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms\u00a018(2), 238\u2013255 (1995)","journal-title":"J. Algorithms"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: On cutwidth parameterized by vertex cover. Algorithmica, 1\u201314 (2012)","DOI":"10.1007\/978-3-642-28050-4_20"},{"issue":"1-2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00179-1","volume":"98","author":"J.S. Deogun","year":"1999","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On the vertex ranking problem for trapezoid, circular-arc and other graphs. Discrete Applied Mathematics\u00a098(1-2), 39\u201363 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1137\/050643350","volume":"38","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I., Villanger, Y.: Exact algorithms for treewidth and minimum fill-in. SIAM J. Comput.\u00a038(3), 1058\u20131079 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00493-012-2536-z","volume":"32","author":"F.V. Fomin","year":"2012","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. Combinatorica\u00a032(3), 289\u2013308 (2012)","journal-title":"Combinatorica"},{"key":"13_CR9","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM\u00a010, 196\u2013210 (1962)","journal-title":"Journal of SIAM"},{"issue":"1-3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","volume":"142","author":"M. Katchalski","year":"1995","unstructured":"Katchalski, M., McCuaig, W., Seager, S.M.: Ordered colourings. Discrete Mathematics\u00a0142(1-3), 141\u2013154 (1995)","journal-title":"Discrete Mathematics"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-33293-7_18","volume-title":"Parameterized and Exact Computation","author":"K. Kitsunai","year":"2012","unstructured":"Kitsunai, K., Kobayashi, Y., Komuro, K., Tamaki, H., Tano, T.: Computing directed pathwidth in O(1.89\n                  n\n                ) time. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, pp. 182\u2013193. Springer, Heidelberg (2012)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(98)00162-8","volume":"68","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., M\u00fcller, H., Wong, C.K.: Vertex ranking of asteroidal triple-free graphs. Inf. Process. Lett.\u00a068(4), 201\u2013206 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J. Ne\u0161et\u0159il","year":"2006","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb.\u00a027(6), 1022\u20131041 (2006)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejc.2006.07.013","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb.\u00a029(3), 760\u2013776 (2008)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/j.ejc.2006.07.014","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb.\u00a029(3), 777\u2013791 (2008)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.ejc.2007.11.019","volume":"29","author":"J. Ne\u0161et\u0159il","year":"2008","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. Eur. J. Comb.\u00a029(4), 1012\u20131024 (2008)","journal-title":"Eur. J. Comb."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity - Graphs, Structures, and Algorithms. Algorithms and combinatorics, vol.\u00a028. Springer (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XIII. The Disjoint Paths Problem. J. Comb. Theory, Ser. B\u00a063(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. XX. Wagner\u2019s conjecture. J. Comb. Theory, Ser. B\u00a092(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A.A. Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.A.: Optimal Node Ranking of Trees in Linear Time. Inf. Process. Lett.\u00a033(2), 91\u201396 (1989)","journal-title":"Inf. Process. Lett."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-11269-0_27","volume-title":"Parameterized and Exact Computation","author":"K. Suchan","year":"2009","unstructured":"Suchan, K., Villanger, Y.: Computing pathwidth faster than 2\n                  n\n                . In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 324\u2013335. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T10:48:29Z","timestamp":1558694909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}