Hamiltonicity parameterized by mim-width is (indeed) para-NP-hard

This publication has 19 references indexed in Scilit:

• Comparing width parameters on graph classes
  European Journal of Combinatorics, 2025
• XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
  Algorithmica, 2024
• On d-stable locally checkable problems parameterized by mim-width
  Discrete Applied Mathematics, 2024
• Classes of intersection digraphs with good algorithmic properties
  Journal of Graph Theory, 2023
• Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
  Algorithmica, 2022
• Bounding the mim‐width of hereditary graph classes
  Journal of Graph Theory, 2021
• Mim-Width I. Induced path problems
  Discrete Applied Mathematics, 2020
• Mim-Width II. The Feedback Vertex Set Problem
  Algorithmica, 2019
• Lower bounds on the mim-width of some graph classes
  Discrete Applied Mathematics, 2018
• Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
  Algorithmica, 2017