Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices

First, we show that on apex-minor-free graphs, a general class of graphs containing planar graphs, graphs of bounded treewidth, and graphs of bounded genus, the problem to

For tree-width and clique-width, we have a precise idea on the parameterized complexity of many classical NP-hard problems such as Vertex Cover , Hamiltonian Cycle , and

These problems are NP-complete on 3-regular graphs, and we showed that on bi- partite graphs, they become polynomial-time solvable; while parameterized by k, they are FPT, and

While several generic approximation algorithms are known for problems of minimum vertex deletion to obtain subgraphs with property P , as when P is a hereditary property with a

Keywords Exact exponential time algorithms · Parameterized algorithms · NP hard problems · Treewidth · #3-Coloring · #Minimum dominating set · Minimum maximal matching ·

⊓2 The general idea of parameterized subexponential time algorithm for Low GF(2)- Rank Approximation (Theorem 6) is similar to the parameterized subexponential time algorithm for

To this end, we utilize structural properties of “almost convex polygons” to present a two-stage reduction from Vertex-Vertex Art Gallery to a new constraint satisfaction problem

The aim of this study was to identify obstacles to optimal function of the polio eradication program in high risk districts in Pakistan, with the specific objective of finding health