Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques von Fomin, Fedor V., Liedloff, Mathieu, Montealegre, Pedro, Todinca, Ioan

Volltext

Exact and Parameterized Algorithms for Max Internal Spanning Tree von Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu

Volltext

Efficient algorithms for Roman domination on some classes of graphs von Liedloff, Mathieu, Kloks, Ton, Liu, Jiping, Peng, Sheng-Lung

Volltext

Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques von Fomin, Fedor V., Liedloff, Mathieu, Montealegre, Pedro, Todinca, Ioan

Volltext

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set von Gaspers, Serge, Liedloff, Mathieu

Volltext

Moderate exponential-time algorithms for scheduling problems von T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu

Volltext

Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques von Liedloff, Mathieu, Montealegre, Pedro, Todinca, Ioan

Volltext

Exponential time algorithms for the minimum dominating set problem on some graph classes von Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu, Todinca, Ioan

Volltext

Moderate exponential-time algorithms for scheduling problems von T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu

Volltext

The many facets of upper domination von Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th

Volltext

Enumeration and maximum number of minimal dominating sets for chordal graphs von Golovach, Petr A., Kratsch, Dieter, Liedloff, Mathieu, Sayadi, Mohamed Yosri

Volltext

Exact Algorithms for L(2, 1)-Labeling of Graphs von Kratochvíl, Jan, Kratsch, Dieter, Liedloff, Mathieu

Volltext

Finding a dominating set on bipartite graphs von Liedloff, Mathieu

Volltext

On the number of minimal dominating sets on some graph classes von Couturier, Jean-François, Letourneur, Romain, Liedloff, Mathieu

Volltext

Exact exponential algorithms to find tropical connected sets of minimum size von Chapelle, Mathieu, Cochefert, Manfred, Kratsch, Dieter, Letourneur, Romain, Liedloff, Mathieu

Volltext

Treewidth and Pathwidth parameterized by the vertex cover number von Chapelle, Mathieu, Liedloff, Mathieu, Todinca, Ioan, Villanger, Yngve

Volltext

Enumeration and maximum number of maximal irredundant sets for chordal graphs von Golovach, Petr A., Kratsch, Dieter, Liedloff, Mathieu, Sayadi, Mohamed Yosri

Volltext

Solving Capacitated Dominating Set by using covering by subsets and maximum matching von Liedloff, Mathieu, Todinca, Ioan, Villanger, Yngve

Volltext

Fixing improper colorings of graphs von Garnero, Valentin, Junosza-Szaniawski, Konstanty, Liedloff, Mathieu, Montealegre, Pedro, Rzążewski, Paweł

Volltext

On Independent Sets and Bicliques in Graphs von Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu

Volltext