activity
20142024
most citedA tamed family of triangle-free graphs with unbounded chromatic number

2 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2024

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…