Sciweavers

COCOA
2007
Springer
14 years 1 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
COCOA
2007
Springer
14 years 1 months ago
Mechanism Design by Creditability
This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional...
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schm...
COCOA
2007
Springer
14 years 1 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
COCOA
2007
Springer
14 years 1 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar