We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider