On minimal two-edge-connected graphs. - Denis Cornaz; Youcef Magnouche; Ali Ridha Mahjoub (CoDIT, 2014)

The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price. - Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2016)

The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness. - Youcef Magnouche; Sébastien Martin (ISCO, 2016)

The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms. (Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes). - Youcef Magnouche (2017)

The Minimum Rooted-Cycle Cover Problem. - Denis Cornaz; Youcef Magnouche (ISCO, 2018)

The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. - Denis Cornaz; Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (Discret. Appl. Math., 2019)

Model predictive control for load balancing. - Pham Tran Anh Quang; Youcef Magnouche; Jeremie Leguay; Xu Gong; Feng Zeng (SIGCOMM Posters and Demos, 2020)

Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm. - Youcef Magnouche; Sébastien Martin (Optim. Lett., 2020)

Distributed Load Balancing From the Edge in IP Networks. - Youcef Magnouche; Pham Tran Anh Quang; Jérémie Leguay; Xu Gong; Feng Zeng (ICC, 2021)

Distributed Utility Maximization From the Edge in IP Networks. - Youcef Magnouche; Pham Tran Anh Quang; Jérémie Leguay; Xu Gong; Feng Zeng (IM, 2021)

The multi-terminal vertex separator problem: Branch-and-Cut-and-Price. - Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (Discret. Appl. Math., 2021)

Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. - Youcef Magnouche; Sébastien Martin; Jérémie Leguay; Francesco De Pellegrini; Rachid Elazouzi; Cédric Richier (INOC, 2022)

Constrained shortest path tour problem: Branch-and-Price algorithm. - Sébastien Martin; Youcef Magnouche; Corentin Juvigny; Jérémie Leguay (Comput. Oper. Res., 2022)

The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm. - Jiachen Zhang; Youcef Magnouche; Sébastien Martin; Antoine Fressancourt; J. Christopher Beck (CoDIT, 2023)

Safe Routing in Energy-aware IP networks. - Youcef Magnouche; Jérémie Leguay; Feng Zeng (DRCN, 2023)

Protected load-balancing problem: Neural-network based approximation for non-convex optimization. - Youcef Magnouche; Sébastien Martin; Jérémie Leguay (NOMS, 2023)

The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition. - Fan Zhang 016; Jiazheng Wang; Mathieu Lacroix 001; Roberto Wolfler Calvo; Youcef Magnouche; Sébastien Martin (CoDIT, 2024)

Alternative paths computation for congestion mitigation in segment-routing networks. - Sébastien Martin; Youcef Magnouche; Paolo Medagliani; Jérémie Leguay (CoDIT, 2024)

Demo: Fast Routing-Loops Identification in Multi-Protocol Multi-Instance IP Networks. - Youcef Magnouche; Sébastien Martin; Jérémie Leguay; Mei Cong 001; Guofeng Qian (ICNP, 2024)

In-Band Network Telemetry for Efficient Congestion Mitigation. - Youcef Magnouche; Sébastien Martin; Jeremie Leguay; Paolo Medagliani (INOC, 2024)

Computing Bipath Multicommodity Flows with Constraint Programming-Based Branch-and-Price-and-Cut. - Jiachen Zhang; Youcef Magnouche; Pierre Bauguion; Sébastien Martin; J. Christopher Beck (INFORMS J. Comput., 2024)

Semi-Distributed Coflow Scheduling in Datacenters. - Rachid El Azouzi; Francesco De Pellegrini; Afaf Arfaoui; Cédric Richier; Jeremie Leguay; Quang-Trung Luu; Youcef Magnouche; Sébastien Martin (IEEE Trans. Netw. Serv. Manag., 2024)

Distributed Tactical TE With Segment Routing. - Paolo Medagliani; Sébastien Martin; Youcef Magnouche; Jérémie Leguay; Bruno Decraene (IEEE Trans. Netw. Serv. Manag., 2024)

Scalable Verification of Routing Loops in Multi-Protocol Multi-Instance IP Networks. - Youcef Magnouche; Sébastien Martin; Jérémie Leguay; Cong Mei 001 (ITC-36, 2025)

Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation. - Sébastien Martin; Pierre Bauguion; Youcef Magnouche; Jérémie Leguay (CoRR, 2025)

Design of survivable networks with low connectivity requirements. - Fatmah Almathkour; Youcef Magnouche; Ali Ridha Mahjoub; Raouia Taktak (Int. Trans. Oper. Res., 2025)

On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms. - Walid Astaoui; Youcef Magnouche; Sébastien Martin (Ann. Oper. Res., 2025)