Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

1 Publication


2026 | Published | Journal Article | IST-REx-ID: 22247 | OA | PlanS
M. Filakovský, T. V. Nakajima, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” ACM Transactions on Computation Theory, vol. 18, no. 2. Association for Computing Machinery, 2026.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

keyword="Constraint satisfaction problem"

Search

Filter Publications

  • Display / Sort

    Citation Style: IEEE

    Export / Embed