By Professor Serge Gaspers

Conference Papers

Gaspers S; Liedloff M, 2006, 'A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 78 - 89, http://dx.doi.org/10.1007/11917496_8

Gaspers S; Kratsch D; Liedloff M, 2006, 'Exponential time algorithms for the minimum dominating set problem on some graph classes', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 148 - 159, http://dx.doi.org/10.1007/11785293_16

Fomin FV; Gaspers S; Pyatkin AV, 2006, 'Finding a minimum feedback vertex set in time O(1.7548n)', in Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, pp. 184 - 191, http://dx.doi.org/10.1007/11847250_17

Back to profile page