Hardness Results and Approximation Algorithms for Discrete Optimization Problems with Conditional and Unconditional Forbidden Vertices, Research report, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01257820
On two problems in the generation of program test paths. Software Engineering, IEEE Transactions on, vol.3, pp.227-231, 1976. ,
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions, pp.257-267, 2013. ,
DOI : 10.1007/978-3-642-35843-2_23
Trees in Graphs with Conflict Edges or Forbidden Transitions, TAMC 2013, pp.343-354, 2013. ,
DOI : 10.1007/978-3-642-38236-9_31
Finding Paths in Grids with Forbidden Transitions, pp.154-168, 2015. ,
DOI : 10.1007/978-3-662-53174-7_12
On the complexity of paths avoiding forbidden pairs, Discrete Applied Mathematics, vol.157, issue.13, pp.2871-2876, 2009. ,
DOI : 10.1016/j.dam.2009.03.018
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
Some Hamiltonian Properties of One-Conflict Graphs, pp.262-273, 2014. ,
DOI : 10.1007/978-3-319-19315-1_23
Nash-Williams-type and Chv??tal-type Conditions in One-Conflict Graphs, pp.327-338, 2015. ,
DOI : 10.1007/978-3-662-46078-8_27
An introduction to formal languauges and automata, Jones and Barrlett, 2006. ,
On paths avoiding forbidden pairs of vertices in a graph, Discrete Applied Mathematics, vol.74, issue.1, pp.85-92, 1997. ,
DOI : 10.1016/S0166-218X(96)00017-0