2 papers
math.LO2026
A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
Manuel Bodirsky, Ãdouard Bonnet, Žaneta SemaniÅ¡inová
We study the complexity of the valued constraint satisfaction problem (VCSP) for every valued structure with the domain that is preserved by all order-preserving bije…
math.CO2024
Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
Ãdouard Bonnet, JÄdrzej Hodor, Tuukka Korhonen +1
A graph contains a graph as an induced minor if can be obtained from after vertex deletions and edge contractions. We show that for every -vertex planar graph $H…