A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs. - Farid Alizadeh (SODA, 1991)

Combinatorial Optimization with Semi-Definite Matrices. - Farid Alizadeh (IPCO, 1992)

Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. - Farid Alizadeh; Richard M. Karp; Lee Aaron Newberg; Deborah K. Weisser (Algorithmica, 1995)

Physical Mapping of Chromosomes Using Unique Probes. - Farid Alizadeh; Richard M. Karp; Deborah K. Weisser; Geoffrey Zweig (J. Comput. Biol., 1995)

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. - Farid Alizadeh (SIAM J. Optim., 1995)

Complementarity and nondegeneracy in semidefinite programming. - Farid Alizadeh; Jean-Pierre A. Haeberly; Michael L. Overton (Math. Program., 1997)

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results. - Farid Alizadeh; Jean-Pierre A. Haeberly; Michael L. Overton (SIAM J. Optim., 1998)

Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones. - S. H. Schmieta; Farid Alizadeh (Math. Oper. Res., 2001)

Second-order cone programming. - Farid Alizadeh; Donald Goldfarb (Math. Program., 2003)

Extension of primal-dual interior point algorithms to symmetric cones. - S. H. Schmieta; Farid Alizadeh (Math. Program., 2003)

The Q method for second order cone programming. - Yu Xia; Farid Alizadeh (Comput. Oper. Res., 2008)

Arrival Rate Approximation by Nonnegative Cubic Splines. - Farid Alizadeh; Jonathan Eckstein; Nilay Noyan; Gábor Rudolf (Oper. Res., 2008)

Multivariate arrival rate estimation using semidefinite programming. - Dávid Papp; Farid Alizadeh (WSC, 2011)

The Q Method for Symmetric Cone Programming. - Farid Alizadeh; Yu Xia (J. Optim. Theory Appl., 2011)

Bilinear optimality constraints for the cone of positive polynomials. - Gábor Rudolf; Nilay Noyan; Dávid Papp; Farid Alizadeh (Math. Program., 2011)

Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming. - Farid Alizadeh; Dávid Papp (Ann. Oper. Res., 2013)

Semidefinite Characterization of Sum-of-Squares Cones in Algebras. - Dávid Papp; Farid Alizadeh (SIAM J. Optim., 2013)

A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem. - Marta Cavaleiro; Farid Alizadeh (CoRR, 2017)

Preface: Special issue dedicated to Distance Geometry. - Farid Alizadeh; Douglas Soares Gonçalves; Nathan Krislock; Leo Liberti (J. Glob. Optim., 2018)

Preface. - Farid Alizadeh; Douglas Soares Gonçalves; Nathan Krislock; Leo Liberti (Discret. Appl. Math., 2019)

A dual simplex-type algorithm for the smallest enclosing ball of balls. - Marta Cavaleiro; Farid Alizadeh (Comput. Optim. Appl., 2021)

A branch-and-bound method for the minimum k-enclosing ball problem. - Marta Cavaleiro; Farid Alizadeh (Oper. Res. Lett., 2022)