E-LIB Suche - Ergebnisse für: Liedloff, Mathieu

1

Moderate exponential-time algorithms for scheduling problem:

T'kindt, Vincent ; Della Croce, Federico ; Liedloff, Mathieu
4OR. 20 (2022) 4 - p. 533-566 , 2022

Link: https://doi.org/10.1007/..

2

Enumeration and maximum number of maximal irredundant sets ..:

Golovach, Petr A. ; Kratsch, Dieter ; Liedloff, Mathieu.
Discrete Applied Mathematics. 265 (2019) - p. 69-85 , 2019

Link: https://doi.org/10.1016/..

3

Enumeration and maximum number of minimal dominating sets f..:

Golovach, Petr A. ; Kratsch, Dieter ; Liedloff, Mathieu.
Theoretical Computer Science. 783 (2019) - p. 41-52 , 2019

Link: https://doi.org/10.1016/..

4

Fixing improper colorings of graphs:

Garnero, Valentin ; Junosza-Szaniawski, Konstanty ; Liedloff, Mathieu..
Theoretical Computer Science. 711 (2018) - p. 66-78 , 2018

Link: https://doi.org/10.1016/..

5

The many facets of upper domination:

Bazgan, Cristina ; Brankovic, Ljiljana ; Casel, Katrin...
Theoretical Computer Science. 717 (2018) - p. 2-25 , 2018

Link: https://doi.org/10.1016/..

6

Beyond Classes of Graphs with "Few" Minimal Separators: FPT..:

Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, Ioan
Algorithmica. 81 (2018) 3 - p. 986-1005 , 2018

Link: https://doi.org/10.1007/..

7

Exact algorithms for weak Roman domination:

Chapelle, Mathieu ; Cochefert, Manfred ; Couturier, Jean-Fraņcois...
Discrete Applied Mathematics. 248 (2018) - p. 79-92 , 2018

Link: https://doi.org/10.1016/..

8

Treewidth and Pathwidth parameterized by the vertex cover n..:

Chapelle, Mathieu ; Liedloff, Mathieu ; Todinca, Ioan.
Discrete Applied Mathematics. 216 (2017) - p. 114-129 , 2017

Link: https://doi.org/10.1016/..

9

Exact exponential algorithms to find tropical connected set..:

Chapelle, Mathieu ; Cochefert, Manfred ; Kratsch, Dieter..
Theoretical Computer Science. 676 (2017) - p. 33-41 , 2017

Link: https://doi.org/10.1016/..

10

Exact exponential algorithms for 3-machine flowshop schedul..:

Shang, Lei ; Lenté, Christophe ; Liedloff, Mathieu.
Journal of Scheduling. 21 (2017) 2 - p. 227-233 , 2017

Link: https://doi.org/10.1007/..

11

Algorithms Parameterized by Vertex Cover and Modular Width,..:

Fomin, Fedor V. ; Liedloff, Mathieu ; Montealegre, Pedro.
Algorithmica. 80 (2017) 4 - p. 1146-1169 , 2017

Link: https://doi.org/10.1007/..

12

On finding optimal polytrees:

Gaspers, Serge ; Koivisto, Mikko ; Liedloff, Mathieu..
Theoretical Computer Science. 592 (2015) - p. 49-58 , 2015

Link: https://doi.org/10.1016/..

13

On the number of minimal dominating sets on some graph clas..:

Couturier, Jean-François ; Letourneur, Romain ; Liedloff, Mathieu
Theoretical Computer Science. 562 (2015) - p. 634-642 , 2015

Link: https://doi.org/10.1016/..

14

Complexity of splits reconstruction for low-degree trees:

Gaspers, Serge ; Liedloff, Mathieu ; Stein, Maya.
Discrete Applied Mathematics. 180 (2015) - p. 89-100 , 2015

Link: https://doi.org/10.1016/..

15

Solving Capacitated Dominating Set by using covering by sub..:

Liedloff, Mathieu ; Todinca, Ioan ; Villanger, Yngve
Discrete Applied Mathematics. 168 (2014) - p. 60-68 , 2014

Link: https://doi.org/10.1016/..