All Stories

  1. The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems

    Article • July 2024, ACM (Association for Computing Machinery)

    Manuel Bodirsky

  2. A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory

    Article • ACM Transactions on Computation Theory, March 2024, ACM (Association for Computing Machinery)

    Manuel Bodirsky

  3. A tame family of constraint satisfaction problems shows exotic behavior when approached using logic

    Article • Journal of the ACM, December 2022, ACM (Association for Computing Machinery)

    Jakub Rydval, Manuel Bodirsky

  4. Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation

    Article • ACM Transactions on Computational Logic, January 2022, ACM (Association for Computing Machinery)

    Manuel Bodirsky

  5. Temporal Constraint Satisfaction Problems in Fixed-Point Logic

    Article • May 2020, ACM (Association for Computing Machinery)

    Manuel Bodirsky

  6. A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP

    Article • July 2018, ACM (Association for Computing Machinery)

    Manuel Bodirsky

  7. Discrete Temporal Constraint Satisfaction Problems

    Article • Journal of the ACM, March 2018, ACM (Association for Computing Machinery)

    Manuel Bodirsky

  8. REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS

    Article • Journal of Symbolic Logic, September 2016, Cambridge University Press

    Manuel Bodirsky

  9. Schaefer's Theorem for Graphs

    Article • Journal of the ACM, June 2015, ACM (Association for Computing Machinery)

    Manuel Bodirsky