| 2008 |
|---|
| 11 | EE | Fedor V. Fomin,
Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff,
Saket Saurabh:
Iterative Compression and Exact Algorithms.
MFCS 2008: 335-346 |
| 10 | EE | Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs.
WG 2008: 171-182 |
| 9 | EE | Mathieu Liedloff,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Efficient algorithms for Roman domination on some classes of graphs.
Discrete Applied Mathematics 156(18): 3400-3415 (2008) |
| 8 | EE | Mathieu Liedloff:
Finding a dominating set on bipartite graphs.
Inf. Process. Lett. 107(5): 154-157 (2008) |
| 2007 |
|---|
| 7 | EE | Jan Kratochvíl,
Dieter Kratsch,
Mathieu Liedloff:
Exact Algorithms for L (2, 1)-Labeling of Graphs.
MFCS 2007: 513-524 |
| 6 | EE | Fedor V. Fomin,
Petr A. Golovach,
Jan Kratochvíl,
Dieter Kratsch,
Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination.
WADS 2007: 507-518 |
| 5 | EE | Dieter Kratsch,
Mathieu Liedloff:
An exact algorithm for the minimum dominating clique problem.
Theor. Comput. Sci. 385(1-3): 226-240 (2007) |
| 2006 |
|---|
| 4 | EE | Dieter Kratsch,
Mathieu Liedloff:
An Exact Algorithm for the Minimum Dominating Clique Problem.
IWPEC 2006: 130-141 |
| 3 | EE | Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff:
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.
SWAT 2006: 148-159 |
| 2 | EE | Serge Gaspers,
Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.
WG 2006: 78-89 |
| 2005 |
|---|
| 1 | EE | Mathieu Liedloff,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Roman Domination over Some Graph Classes.
WG 2005: 103-114 |
