{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:09Z","timestamp":1725815949089},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_20","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"205-216","source":"Crossref","is-referenced-by-count":1,"title":["Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter"],"prefix":"10.1007","author":[{"given":"Sigve Hortemo","family":"S\u00e6ther","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-39206-1_17","volume-title":"Automata, Languages, and Programming","author":"H.L. Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 196\u2013207. Springer, Heidelberg (2013)"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM Journal on Algebraic Discrete Methods\u00a03(2), 214\u2013228 (1982)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Rooij, J.M.M.v., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings FOCS, pp. 150\u2013159. IEEE (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"20_CR4","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory, vol.\u00a03. Springer (2006)"},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM Journal on Computing\u00a039(5), 1941\u20131956 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Efficient computation of representative sets with applications in parameterized and exact algorithms. In: Proceedings SODA, pp. 142\u2013151 (2014)","DOI":"10.1137\/1.9781611973402.10"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J. Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol.\u00a08246, pp. 163\u2013176. Springer, Heidelberg (2013)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. In: Proceedings SODA, pp. 777\u2013789. SIAM (2011)","DOI":"10.1137\/1.9781611973082.61"},{"key":"20_CR9","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S., et al.: Lower bounds based on the exponential time hypothesis. Bulletin of EATCS 3(105) (2013)"},{"key":"20_CR10","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"R.G. Michael","year":"1979","unstructured":"Michael, R.G., David, S.J.: Computers and intractability: a guide to the theory of np-completeness. WH Freeman & Co., San Francisco (1979)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2014.03.024","volume":"535","author":"S. Oum","year":"2014","unstructured":"Oum, S., S\u00e6ther, S.H., Vatshelle, M.: Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science\u00a0535, 16\u201324 (2014)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"20_CR13","unstructured":"S\u00e6ther, S.H.: Solving hamiltonian cycle by an EPT algorithm for a non-sparse parameter, http:\/\/www.arxiv.org"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"S\u00e6ther, S.H., Telle, J.A.: Between treewidth and clique-width. To appear in Proceedings of WG 2014 (2014) Invited to contribute to special section of Algorithmica","DOI":"10.1007\/978-3-319-12340-0_33"},{"key":"20_CR15","unstructured":"Vatshelle, M.: New width parameters of graphs. PhD thesis, The University of Bergen (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T19:28:11Z","timestamp":1651087691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}