Fast Segmentation of the Mitral Valve Leaflet in Echocardiography. - Sébastien Martin; Vincent Daanen; Olivier Chavanon; Jocelyne Troccaz (CVAMIA, 2006)

Tracking of the mitral valve leaflet in echocardiography images. - Sébastien Martin; Vincent Daanen; Jocelyne Troccaz; Olivier Chavanon (ISBI, 2006)

Atlas-based prostate segmentation using an hybrid registration. - Sébastien Martin; Vincent Daanen; Jocelyne Troccaz (Int. J. Comput. Assist. Radiol. Surg., 2008)

Utilisation d'atlas anatomiques et de modèles déformables pour la segmentation de la prostate en IRM. (Segmentation of Prostate MRI using Probabilistic Atlas and Deformable Model). - Sébastien Martin (2008)

MR prior based automatic segmentation of the prostate in TRUS images for MR/TRUS data fusion. - Sébastien Martin; Michael Baumann 001; Vincent Daanen; Jocelyne Troccaz (ISBI, 2010)

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin (Electron. Notes Discret. Math., 2010)

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin (Comput. Ind. Eng., 2011)

Prosper: image and robot-guided prostate brachytherapy - Michael Baumann 001; Michel Bolla; Vincent Daanen; Jean-Luc Descotes; Jean-Yves Giraud; Nikolai Hungr; Antoine Leroy; Jean-Alexandre Long; Sébastien Martin; Jocelyne Troccaz (CoRR, 2011)

A low-noise 15-μm pixel-pitch 640×512 hybrid InGaAs image sensor for night vision. - Fabrice Guellec; Sébastien Dubois; Eric de Borniol; Pierre Castelein; Sébastien Martin; Romain Guiguet; Michaël Tchagaspanian; Anne Rouvié; Philippe Bois (Sensors, Cameras, and Systems for Industrial and Scientific Applications, 2012)

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin (ISCO, 2012)

Rigorous Derivation of the Thin Film Approximation with Roughness-Induced Correctors. - Laurent Chupin; Sébastien Martin (SIAM J. Math. Anal., 2012)

On the NP-completeness of the perfect matching free subgraph problem. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin; Christophe Picouleau (Theor. Comput. Sci., 2012)

1-5 Stars: Metadata on the Openness Level of Open Data Sets in Europe. - Sébastien Martin; Muriel Foulonneau; Slim Turki (MTSR, 2013)

Unrelated parallel machines with precedence constraints: application to cloud computing. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin (CloudNet, 2014)

Mathematical formulations for the Balanced Vertex k-Separator Problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2014)

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2014)

How Open Data Are Turned into Services? - Muriel Foulonneau; Sébastien Martin; Slim Turki (IESS, 2014)

Valid inequalities for unrelated parallel machines scheduling with precedence constraints. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (CoDIT, 2016)

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

Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (ISCO, 2016)

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

Optimization of tire noise by solving an Integer Linear Program (ILP). - Matthias Becker 002; Nicolas Ginoux; Sébastien Martin; Zsuzsanna Róka (SMC, 2016)

Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items. - Aristide Grange; Imed Kacem; Sébastien Martin (CoRR, 2016)

Mathematical formulation for open shop scheduling problem. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (CoDIT, 2017)

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2017)

Open Data Ecosystems - Introducing the Stimulator Function. - Sébastien Martin; Slim Turki; Samuel Renault (EGOVIS, 2017)

A 128x128, 34μm pitch, 8.9mW, 190mK NETD, TECless Uncooled IR bolometer image sensor with column-wise processing. - Laurent Alacoque; Sébastien Martin; Wilfried Rabaud; Edith Beigné; Antoine Dupret; Bertrand Dupont (IMSE, 2017)

A 5 Million Frames Per Second 3D Stacked Image Sensor With In-Pixel Digital Storage. - Laurent Millet; Margaux Vigier; Gilles Sicard; Wilfried Uhring; Nils Margotat; Fabrice Guellec; Sébastien Martin (ESSCIRC, 2018)

BE-GOOD: open data for a smarter society. - Slim Turki; Sébastien Martin; Samuel Renault (ICEGOV, 2018)

Algorithms for the bin packing problem with overlapping items. - Aristide Grange; Imed Kacem; Sébastien Martin (Comput. Ind. Eng., 2018)

Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach. - Matthias Becker 002; Nicolas Ginoux; Sébastien Martin; Zsuzsanna Róka (CoRR, 2018)

ILP Models and Column Generation for the Minimum Sum Coloring Problem. - Fabio Furini; Enrico Malaguti; Sébastien Martin; Ian-Christopher Ternier (Electron. Notes Discret. Math., 2018)

On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (J. Comb. Optim., 2018)

Local error analysis for the Stokes equations with a punctual source term. - Silvia Bertoluzza; Astrid Decoene; Loïc Lacouture; Sébastien Martin (Numerische Mathematik, 2018)

Hard-isolation for Network Slicing. - Nicolas Huin; Paolo Medagliani; Sébastien Martin; Jérémie Leguay; Lei Shi; Shengming Cai; Jinchun Xu; Hao Shi (INFOCOM Workshops, 2019)

Routing and Slot Allocation in 5G Hard Slicing. - Nicolas Huin; Jérémie Leguay; Sébastien Martin; Paolo Medagliani; Shengmin Cai (INOC, 2019)

The Price of Interpretability. - Dimitris Bertsimas; Arthur Delarue; Patrick Jaillet; Sébastien Martin (CoRR, 2019)

Optimal Explanations of Linear Models. - Dimitris Bertsimas; Arthur Delarue; Patrick Jaillet; Sébastien Martin (CoRR, 2019)

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)

The vertex k-cut problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (Discret. Optim., 2019)

The maximum clique interdiction problem. - Fabio Furini; Ivana Ljubic; Sébastien Martin; Pablo San Segundo (Eur. J. Oper. Res., 2019)

Travel Time Estimation in the Age of Big Data. - Dimitris Bertsimas; Arthur Delarue; Patrick Jaillet; Sébastien Martin (Oper. Res., 2019)

Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications. - Dimitris Bertsimas; Patrick Jaillet; Sébastien Martin (Oper. Res., 2019)

Optimizing schools' start time and bus routes. - Dimitris Bertsimas; Arthur Delarue; Sébastien Martin (Proc. Natl. Acad. Sci. USA, 2019)

Exact and Heuristic Solutions to the Connected k-Partitioning Problem. - Patrick Healy; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2020)

Load Balancing for Deterministic Networks. - Shuang Chen; Jérémie Leguay; Sébastien Martin; Paolo Medagliani (Networking, 2020)

A 3.0μW@5fps QQVGA Self-Controlled Wake-Up Imager with On-Chip Motion Detection, Auto-Exposure and Object Recognition. - Arnaud Verdant; William Guicquero; Nicolas Royer; Guillaume Moritz; Sébastien Martin; Florent Lepin; Sylvain Choisnet; Fabrice Guellec; Benoît Deschamps; Sylvain Clerc; Jérôme Chossat (VLSI Circuits, 2020)

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Anass Nagih; Zsuzsanna Róka (Discret. Optim., 2020)

Bus Routing Optimization Helps Boston Public Schools Design Better Policies. - Dimitris Bertsimas; Arthur Delarue; William Eger; John Hanlon; Sébastien Martin (INFORMS J. Appl. Anal., 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)

Network Slicing for Deterministic Latency. - Sébastien Martin; Paolo Medagliani; Jeremie Leguay (CNSM, 2021)

Approximate solutions for a special pagination problem with 2 symbols per tile. - Aristide Grange; Imed Kacem; Sébastien Martin; Sarah Minich (ICNSC, 2021)

Network Slicing with Multi-Topology Routing. - Nicolas Huin; Sébastien Martin; Jérémie Leguay; Shengming Cai (Networking, 2021)

Towards Large-Scale Deterministic IP Networks. - Bingyang Liu; Shoushou Ren; Chuang Wang 012; Vincent Angilella; Paolo Medagliani; Sébastien Martin; Jeremie Leguay (Networking, 2021)

Intent-based policy optimization in SD-WAN. - Pham Tran Anh Quang; Sébastien Martin; Jérémie Leguay; Xu Gong; Feng Zeng (SIGCOMM Posters and Demos, 2021)

Joint routing and scheduling for large-scale deterministic IP networks. - Jonatan Krolikowski; Sébastien Martin; Paolo Medagliani; Jérémie Leguay; Shuang Chen; Xiaodong Chang; Xuesong Geng (Comput. Commun., 2021)

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

Tire noise optimization problem: a mixed integer linear programming approach. - Matthias Becker 002; Nicolas Ginoux; Sébastien Martin; Zsuzsanna Róka (RAIRO Oper. Res., 2021)

Scalable Damper-based Deterministic Networking. - Mohamed Yassine Naghmouchi; Shoushou Ren; Paolo Medagliani; Sébastien Martin; Jérémie Leguay (CNSM, 2022)

Intent-Based Routing Policy Optimization in SD-WAN. - Pham Tran Anh Quang; Sébastien Martin; Jérémie Leguay; Xu Gong; Huiying Xu (ICC, 2022)

Resource Defragmentation for Network Slicing. - Paolo Medagliani; Sébastien Martin; Jérémie Leguay; Shengming Cai; Feng Zeng; Nicolas Huin (INFOCOM Workshops, 2022)

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)

Real-Time Rideshare Driver Supply Values Using Online Reinforcement Learning. - Benjamin Han; Hyungjun Lee; Sébastien Martin (KDD, 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)

A Feasibility Study on Real-Time High Resolution Imaging of the Brain Using Electrical Impedance Tomography. - Sébastien Martin (CoRR, 2022)

A Post-Processing Tool and Feasibility Study for Three-Dimensional Imaging with Electrical Impedance Tomography During Deep Brain Stimulation Surgery. - Sébastien Martin (CoRR, 2022)

Solving the Ride-Sharing Productivity Paradox: Priority Dispatch and Optimal Priority Sets. - Varun Krishnan; Ramón Iglesias; Sébastien Martin; Su Wang; Varun Pattabhiraman; Garrett J. van Ryzin (INFORMS J. Appl. Anal., 2022)

High Capacity and Resilient Large-Scale Deterministic IP Networks. - Vincent Angilella; Filip Krasniqi; Paolo Medagliani; Sébastien Martin; Jérémie Leguay; Shoushou Ren; Xuan Liu (J. Netw. Syst. Manag., 2022)

Unsplittable Shortest Path Routing: Extended Model and Matheuristic. - Amal Benhamiche; Morgan Chopin; Sébastien Martin (CoDIT, 2023)

A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. - Isma Bentoumi; Fabio Furini; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2023)

The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. - Roland Grappe; Mathieu Lacroix 001; Sébastien Martin (CoDIT, 2023)

Unsplittable Multi-Commodity Flow Problem via Quantum Computing. - Miguel Pineda Martín; Sébastien Martin (CoDIT, 2023)

Optimal Admission Control in Damper-Based Networks: Branch-and-Price Algorithm. - Mohamed Yassine Naghmouchi; Shoushou Ren; Paolo Medagliani; Sébastien Martin; Jérémie Leguay (CoDIT, 2023)

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)

A Distributed Congestion Mitigation Mechanism Based on Neighboring Nodes Traffic Steering. - Lirong Bai; Liang Zhang; Geng Zhang; Lin Zhang; Paolo Medagliani; Sébastien Martin (NoF, 2023)

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

Routing and slot allocation in 5G hard slicing. - Nicolas Huin; Jérémie Leguay; Sébastien Martin; Paolo Medagliani (Comput. Commun., 2023)

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. - Aristide Grange; Imed Kacem; Sébastien Martin; Sarah Minich (RAIRO Oper. Res., 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)

Virtual Multi-Topology Routing for QoS Constraints. - Nicolas Huin; Sébastien Martin; Jérémie Leguay (NOMS, 2024)

Human-AI Interactions and Societal Pitfalls. - Francisco Castro; Jian Gao; Sébastien Martin (EC, 2024)

Algorithmic Precision and Human Decision: A Study of Interactive Optimization for School Schedules. - Arthur Delarue; Zhen Lian; Sébastien Martin (EC, 2024)

Contribution to Blocker and Interdiction optimization problems in networks. - Sébastien Martin (CoRR, 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)

A Better Match for Drivers and Riders: Reinforcement Learning at Lyft. - Xabi Azagirre; Akshay Balwally; Guillaume Candeli; Nicholas Chamandy; Benjamin Han; Alona King; Hyungjun Lee; Martin Loncaric; Sébastien Martin; Vijay Narasiman; Zhiwei (Tony) Qin; Baptiste Richard; et al. (INFORMS J. Appl. Anal., 2024)

Frontiers in Operations: Employees vs. Contractors: An Operational Perspective. - Ilan Lobel; Sébastien Martin; Haotian Song (Manuf. Serv. Oper. Manag., 2024)

A branch-and-cut algorithm for the connected max-k-cut problem. - Patrick Healy; Nicolas Jozefowiez; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (Eur. J. Oper. Res., 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)

Relative Monte Carlo for Reinforcement Learning. - Audrey Bazerghi; Sébastien Martin; Garrett J. van Ryzin (EC, 2025)

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)

Integer linear programming formulations for the maximum flow blocker problem. - Isma Bentoumi; Fabio Furini; Ali Ridha Mahjoub; Sébastien Martin (Eur. J. Oper. Res., 2025)

Detours in Shared Rides. - Ilan Lobel; Sébastien Martin (Manag. Sci., 2025)

Trading Flexibility for Adoption: From Dynamic to Static Walking in Ride-Sharing. - Julia Yan; Sébastien Martin; Sean J. Taylor (Manag. Sci., 2025)

Pricing filtering in Dantzig-Wolfe decomposition. - Abdellah Bulaich Mehamdi; Mathieu Lacroix 001; Sébastien Martin (Oper. Res. Lett., 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)

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