- Svatopluk Poljak, Ji?� Rohn, “Checking robust nonsingularity is NP-hard”, Math. Control Signal Systems, 6, № 1, 1993, 1
- Markus Chimani, Martina Juhnke-Kubitzke, Alexander Nover, “On the bond polytope”, Advances in Geometry, 23, № 4, 2023, 461
- Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos, “Generalised 2-circulant inequalities for the max-cut problem”, Operations Research Letters, 50, № 2, 2022, 122
- Serigne Gueye, Philippe Michelon, ““Miniaturized” Linearizations for Quadratic 0/1 Problems”, Ann Oper Res, 140, № 1, 2005, 235
- Michel Deza, Monique Laurent, “The even and odd cut polytopes”, Discrete Mathematics, 119, № 1-3, 1993, 49
- M. Deza, V. P. Grishukhin, M. Laurent, “The hypermetric cone is polyhedral”, Combinatorica, 13, № 4, 1993, 397
- David Avis, Hiroshi Imai, Tsuyoshi Ito, “Generating facets for the cut polytope of a graph by triangular elimination”, Math. Program., 112, № 2, 2007, 303
- Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2013, 131
- Michel Deza, Komei Fukuda, Monique Laurent, “The inequicut cone”, Discrete Mathematics, 119, № 1-3, 1993, 21
- Luis Goddyn, Tony Huynh, Tanmay Deshpande, “On Hilbert bases of cuts”, Discrete Mathematics, 339, № 2, 2016, 721