The vertex separator problem : a polyhedral investigation, Mathematical Programming, n, vol.3, pp.583-608, 2005. ,
Breakout local search for the vertex separator problem, Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, 2013. ,
Finding Good Approximate Vertex and Edge Partitions is NP-Hard, Information Processing Letters, vol.42, pp.153-159, 1992. ,
Exact algorithms for the vertex separator problem in graphs, vol.57, pp.212-230, 2011. ,
Lagrangian relaxation and cutting planes for the vertex separator problem, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp.471-482, 2007. ,
An exact algorithm for solving the vertex separator problem, Journal of Global Optimization,n, vol.3, pp.425-434, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01318627
NP-completeness of the planar separator problems, Journal of Graph Algorithms and Applications, issue.4, pp.317-328, 2006. ,
, Computers and Intractabiliy, 1979.
Continuous quadratic programming formulations of optimization problems on graphs, European Journal of Operational Research, vol.240, pp.328-337, 2014. ,
A spectral bundle method for semidefinite programming, SIAM J. Numer. Anal, vol.36, pp.177-189, 1979. ,
Combing inteensification and diversification strategies in VSN.An application to the Vertex Separator problem, Computers and Operations Research, vol.52, pp.209-219, 2014. ,
A separator theorem for planar graphs, SIAM J. Num. Anal, vol.36, pp.177-189, 1979. ,
General variable neighborhood search for computing graph separators, Optimization Letters, pp.1-21, 2014. ,
The vertex separator problem : algorithms and computations, Mathematical Programming, vol.103, pp.609-631, 2005. ,
An improved K-opt local search algorithm for the vertex separator problem, Journal of Computational and Theoretical Nanoscience, n, vol.11, pp.4942-4958, 2015. ,