{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T03:55:02Z","timestamp":1785383702122,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030604394","type":"print"},{"value":"9783030604400","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_3","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1848-0076","authenticated-orcid":false,"given":"Jesper","family":"Nederlof","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7891-1988","authenticated-orcid":false,"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9654-8094","authenticated-orcid":false,"given":"C\u00e9line M. F.","family":"Swennenhuis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9746-5733","authenticated-orcid":false,"given":"Karol","family":"W\u0119grzycki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-030-19955-5_4","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Belbasi","year":"2019","unstructured":"Belbasi, M., F\u00fcrer, M.: A space-efficient parameterized algorithm for the hamiltonian cycle problem by dynamic algebraization. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 38\u201349. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_4"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2019.02.030","volume":"782","author":"B Bergougnoux","year":"2019","unstructured":"Bergougnoux, B., Kant\u00e9, M.M.: Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. 782, 30\u201353 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","unstructured":"Bergougnoux, B., Kant\u00e9, M.M.: More applications of the $$d$$-neighbor equivalence: connectivity and acyclicity constraints. In: 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, vol. 144 , pp. 17:1\u201317:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ic.2014.12.008","volume":"243","author":"HL Bodlaender","year":"2015","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86\u2013111 (2015)","journal-title":"Inf. Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3148227","volume":"65","author":"M Cygan","year":"2018","unstructured":"Cygan, M., Kratsch, S., Nederlof, J.: Fast Hamiltonicity checking via bases of perfect matchings. J. ACM 65(3), 12:1\u201312:46 (2018)","journal-title":"J. ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 150\u2013159. IEEE (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"3_CR8","unstructured":"Czerwi\u0144ski, W., Nadara, W., Pilipczuk, M.: Improved bounds for the excluded-minor approximation of treedepth. In: 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, vol. 144, pp. 34:1\u201334:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"DeVos, M., Kwon, O., Oum, S.: Branch-depth: Generalizing tree-depth of graphs. arXiv preprint, abs\/1903.11988 (2019)","DOI":"10.1016\/j.ejc.2020.103186"},{"key":"3_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"3_CR11","unstructured":"Drucker, A., Nederlof, J., Santhanam, R.: Exponential time paradigms through the polynomial time lens. In: 24th Annual European Symposium on Algorithms, ESA 2016. LIPIcs, vol. 57, pp. 36:1\u201336:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"3_CR12","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/2886094","volume":"63","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1\u201329:60 (2016)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00224-017-9751-3","volume":"61","author":"M F\u00fcrer","year":"2017","unstructured":"F\u00fcrer, M., Yu, H.: Space saving by dynamic algebraization based on tree-depth. Theor. Comput. Syst. 61(2), 283\u2013304 (2017)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"3_CR15","first-page":"71","volume":"15","author":"R Ganian","year":"2019","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Ne\u0161et\u0159il, J., Obdr\u017e\u00e1lek, J., de Mendez, P.O.: Shrub-depth: capturing height of dense graphs. Log. Meth. Comput. Sci. 15(1), 71\u2013725 (2019)","journal-title":"Log. Meth. Comput. Sci."},{"key":"3_CR16","unstructured":"Hegerfeld, F., Kratsch, S.: Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space. arXiv preprint, abs\/2001.05364 (2020). Accepted to STACS 2020"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-25870-1_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Mnich, M., Saurabh, S.: Planar k-path in subexponential time and polynomial space. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 262\u2013270. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_24"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 321\u2013330. ACM (2010)","DOI":"10.1145\/1806689.1806735"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"key":"3_CR20","unstructured":"Nederlof, J.: Inclusion exclusion for hard problems. Master\u2019s thesis, Utrecht University (2008)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Nederlof, J., Pilipczuk, M., Swennenhuis, C.M.F., Wegrzycki, K.: Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space. CoRR, abs\/2002.04368 (2020)","DOI":"10.1007\/978-3-030-60440-0_3"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Siebertz, S.: Polynomial bounds for centered colorings on proper minor-closed graph classes. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 1501\u20131520. SIAM (2019)","DOI":"10.1137\/1.9781611975482.91"},{"issue":"4","key":"3_CR23","first-page":"181","volume":"9","author":"M Pilipczuk","year":"2018","unstructured":"Pilipczuk, M., Wrochna, M.: On space efficiency of algorithms working on structural decompositions of graphs. ACM Trans. Comp. Theor. 9(4), 181\u20131836 (2018)","journal-title":"ACM Trans. Comp. Theor."},{"key":"3_CR24","unstructured":"Pino, W.J.A., Bodlaender, H.L., van Rooij, J.M.M.: Cut and Count and representative sets on branch decompositions. In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. LIPIcs, vol. 63, pp. 27:1\u201327:12. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/978-3-662-43948-7_77","volume-title":"Automata, Languages, and Programming","author":"F Reidl","year":"2014","unstructured":"Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 931\u2013942. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_77"},{"issue":"1","key":"3_CR26","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. Theor. Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00453-018-0489-3","volume":"81","author":"M W\u0142odarczyk","year":"2019","unstructured":"W\u0142odarczyk, M.: Clifford algebras meet tree decompositions. Algorithmica 81(2), 497\u2013518 (2019)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:42Z","timestamp":1710266442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}