Sciweavers

IWPEC
2004
Springer
13 years 10 months ago
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets
Michael R. Fellows, Stefan Szeider, Graham Wrights...
IWPEC
2004
Springer
13 years 10 months ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
IWPEC
2004
Springer
13 years 10 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
IWPEC
2004
Springer
13 years 10 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos