We study the tractability of the maximum independent set problem from th...
We propose an algorithm whose input are parameters k and r and a
hypergr...
For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …,
n}, and ...
In this paper we study syntactic branching programs of bounded repetitio...
We introduce a new graph parameter called linear upper maximum induced
m...
We prove that the tree-width of graphs in a hereditary class defined by ...
Fractional (hyper-)graph theory is concerned with the specific problems ...
Hypertree decompositions (HDs), as well as the more powerful generalized...
Hypertree decompositions (HDs), as well as the more powerful generalized...
We demonstrate that Regular Resolution is FPT for two restricted familie...
It is known that a positive Boolean function f depending on n variables ...
We introduce a new structural graph parameter called partial matching
wi...
We give a non-FPT lower bound on the size of structured decision DNNF an...
In this paper we study complexity of an extension of ordered binary deci...
In this paper we prove a space lower bound of n^Ω(k) for
non-determinist...
In many combinatorial problems one may need to model the diversity or
si...