790 search results - page 10 / 158 » Subexponential Parameterized Algorithms |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
GMAI
2006
IEEE
14 years 3 months ago
2006
IEEE
Autostereoscopic displays are a subject of recent research efforts in Computer Graphics. Such displays have to be fed graphics information in order to produce spatial images. This...
CSL
2009
Springer
14 years 4 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
COCO
1998
Springer
14 years 2 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...