- Monique Laurent, “The real positive semidefinite completion problem for series-parallel graphs”, Linear Algebra and its Applications, 252, no. 1-3, 1997, 347
- Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange, “A polyhedral study of lifted multicuts”, Discrete Optimization, 47, 2023, 100757
- Michael M. Sørensen, “A Note on Clique-Web Facets for Multicut Polytopes”, Mathematics of OR, 27, no. 4, 2002, 740
- Michel Deza, Komei Fukuda, Monique Laurent, “The inequicut cone”, Discrete Mathematics, 119, no. 1-3, 1993, 21
- Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, no. 2, 1994, 191
- Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2013, 131
- John E. Mitchell, Panos M. Pardalos, Mauricio G. C. Resende, Handbook of Combinatorial Optimization, 1998, 189
- Michel Deza, Monique Laurent, “The even and odd cut polytopes”, Discrete Mathematics, 119, no. 1-3, 1993, 49
- Michael M. Sørensen, “Facet-defining inequalities for the simple graph partitioning polytope”, Discrete Optimization, 4, no. 2, 2007, 221
- Endre Boros, Peter L. Hammer, “Pseudo-Boolean optimization”, Discrete Applied Mathematics, 123, no. 1-3, 2002, 155