Aubian, Guillaume

Networks are ubiquitous in our daily life, whether they are social networks, neural networks, road networks or computer networks. Yet, graphs, their theoretical pendant, have been used for centuries to model real-life problems. A graph is a set of vertices with edges connecting them. In many applications, it is useful to give edges a direction, thu...

Fioravantes, Foivos-Sotirios

In this thesis, we consider two families of computational problems defined on graphs: proper edge-labellings and combinatorial games. We attack these problems in a similar (and classical) way: we show that they are computationally hard, and then find efficient algorithms for instances with specific structure.First we focus on problems related to pr...

Havet, Frédéric Ibiapina, Allen Rocha, Leonardo

A Nash k-colouring is a k-colouring (S1, . . . , Sk) such that every vertex of Si is adjacent to a vertex in Sj, whenever |Sj| ≥ |Si|. The Nash Number of G, denoted by Nn(G), is the largest k such that G admits a Nash k-colouring. A diminishing greedy k-colouring is a k-colouring (S1, . . . , Sk) such that, for all 1 ≤ j 0 such that χ (G) ≤ εω(G) ...

Bosek, Bartłomiej Disser, Yann Feldmann, Andreas Emil Pawlewicz, Jakub Zych-Pawlewicz, Anna

We consider the problem of coloring an interval graph dynamically. Intervals arrive one after the other and have to be colored immediately such that no two intervals of the same color overlap. In each step only a limited number of intervals may be recolored to maintain a proper coloring (thus interpolating between the well-studied online and offlin...

Willems, E; 118543; Zhang, F; 77941; Van Meerbeek, B; 14533; Vleugels, J; 6337;

© 2018 Elsevier Ltd The influence of 0.01–2 mol% Fe 2 O 3 powder addition on the microstructure, mechanical and optical properties, and hydrothermal stability of highly-translucent 3Y-TZP ceramics is assessed and compared with commercially available co-precipitated 0.18 mol% Fe 2 O 3 doped ZrO 2 powder-based ceramics. Only those ceramics with up to...

Casteigts, Arnaud Métivier, Yves Robson, John Michael Zemmari, Akka

We consider networks of processes which interact using beeps. In the basic model defined by Cornejo and Kuhn (2010), processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who listen can only distinguish between silence and the presence of at least one beep. We refer to this mod...

Senhaji, Mohammed

In this thesis we explore graph decompositions under different constraints. The title of the is due to the fact that most of these decompositions are neighbour-distinguishing. That is, we can extract from each such decomposition a proper vertex colouring. Moreover, most of the considered decompositions are edge partitions, and therefore can be seen...

Abreu, Marien; Goedgebeur, Jan; 145071; Labbate, Domenico; Mazzuoccolo, Giuseppe;

status: published

Abreu, Marien Goedgebeur, Jan Labbate, Domenico Mazzuoccolo, Giuseppe

MINOT, Maël

The objective of this thesis is, from a general standpoint, to design and evaluate decomposition methods for solving constrained optimisation problems. Two optimisation problems in particular are considered: the maximum common induced subgraph problem, in which the largest common part between two graphs is to be found, and the sum colouring problem...