Sciweavers

359 search results - page 6 / 72
» The Parameterized Complexity of Counting Problems
Sort
View
IWPEC
2004
Springer
14 years 26 days ago
On Miniaturized Problems in Parameterized Complexity Theory
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
Yijia Chen, Jörg Flum
TAMC
2007
Springer
14 years 1 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
ISAAC
2007
Springer
113views Algorithms» more  ISAAC 2007»
14 years 1 months ago
The Parameterized Complexity of the Unique Coverage Problem
Hannes Moser, Venkatesh Raman, Somnath Sikdar