Sciweavers

IWPEC
2010
Springer
14 years 10 days ago
On the Grundy Number of a Graph
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
Frédéric Havet, Leonardo Sampaio
IWPEC
2010
Springer
14 years 10 days ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter
IWPEC
2010
Springer
14 years 10 days ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
IWPEC
2010
Springer
14 years 10 days ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
IWPEC
2010
Springer
14 years 10 days ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij