Titlebook: ;

reflection

List Coloring in the Absence of a Linear Forest,with no induced .. We also show that ... is fixed parameter tractable in . + . on graphs with no induced .. + .., and that .-. restricted to such graphs allows a polynomial kernel when parameterized by .. Finally, we show that ... is fixed parameter tractable in . for graphs with no induced .. + ...

ANTI

ANN

Structures and Hyperstructures in Metabolic Networks,idered as chemical factories that manufacture the various products of the cells and the metabolic capacities of an organism are directly defined by the set of its possible biochemical reactions. The links between reactions and compounds (or metabolites) that are used and produced by such reactions c

penance

Important Separators and Parameterized Algorithms,ter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al.[3] on the . problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.

fluffy

Split Clique Graph Complexity,(.), is the intersection graph of .. Say that . is . if there exists a graph . such that . = .(.). The clique graph recognition problem, a long-standing open question posed in 1971, asks whether a given graph is a clique graph and it was recently proved to be NP-complete even for a graph . with maxi

hermitage

On Searching for Small Kochen-Specker Vector Systems,that no two orthogonal vectors are assigned 0 and no three mutually orthogonal vectors are assigned 1. The existence of such sets forms the basis of the Kochen-Specker and Free Will theorems. Currently, the smallest known KS vector system contains 31 vectors. In this paper, we establish a lower boun

爱社交

空气

Glaci冰

Exact Algorithms for Kayles,lready chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has a winning strategy in this game. To analyse the running time of the algorithm, we introduce the notion of a K-set: a nonempty set of vertices . ⊆ . is

refraction

The Cinderella Game on Holes and Anti-holes,as the other player (the wicked Stepmother) wants to cause overflows. The bucket number of a graph . is the smallest possible bucket size with which Cinderella can win the game..We determine the bucket numbers of all perfect graphs, and we also derive results on the bucket numbers of certain non-per