Search

Now showing items 21-30 of 78

Complexity of Grundy coloring and its variants.

Bonnet, Édouard; Foucaud, Florent; Kim, Eun Jung; Sikora, Florian (2018) Article accepté pour publication ou publié

An exact algorithm for the Partition Coloring Problem.

Furini, Fabio; Malaguti, Enrico; Santini, Alberto (2018) Article accepté pour publication ou publié

The many facets of upper domination.

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis (2018) Article accepté pour publication ou publié

Time-approximation trade-offs for inapproximable problems.

Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis (2018) Article accepté pour publication ou publié

Multi-attribute proportional representation.

Lang, Jérôme; Skowron, Piotr (2018) Article accepté pour publication ou publié

Parameterized complexity and approximation issues for the colorful components problems.

Dondi, Riccardo; Sikora, Florian (2018) Article accepté pour publication ou publié

Finding disjoint paths on edge-colored graphs: more tractability results.

Dondi, Riccardo; Sikora, Florian (2018) Article accepté pour publication ou publié

An application of the Shapley value to the analysis of co-expression networks.

Cesari, Giulia; Algaba, Encarnación; Moretti, Stefano; Nepomuceno, Juan A. (2018) Article accepté pour publication ou publié

Shortest Path Problem variants for the Hydro Unit Commitment Problem.

Ackooij, Wim van; D'Ambrosio, Claudia; Liberti, Leo; Taktak, Raouia; Thomopulos, Dimitri; Toubaline, Sónia (2018) Article accepté pour publication ou publié

An exact algorithm for the Partition Coloring Problem.

Furini, Fabio; Malaguti, Enrico; Santini, Alberto (2018) Article accepté pour publication ou publié

1
2
3
4
5
6
. . .
8

Search

Filters

Complexity of Grundy coloring and its variants.

An exact algorithm for the Partition Coloring Problem.

The many facets of upper domination.

Time-approximation trade-offs for inapproximable problems.

Multi-attribute proportional representation.

Parameterized complexity and approximation issues for the colorful components problems.

Finding disjoint paths on edge-colored graphs: more tractability results.

An application of the Shapley value to the analysis of co-expression networks.

Shortest Path Problem variants for the Hydro Unit Commitment Problem.

An exact algorithm for the Partition Coloring Problem.