| 2025 | CoDIT | Spatial Dantzig-Wolfe decomposition for multi-commodity flow problem. | Youcef Magnouche, Sbastien Martin |
| 2025 | CoDIT | Explainable optimized solution for the IGP weight design problem. | Sbastien Martin |
| 2024 | CoDIT | The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition. | Fan Zhang, Jiazheng Wang, Mathieu Lacroix, Roberto Wolfler Calvo, Youcef Magnouche, Sbastien Martin |
| 2024 | CoDIT | Alternative paths computation for congestion mitigation in segment-routing networks. | Sbastien Martin, Youcef Magnouche, Paolo Medagliani, Jrmie Leguay |
| 2024 | ICNP | Demo: Fast Routing-Loops Identification in Multi-Protocol Multi-Instance IP Networks. | Youcef Magnouche, Sbastien Martin, Jrmie Leguay, Mei Cong, Guofeng Qian |
| 2024 | INOC | In-Band Network Telemetry for Efficient Congestion Mitigation. | Youcef Magnouche, Sbastien Martin, Jeremie Leguay, Paolo Medagliani |
| 2024 | NOMS | Virtual Multi-Topology Routing for QoS Constraints. | Nicolas Huin, Sbastien Martin, Jrmie Leguay |
| 2023 | CoDIT | Unsplittable Shortest Path Routing: Extended Model and Matheuristic. | Amal Benhamiche, Morgan Chopin, Sbastien Martin |
| 2023 | CoDIT | A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. | Isma Bentoumi, Fabio Furini, Ali Ridha Mahjoub, Sbastien Martin |
| 2023 | CoDIT | The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. | Roland Grappe, Mathieu Lacroix, Sbastien Martin |
| 2023 | CoDIT | Unsplittable Multi-Commodity Flow Problem via Quantum Computing. | Miguel Pineda Martn, Sbastien Martin |
| 2023 | CoDIT | Optimal Admission Control in Damper-Based Networks: Branch-and-Price Algorithm. | Mohamed Yassine Naghmouchi, Shoushou Ren, Paolo Medagliani, Sbastien Martin, Jrmie Leguay |
| 2023 | CoDIT | The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm. | Jiachen Zhang, Youcef Magnouche, Sbastien Martin, Antoine Fressancourt, J. Christopher Beck |
| 2023 | NOMS | Protected load-balancing problem: Neural-network based approximation for non-convex optimization. | Youcef Magnouche, Sbastien Martin, Jrmie Leguay |
| 2022 | CNSM | Scalable Damper-based Deterministic Networking. | Mohamed Yassine Naghmouchi, Shoushou Ren, Paolo Medagliani, Sbastien Martin, Jrmie Leguay |
| 2022 | INFOCOM | Resource Defragmentation for Network Slicing. | Paolo Medagliani, Sbastien Martin, Jrmie Leguay, Shengming Cai, Feng Zeng, Nicolas Huin |
| 2022 | INOC | Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. | Youcef Magnouche, Sbastien Martin, Jrmie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cdric Richier |
| 2022 | KDD | Real-Time Rideshare Driver Supply Values Using Online Reinforcement Learning. | Benjamin Han, Hyungjun Lee, Sbastien Martin |
| 2021 | CNSM | Network Slicing for Deterministic Latency. | Sbastien Martin, Paolo Medagliani, Jeremie Leguay |
| 2021 | Networking | Network Slicing with Multi-Topology Routing. | Nicolas Huin, Sbastien Martin, Jrmie Leguay, Shengming Cai |
| 2021 | Networking | Towards Large-Scale Deterministic IP Networks. | Bingyang Liu, Shoushou Ren, Chuang Wang, Vincent Angilella, Paolo Medagliani, Sbastien Martin, Jeremie Leguay |
| 2021 | SIGCOMM | Intent-based policy optimization in SD-WAN. | Pham Tran Anh Quang, Sbastien Martin, Jrmie Leguay, Xu Gong, Feng Zeng |
| 2020 | CoDIT | Exact and Heuristic Solutions to the Connected k-Partitioning Problem. | Patrick Healy, Pierre Laroche, Franc Marchetti, Sbastien Martin, Zsuzsanna Rka |
| 2020 | Networking | Load Balancing for Deterministic Networks. | Shuang Chen, Jrmie Leguay, Sbastien Martin, Paolo Medagliani |
| 2019 | INFOCOM | Hard-isolation for Network Slicing. | Nicolas Huin, Paolo Medagliani, Sbastien Martin, Jrmie Leguay, Lei Shi, Shengming Cai, Jinchun Xu, Hao Shi |
| 2019 | INOC | Routing and Slot Allocation in 5G Hard Slicing. | Nicolas Huin, Jrmie Leguay, Sbastien Martin, Paolo Medagliani, Shengmin Cai |
| 2017 | CoDIT | Mathematical formulation for open shop scheduling problem. | Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sbastien Martin, Izzeldin M. Osman |
| 2017 | CoDIT | Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. | Pierre Laroche, Franc Marchetti, Sbastien Martin, Zsuzsanna Rka |
| 2016 | CoDIT | Valid inequalities for unrelated parallel machines scheduling with precedence constraints. | Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sbastien Martin, Izzeldin M. Osman |
| 2016 | CoDIT | The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price. | Youcef Magnouche, Ali Ridha Mahjoub, Sbastien Martin |
| 2016 | SMC | Optimization of tire noise by solving an Integer Linear Program (ILP). | Matthias Becker, Nicolas Ginoux, Sbastien Martin, Zsuzsanna Rka |
| 2014 | CoDIT | Mathematical formulations for the Balanced Vertex k-Separator Problem. | Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sbastien Martin |
| 2014 | CoDIT | Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. | Pierre Laroche, Franc Marchetti, Sbastien Martin, Zsuzsanna Rka |
| 2006 | ECCV | Fast Segmentation of the Mitral Valve Leaflet in Echocardiography. | Sbastien Martin, Vincent Daanen, Olivier Chavanon, Jocelyne Troccaz |