E. Balas and C. De-souza, The vertex separator problem: a polyhedral investigation, Mathematical Programming, vol.103, issue.3, pp.583-608, 2005.
DOI : 10.1007/s10107-005-0574-7

U. Benlic and J. K. Hao, Breakout local search for the vertex separator problem, In: IJCAI, 2013.
DOI : 10.1016/j.engappai.2012.09.001

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

T. N. Bui and C. Jones, Finding good approximate vertex and edge partitions is NP-hard, Information Processing Letters, vol.42, issue.3, pp.153-159, 1992.
DOI : 10.1016/0020-0190(92)90140-Q

T. A. Davis, Direct methods for sparse linear systems, Siam, vol.2, 2006.
DOI : 10.1137/1.9780898718881

D. Biha, M. Meurs, and M. J. , An exact algorithm for solving the vertex separator problem, Journal of Global Optimization, vol.36, issue.103, pp.425-434, 2011.
DOI : 10.1007/s10898-010-9568-y

URL : https://hal.archives-ouvertes.fr/hal-01318627

B. Fu, S. A. Oprisan, and L. Xu, MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING, International Journal of Computational Geometry & Applications, vol.4, issue.05, pp.389-413, 2008.
DOI : 10.1002/9781118033203

J. Fukuyama, NP-completeness of the Planar Separator Problems, Journal of Graph Algorithms and Applications, vol.10, issue.2, pp.317-328, 2006.
DOI : 10.7155/jgaa.00130

W. W. Hager and J. T. Hungerford, Continuous quadratic programming formulations of optimization problems on graphs, European Journal of Operational Research, vol.240, issue.2, pp.328-337, 2015.
DOI : 10.1016/j.ejor.2014.05.042

A. Kanevsky, Finding all minimum-size separating vertex sets in a graph, Networks, vol.34, issue.6, 1988.
DOI : 10.1002/net.3230230604

R. J. Lipton and R. E. Tarjan, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, pp.177-189, 1979.
DOI : 10.1137/0136016

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

M. Schuchard, J. Geddes, C. Thompson, and N. Hopper, Routing around decoys, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.85-96, 2012.
DOI : 10.1145/2382196.2382209

C. De-souza and E. Balas, The vertex separator problem: algorithms and computations, Mathematical Programming, vol.10, issue.3, pp.609-631, 2005.
DOI : 10.1007/s10107-005-0573-8

J. D. Ullman, Computational aspects of VLSI, 1984.