Showing 2025Show all
2 papers · 1 filter
cs.DM2025
A CSP approach to Graph Sandwich Problems
Manuel Bodirsky, Santiago Guzmán-Pro
The \emph{Sandwich Problem} (SP) for a graph class $\calC$ is the following computational problem. The input is a pair of graphs and where , a…
cs.CC2025
Restricted CSPs and F-free Digraph Algorithmics
Santiago Guzmán-Pro, Barnaby Martin
In recent years, much attention has been placed on the complexity of graph homomorphism problems when the input is restricted to -free and -subgraph-f…