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

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

Exact and Heuristic Solutions to the Connected k-Partitioning Problem. - Patrick Healy; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 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)

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)