Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends
first-order logic (𝖥𝖮) with...
We show that the dominating set problem admits a constant factor
approxi...
Nowhere dense classes of graphs are classes of sparse graphs with rich
s...
We show how to compute a 20-approximation of a minimum dominating set in...
We introduce a new data structure for answering connectivity queries in
...
First-order logic (FO) can express many algorithmic problems on graphs, ...
We study the (hereditary) discrepancy of definable set systems, which is...
A strong backdoor in a formula ϕ of propositional logic to a tractable
c...
We show that the dominating set problem admits a constant factor
approxi...
We consider the evaluation of first-order queries over classes of databa...
We study the graph parameter elimination distance to bounded degree, whi...