New Approximation Algorithms for the Vertex Cover Problem, IWOCA, pp.438-442, 2013. ,
DOI : 10.1007/978-3-642-45278-9_39
URL : https://hal.archives-ouvertes.fr/hal-01215211
Paths, trees and matchings under disjunctive constraints, Discrete Applied Mathematics, vol.159, issue.16, pp.1726-1735, 2011. ,
DOI : 10.1016/j.dam.2010.12.016
URL : http://doi.org/10.1016/j.dam.2010.12.016
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions, SOFSEM, pp.257-267, 2013. ,
DOI : 10.1007/978-3-642-35843-2_23
Trees in Graphs with Conflict Edges or Forbidden Transitions, TAMC (Theory and Applications of Models of Computation ), pp.343-354, 2013. ,
DOI : 10.1007/978-3-642-38236-9_31
Complexity of the path avoiding forbidden pairs problem revisited, Discrete Applied Mathematics, vol.161, issue.10-11, pp.1506-1512, 2013. ,
DOI : 10.1016/j.dam.2012.12.022
Depth-first search and the vertex cover problem, Information Processing Letters, vol.14, issue.5, pp.233-235, 1982. ,
DOI : 10.1016/0020-0190(82)90022-9
Finding paths in graphs avoiding forbidden transitions, Discrete Applied Mathematics, vol.126, issue.2-3, pp.261-273, 2003. ,
DOI : 10.1016/S0166-218X(02)00251-2