Sciweavers

1199 search results - page 12 / 240
» Parameterized Proof Complexity
Sort
View
GD
2007
Springer
16 years 1 days ago
Crossing Numbers and Parameterized Complexity
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
ISAAC
2007
Springer
113views Algorithms» more  ISAAC 2007»
16 years 12 hour ago
The Parameterized Complexity of the Unique Coverage Problem
Hannes Moser, Venkatesh Raman, Somnath Sikdar
TAMC
2007
Springer
15 years 12 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
IWPEC
2004
Springer
15 years 11 months 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
MFCS
2004
Springer
15 years 11 months ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia