research
∙
08/29/2023
Approximate Monotone Local Search for Weighted Problems
In a recent work, Esmer et al. describe a simple method - Approximate Mo...
share
research
∙
08/23/2023
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple combinat...
research
∙
05/26/2023
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
For a well-studied family of domination-type problems, in bounded-treewi...
research
∙
11/08/2022
Computing Square Colorings on Bounded-Treewidth and Planar Graphs
A square coloring of a graph G is a coloring of the square G^2 of G, tha...
research
∙
11/08/2022
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
We investigate how efficiently a well-studied family of domination-type ...
research
∙
02/13/2018
