Polyhedral methods for the maximum clique problem. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols; Gábor Pataki (Cliques, Coloring, and Satisfiability, 1993)

Cone-LP's and Semidefinite Programs: Geometry. - Gábor Pataki (IPCO, 1996)

Solving Integer and Disjunctive Programs by Lift and Project. - Sebastián Ceria; Gábor Pataki (IPCO, 1998)

On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues. - Gábor Pataki (Math. Oper. Res., 1998)

Octane: A New Heuristic for Pure 0-1 Programs. - Egon Balas; Sebastián Ceria; Milind Dawande; François Margot; Gábor Pataki (Oper. Res., 2001)

On the generic properties of convex optimization problems in conic form. - Gábor Pataki; Levent Tunçel (Math. Program., 2001)

Teaching Integer Programming Formulations Using the Traveling Salesman Problem. - Gábor Pataki (SIAM Rev., 2003)

Schlumberger Optimizes Receiver Location for Automated Meter Reading. - Srinagesh Gavirneni 001; Lloyd Clark; Gábor Pataki (Interfaces, 2004)

On the Closedness of the Linear Image of a Closed Convex Cone. - Gábor Pataki (Math. Oper. Res., 2007)

Branching proofs of infeasibility in low density subset sum problems - Gábor Pataki; Mustafa Kemal Tural (CoRR, 2008)

Basis Reduction, and the Complexity of Branch-and-Bound - Gábor Pataki; Mustafa Kemal Tural (CoRR, 2009)

Column basis reduction and decomposable knapsack problems. - Bala Krishnamoorthy; Gábor Pataki (Discret. Optim., 2009)

Basis Reduction and the Complexity of Brand-and-Bound. - Gábor Pataki; Mustafa Kemal Tural; Erick B. Wong (SODA, 2010)

Coordinate Shadows of Semidefinite and Euclidean Distance Matrices. - Dmitriy Drusvyatskiy; Gábor Pataki; Henry Wolkowicz (SIAM J. Optim., 2015)

Exact Duality in Semidefinite Programming Based on Elementary Reformulations. - Minghui Liu; Gábor Pataki (SIAM J. Optim., 2015)

Bad Semidefinite Programs: They All Look the Same. - Gábor Pataki (SIAM J. Optim., 2017)

Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming. - Minghui Liu; Gábor Pataki (Math. Program., 2018)

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs. - Yuzixuan Zhu; Gábor Pataki; Quoc Tran-Dinh (Math. Program. Comput., 2019)

Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs. - Gábor Pataki (SIAM Rev., 2019)

A simplified treatment of Ramana's exact dual for semidefinite programming. - Bruno F. Lourenço; Gábor Pataki (Optim. Lett., 2023)

How Do Exponential Size Solutions Arise in Semidefinite Programming? - Gábor Pataki; Aleksandr Touzov (SIAM J. Optim., 2024)

An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone. - Gábor Pataki; Aleksandr Touzov (Found. Comput. Math., 2024)