The k-node-connected subgraph problem: Facets and Branch-and-Cut. - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub (DRCN, 2016)

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut. - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub; Raouia Taktak (Electron. Notes Discret. Math., 2016)

The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut. - Meriem Mahjoub; I. Diarrassouba; Ali Ridha Mahjoub; Raouia Taktak (Comput. Ind. Eng., 2017)

The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms. (Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes). - Meriem Mahjoub (2017)

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut. - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub; Hande Yaman (Ann. des Télécommunications, 2018)