1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2009★ 1 cited
Enumerating Homomorphisms
Andrei A. Bulatov, Victor Dalmau, Martin Grohe +1
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve…
cs.DS2008
Obtaining a Planar Graph by Vertex Deletion
Dániel Marx, Ildikó Schlotter
In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of…