10 citations · 12 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 2 cited
A Definability Dichotomy for Finite Valued CSPs
Anuj Dawar, Pengming Wang
Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with…
cs.DS2015
Fixed-parameter Tractable Distances to Sparse Graph Classes
Jannis Bulian, Anuj Dawar
We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining t…