{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:44:51Z","timestamp":1775947491933,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:00:00Z","timestamp":1773273600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115895","type":"journal-article","created":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:48:55Z","timestamp":1773391735000},"page":"115895","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard"],"prefix":"10.1016","volume":"1073","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6270-3663","authenticated-orcid":false,"given":"Benjamin","family":"Bergougnoux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4856-5863","authenticated-orcid":false,"given":"Lars","family":"Jaffke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115895_bib0001","series-title":"New Width Parameters of Graphs","author":"Vatshelle","year":"2012"},{"key":"10.1016\/j.tcs.2026.115895_bib0002","series-title":"Proceedings of the 17th International Symposium on Parameterized and Exact Computation, IPEC 2022","first-page":"3:1","article-title":"On the hardness of generalized domination problems parameterized by mim-width","volume":"249","author":"Bakkane","year":"2022"},{"key":"10.1016\/j.tcs.2026.115895_bib0003","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2013.01.011","article-title":"Graph classes with structured neighborhoods and algorithmic applications","volume":"511","author":"Belmonte","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115895_bib0004","series-title":"Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025","first-page":"25:1","article-title":"Mim-width is paraNP-complete","volume":"334","author":"Bergougnoux","year":"2025"},{"key":"10.1016\/j.tcs.2026.115895_bib0005","series-title":"Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)","first-page":"3282","article-title":"A logic-based algorithmic meta-theorem for mim-width","author":"Bergougnoux","year":"2023"},{"key":"10.1016\/j.tcs.2026.115895_bib0006","series-title":"ESA 2025","article-title":"On algorithmic applications of F-branchwidth","author":"Bergougnoux","year":"2025"},{"issue":"3","key":"10.1016\/j.tcs.2026.115895_bib0007","doi-asserted-by":"crossref","first-page":"1881","DOI":"10.1137\/20M1350571","article-title":"More applications of the d-neighbor equivalence: acyclicity and connectivity constraints","volume":"35","author":"Bergougnoux","year":"2021","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"10.1016\/j.tcs.2026.115895_bib0008","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1007\/s00453-022-00936-w","article-title":"Node multiway cut and subset feedback vertex set on graphs of bounded mim-width","volume":"84","author":"Bergougnoux","year":"2022","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.tcs.2026.115895_bib0009","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s00453-024-01274-9","article-title":"XNLP-Completeness for parameterized problems on graphs with a linear structure","volume":"87","author":"Bodlaender","year":"2025","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115895_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2023.103493","article-title":"Solving problems on generalized convex graphs via mim-width","volume":"140","author":"Bonomo-Braberman","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115895_bib0011","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/jgt.22730","article-title":"Bounding the mim-width of hereditary graph classes","volume":"99","author":"Brettell","year":"2022","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115895_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2021.106168","article-title":"List k-colouring Pt-free graphs: a mim-width perspective","volume":"173","author":"Brettell","year":"2022","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115895_bib0013","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104163","article-title":"Comparing width parameters on graph classes","volume":"127","author":"Brettell","year":"2025","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.tcs.2026.115895_bib0014","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","article-title":"Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems","volume":"511","author":"Bui-Xuan","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115895_bib0015","series-title":"Proceedings of the 13th Innovations in Theoretical Computer Science Conference, ITCS 2022","first-page":"63:1","article-title":"A unifying framework for characterizing and computing width measures","volume":"215","author":"Eiben","year":"2022"},{"key":"10.1016\/j.tcs.2026.115895_bib0016","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2020.01.007","article-title":"Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width","volume":"814","author":"Galby","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115895_bib0017","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1007\/s00453-017-0289-1","article-title":"Output-polynomial enumeration on graphs of bounded (Local) linear mim-width","volume":"80","author":"Golovach","year":"2018","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115895_bib0018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2023.12.015","article-title":"On d-stable locally checkable problems parameterized by mim-width","volume":"347","author":"Gonzalez","year":"2024","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115895_bib0019","series-title":"Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019","first-page":"218","article-title":"Linear MIM-width of trees","volume":"11789","author":"H\u00f8gemo","year":"2019"},{"key":"10.1016\/j.tcs.2026.115895_bib0020","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.tcs.2019.09.012","article-title":"Mim-width III. Graph powers and generalized distance domination problems","volume":"796","author":"Jaffke","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115895_bib0021","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.dam.2019.06.026","article-title":"Mim-width I. Induced path problems","volume":"278","author":"Jaffke","year":"2020","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.115895_bib0022","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/s00453-019-00607-3","article-title":"Mim-width II. The feedback vertex set problem","volume":"82","author":"Jaffke","year":"2020","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.tcs.2026.115895_bib0023","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.23065","article-title":"Classes of intersection digraphs with good algorithmic properties","volume":"106","author":"Jaffke","year":"2024","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115895_bib0024","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.dam.2017.04.043","article-title":"Lower bounds on the mim-width of some graph classes","volume":"248","author":"Mengel","year":"2018","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115895_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.113825","article-title":"On algorithmic applications of sim-width and mim-width of (H1, H2)-free graphs","volume":"955","author":"Munaro","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115895_bib0026","series-title":"Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)","first-page":"38:1","article-title":"Finding induced subgraphs from graphs with small mim-width","volume":"294","author":"Otachi","year":"2024"},{"key":"10.1016\/j.tcs.2026.115895_bib0027","unstructured":"B.S. Panda, D. Pradhan, NP-completeness of Hamiltonian cycle problem on rooted directed path graphs, arXiv: 0809.2443(2008)."},{"issue":"3","key":"10.1016\/j.tcs.2026.115895_bib0028","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/3148227","article-title":"Fast hamiltonicity checking via bases of perfect matchings","volume":"65","author":"Cygan","year":"2018","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001544?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001544?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:04:10Z","timestamp":1775945050000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":28,"alternative-id":["S0304397526001544"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115895","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115895","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115895"}}