6 citations · 14 across the 31 of their papers we have counts for
5 papers · 1 filter
Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak +3
Determining the validity of a quantified Boolean formula (QBF) is a PSPACE-complete problem with rich expressive power. Despite interest in efficient solvers, there is, compared to…
Solving Quantified Boolean Formulas with Few Existential Variables
Leif Eriksson, Victor Lagerkvist, George Osipov +3
The quantified Boolean formula (QBF) problem is an important decision problem generally viewed as the archetype for PSPACE-completeness. Many problems of central interest in AI are…
Target Set Selection parameterized by vertex cover and more
Suman Banerjee, Rogers Mathew, Fahad Panolan
Given a simple, undirected graph with a threshold function , the \textsc{Target Set Selection} (TSS) problem is about choosing a minimum cardinal…
Parameterized Algorithms for Deletion to (r,l)-graphs
Sudeshna Kolay, Fahad Panolan
For fixed integers , a graph is called an {\em -graph} if the vertex set can be partitioned into independent sets and cliques. This b…
Reconfiguration on sparse graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +2
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two…