Publications

International journals

The authors are given in alphabetic order for the references with a ∗

1. *Astaoui, W., Magnouche, Y. & Martin, S. On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms. Ann Oper Res. https://doi.org/10.1007/s10479-025-06592-x, 2025.

2. *I. Bentoumi, F. Furini, A. R. Mahjoub, S. Martin. Integer linear programming formulations for the maximum flow blocker problem. European Journal of Operational Research, https://doi.org/10.1016/j.ejor.2025.02.013, 2025.

3. S. Martin, P. Bauguion, Y. Magnouche, J. Leguay. Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation. Networks.  https://doi.org/10.1002/net.22269, 2025.

4. N. Huin, S. Martin, J. Leguay. Multitopology Routing With Virtual Topologies and Segment Routing. International Journal of Network Management 35 (1), e2321, 2025

5. * A. Bulaich Mehamdi, M. Lacroix, S. Martin. Pricing filtering in Dantzig-Wolfe decomposition. Operations Research Letters 58, 107207. 2025.

6. P. Medagliani, S. Martin, Y. Magnouche, J. Leguay, B. Decraene. Distributed Tactical TE With Segment Routing IEEE Transactions on Network and Service Management. vol. 21, no. 5, pp. 4974-4987, 2024.

7. R. El-Azouzi, F. De Pellegrini, A. Arfaoui, C. Richier, J. Leguay, Q.-T. Luu, Y. Magnouche, S. Martin. Semi-Distributed Coflow Scheduling in Datacenters IEEE Transactions on Network and Service Management. vol. 21, no. 4, pp. 4268-4281, 2024.

8. J. Zhang, Y. Magnouche, P. Bauguion, S. Martin, J. C. Beck. Computing Bi-Path Multi-Commodity Flows with Constraint Programming-based Branch-and-Price-and-Cut. INFORMS Journal on Computing. 36(6): pp. 1634-1653, 2024.

9.  * P. Healy, N. Jozefowiez, P. Laroche, F. Marchetti, S. Martin, Z. Róka. A branch-and-cut algorithm for the Connected Max-k-Cut Problem. European Journal of Operational Research 312 (1), pp. 117-124, 2023. https://doi.org/10.1016/j.ejor.2023.06.015

10. * N. Huin, J. Leguay, S. Martin, P. Medagliani. Routing and slot allocation in 5G hard slicing. Computer Communications 201, pp. 72-90, 2023.

11. V. Angilella, F. Krasniqi, P. Medagliani, S. Martin, J. Leguay, R. Shoushou, L. Xuan. High capacity and Resilient Large-scale Deterministic IP Networks. Journal of Network and Systems Management 30 (4), pp. 1-28. 2022.

12. S. Martin, Y. Magnouche, C. Juvigny, J. Leguay. Constrained shortest path tour problem: Branch-and-Price algorithm. Computers and Operations Research 144, pp. 105819. 2022.

13. * M. Becker, N. Ginoux, S. Martin and Z. Róka. Tire noise optimization problem: a mixed integer linear programming approach. RAIRO-Operations Research 55 (5), pp. 3073-3085. 2022.

14. * A. Grange, I. Kacem, S. Martin and S. Minich. Fully Polynomial Time Approximation Scheme for the Pagination Problem with hierarchical structure of tiles. RAIRO-Operations Research 57, pp. 1–16. 2023. https://doi.org/10.1051/ro/2022022

15. J. Krolikowski, S. Martin, P. Medagliani, J. Leguay., S. Chen, X. Chang and X. Geng. Joint Routing and Scheduling for Large-Scale Deterministic IP Networks. Computer Communication 165, pp. 33-42. 2020.

16.  * Y. Magnouche, A. R. Mahjoub and S. Martin. The multi-terminal vertex separator problem: Branch-and-Cut-and-Price. Discrete Applied Mathematics 290, pp. 86-111. 2020

17. * Y. Magnouche and S. Martin. Most Vital Vertices for the Shortest s-t Path Problem: Complexity and Branch-and-Cut algorithm. Optimization Letters 14 (8), pp. 2039-2053. 2020.

18. * P. Laroche, F. Marchetti, S. Martin, A. Nagih, Z. Róka. Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discrete Optimization 35, pp. 100551. 2020. https://doi.org/10.1016/j.disopt.2019.100551

19. * F. Furini, I. Ljubić, S. Martin, P. San Segundo. The Maximum Clique Interdiction Problem, European Journal of Operational Research. Volume 277, Issue 1, pp. 112-127. 2019.

20. * D. Cornaz, Y. Magnouche, A. R. Mahjoub and S. Martin. The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. Discrete Applied Mathematics. 256, pp. 11-37. 2019.

21. * D. Cornaz, F. Furini, M. Lacroix, R. Mahjoub, E. Malaguti, S. Martin. The Vertex k-cut Problem. Discrete Optimization 31, pp. 8-28. 2019.

22. * M. A. Hassan, I. Kacem, S. Martin, I. M. Osman. On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. Journal of Combinatorial Optimization 36, pp. 1074–1101. 2018.

23. * A. Grange, I. Kacem, S. Martin. Algorithms for the Bin Packing Problem with Overlapping Items. Computers & Industrial Engineering 115, pp. 331-341. 2018.

24. * L. Alfandari, T. Davidovi, F. Furini, I. Ljubic, V. Maras, S. Martin. Tighter MIP formulations for Barge Container Ship Routing. Omega 82, pp. 38-54. 2019.

25. * M. A. Hassan, I. Kacem, S. Martin, I. M. Osman. Genetic Algorithms for Job Scheduling in Cloud Computing. Studies in Informatics and Control, ISSN 1220-1766, vol. 24 (4), pp. 387-400, 2015.

26. * M. Lacroix, A. R. Mahjoub, S. Martin et C. Picouleau. On the NP-Completeness of the Perfect Matching Free Subgraph Problem. Theoretical Computer Science, Vol. 423, pp. 25-29. 2012.

27. * M. Lacroix, A. R. Mahjoub et S. Martin. Combinatorial Optimization Model and MIP formulation for the Structural Analysis of Conditional Differential-Algebraic Systems. Computers & Industrial Engineering 61, pp. 422-429. 2011

International conferences 

1. Y. Magnouche, S. Martin, J. Leguay, C. Mei. Scalable Verification of Routing Loops in Multi-Protocol Multi-Instance IP Networks. ITC 36, 2025.

2. S. Martin, Y. Magnouche, P. Medagliani, J. Leguay. Alternative Paths Computation for Congestion Mitigation in Segment-Routing Networks. CODIT 24, pp 1159-1164. 2024.

3. F. Zhang, W. Jiazheng, M. Lacroix, R. Wolfler Calvo, Y. Magnouche, S. Martin. The Multi-Commodity Flow Problem: Double Dantzig-Wolfe Decomposition. CODIT 24, pp. 1171-1176. 2024.

4. Y. Magnouche, S. Martin, J. Leguay, P. Medagliani. In-Band Network Telemetry for Efficient Congestion Mitigation. pp. 34-39, INOC 2024.

5. N. Huin, S. Martin, J. Leguay. Virtual Multi-Topology Routing for QoS Constraints. 37th IEEE/IFIP Network Operations and Management Symposium (NOMS 2024). pp. 1-9, 2024.

6. M. Y. Naghmouchi, S. Ren, P. Medagliani, S. Martin, J. Leguay. Optimal Admission Control in Damper-Based Networks: Branch-And-Price Algorithm. CODIT 23, pp. 488-493. 2023. (This publication won the best paper award.)

7. J. Zhang, Y. Magnouche, S. Martin, A. Fressancourt, C. Beck. The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-And-Benders-Cut Algorithm. CODIT 23, pp. 477-482. 2023. 

8. M. Pineda Martín, S. Martin. Unsplittable Multi-Commodity Flow Problem Via Quantum Computing. CODIT 23, pp. 385-390. 2023. 

9. A. Benhamiche, M. Chopin, S. Martin. Unsplittable Shortest Path Routing: Extended Model and Matheuristic. CODIT 23, pp. 926-931. 2023. 

10. R. Grappe, M. Lacroix, S. Martin. The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. CODIT 23, pp. 956-961. 2023.

11. I. Bentoumi, F. Furini, A. R. Mahjoub, S. Martin. A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. CODIT 23, pp. 674-677. 2023.

12. Y. Magnouche, S. Martin, J. Leguay. Protected load-balancing problem: Neural-network-based approximation for non-convex optimization. NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium (NOMS 2023), pp. 1-9. 2023.

13. M. Y. Naghmouchi, S. Ren, P. Medagliani, S. Martin, J. Leguay. Scalable Damper-based Deterministic Networking. 2022 18th International Conference on Network and Service Management (CNSM 2022), pp. 367-373. 2022.

14. T. A. Q. Pham, S. Martin, J. Leguay, Xu Gong, Xu Huiying. ICC 2022-IEEE International Conference on Communications, pp. 4914-4919. May 2022.

15. Y. Magnouche, S. Martin, J. Leguay, F. De-Pellegrini, R. El-Azouzi, C. Richier. Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. INOC 2022, pp. 1-6. 2022.

16. S. Martin, P. Medagliani, J. Leguay. Network Slicing for Deterministic Latency. 2021 17th International Conference on Network and Service Management (CNSM), pp. 572-577.  2021.

17. B. Liu, S. Ren, C. Wang, V. Angillela, P. Medagliani, S. Martin, J. Leguay. Towards Large-Scale Deterministic IP Networks. 2021 IFIP Networking Conference (IFIP Networking), pp. 1-9. 2021.

18. * A. Grange, I. Kacem, S. Martin, S. Minich. Approximate solutions for a special pagination problem with 2 symbols per tile. 2021 IEEE International Conference on Networking, Sensing and Control (ICNSC), pp. 1-4. 2021.

19. * S. Chen, J. Leguay, S. Martin and P. Medagliani. Load Balancing for Deterministic Networks. 2020 IFIP Networking Conference (Networking), pp. 785-790. 2020.

20. * N. Huin, J. Leguay, S. Martin, P. Medagliani, S. Cai. Routing and Slot Allocation in 5G Hard Slicing. 9th International Network Optimization Conference. pp. 72-77. 2019.

21. * A. Grange, I. Kacem, S. Martin, S. Minich. Fully polynomial-time approximation scheme for the pagination problem. Proceedings of International Conference on Computers and Industrial Engineering, CIE49, pp. 1-10. 2019

22. * F. Furini, E. Malaguti, S. Martin and I. C. Ternier. ILP Models and Column Generation for the Minimum Sum Coloring Problem.  Electronic Notes in Discrete Mathematics 64, pp. 215-224. 2018.

23. * P. Laroche, F. Marchetti, S. Martin et Z. Roka. " Bipartite Complete Matching Vertex Interdiction Problem with Incompatibility Constraints: Complexity and Heuristics ". 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 6-11.  2017.

24. * M. Hassan, I. Kacem, S. Martin and I. M.Osman. " Mathematical Formulation for Open Shop Scheduling Problem ". 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 803-808.  2017.

25. * M. Becker, N. Ginoux, S. Martin and Zs. Roka. Optimization of Tire Noise by Solving an Integer Linear Program (ILP) 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC2016), pp. 1591-1596. 2016.

26. * Y. Magnouche and S. Martin. "The Multi-terminal vertex separator problem: Polytope characterization and TDI-ness". Combinatorial Optimization: 4th International Symposium, ISCO 2016, pp. 320-331. 2016.

27. * M. Hassan, I. Kacem, S. Martin and I. M.Osman. "Unrelated Parallel Machine Scheduling Problem With precedence Constraints: Polyhedral Analysis and Branch-and-Cut". Combinatorial Optimization: 4th International Symposium, ISCO 2016, pp. 308-319. 2016.

28. * Y. Magnouche, A. R. Mahjoub and S. Martin. "The Multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price". 2016 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 683-688. 2016.

29. * M. Hassan, I. Kacem, S. Martin and I. M.Osman. "Valid Inequalities for Unrelated Parallel Machines Scheduling with Precedence Constraints". 2016 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 677-682. 2016.

30. * D. Cornaz, Y. Magnouche, A. R. Mahjoub and S. Martin. " The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut ". Proceedings of 45th International Conference on Computers \& Industrial Engineering (CIE45), ISBN:9781510817456 pp. 857-864. 2015.

31. * M. Hassan Abdel-Jabbar, I. Kacem, S. Martin and I. M. Osman. " Mathematical Formulations for the Unrelated Parallel Machines with Precedence Constraints ". Proceedings of 45th International Conference on Computers \& Industrial Engineering (CIE45), ISBN:9781510817456 pp. 1005-1012. 2015.

32. * P. Laroche, F. Marchetti, S. Martin, Z. Roka and M. Zheng. " Complexity and Heuristics for Multi Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment ". Proceedings of 45th International Conference on Computers & Industrial Engineering (CIE45), ISBN:9781510817456 pp. 1294-1301. 2015.

33. * A. Grange, I. Kacem, K. Laurent, S. Martin. " On the knapsack problem under merging objects' constrants ". Proceedings of 45th International Conference on Computers \& Industrial Engineering (CIE45), ISBN:9781510817456 pp. 1359-1366. 2015.

34. * P. Laroche, F. Marchetti, S. Martin et Z. Roka. " Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment ". IEEE International Conference Control, Decision and Information Technologies (CoDIT'14) pp. 182-187. 2014.

35. * D. Cornaz, F. Furini, M. Lacroix, E. Malaguti, A. R. Mahjoub et S. Martin. “Mathematical formulations for the Balanced Vertex k-Separator Problem”. IEEE International Conference Control, Decision and Information Technologies (CoDIT'14) pp. 176-181. 2014.

36. * M. A. Hassan Abdel-Jabbar, I. Kacem et S. Martin. " Unrelated parallel machines with precedence constraints: Application to cloud computing ". IEEE CLOUDNET 2014, pp. 438-442. 2014.

37. * M. Lacroix, A. R. Mahjoub et S. Martin. " Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem ". Lecture Notes on Computer Science (International Symposium of Combinatorial Optimization (ISCO) 2012), pp. 117–128. 2012.

38. * M. Lacroix, A. R. Mahjoub et S. Martin. " Structural analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets ". Proceedings ISCO 2010, Electronic Notes in Discrete Mathematics 36, pp. 1073-1080. 2010.

39. * M. Lacroix, A. R. Mahjoub et S. Martin. "Structural analysis in Differential-Algebraic Systems and Combinatorial Optimization". Proceedings of 39th International Conference on Computers \& Industrial Engineering (CIE39), pp. 331-337. 2009. (This publication won the Best Student Paper award)

40. P. Fouilhoux, S. Martin et M. Coupechoux "Combinatorial problems and integer formulations in wireless mesh network design". NCP07 (International Conference on Nonconvex Programming) (2007).

Patents

1. A system and method for a partial and dynamic distributed sketch assignment (2023). Sébastien Martin, Gabriele Castellano, Massimo Gallo,  Isma Bentoumi. WO2024256000A1

2. Apparatus and system for Nested Multi-Topology Routing (2023). Sébastien Martin, Youcef Magnouche, Jérémie Leguay,  Zeng Feng. WO2024245574A1

3. Apparatus for ensuring QoS requirements using distributed adaptive queue sizing (2022). Sébastien Martin, Antoine Fressancourt, Paolo Medagliani, Anne Bouillard, Ren Shoushou. WO2024187376A1

4. System and Method for Consistent Slices (2022). Sébastien Martin, Paolo Medagliani, Jérémie Leguay. WO2024170048A1.

5. Apparatus and system to augment path computation elements (2022). Sébastien Martin, Pierre Bauguion, Jérémie Leguay, Zeng Feng, Tang Ziye. WO2024108457A1

6. Apparatus and method for distributed load balancing in IP routing (2021). Sébastien Martin, Jérémie Leguay, Youcef Magnouche. WO2023147884A1.

7. Intent-based smart policy-routing (2021). Pham Tran Anh Quang, Sébastien Martin, Jérémie Leguay, GongXu, Zengfeng. EP4393207A1.

8. Apparatus and methods for delay-constrained redundant paths in IP routing (2021). CaiShengming, Jérémie Leguay, Sébastien Martin, Paolo Medagliani. WO2022214164A1.

9. Apparatus and methods for virtual topologies in IP routing (2020). Nicolas Huin, Jérémie Leguay, Sébastien Martin, CaiShengming. WO2022167068A1.

10. Fast Failover for Path Degradation (2020). Jérémie Leguay, Paolo Medagliani, Sébastien Martin, Antoine Fressancourt. WO2022199827A1.

11. Apparatus and Methods for Protected Load Balancing (2020). Sébastien Martin, Jérémie Leguay, Youcef Magnouche, Zhangjie, Liyuechen. WO2022052009A1.

12. Apparatus and Method for coflow tracking to schedule traffic (2020). Jérémie Leguay, Sébastien Martin, Rachid El-Azouzi, Francesco de Pellegrini, Youcef Magnouche, Cedric Richier. WO2022074415A1.

13. A system of policies to improve the resilience of deterministic networks with performance guarantee (2019). Paolo Medagliani, Sébastien Martin, Jérémie Leguay, Chenshuang. WO2021197617A1.

14. Control device, switch device and methods (2019). Paolo Medagliani, Sébastien Martin, Jérémie Leguay, Chenshuang. US20220150159A1/EP3981133A4.