Computational complexity of LCPs associated with positive definite symmetric matrices. - Yahya Fathi (Math. Program., 1979)

A critical index algorithm for nearest point problems on simplicial cones. - Katta G. Murty; Yahya Fathi (Math. Program., 1982)

Affirmative action algorithms. - Yahya Fathi; Craig A. Tovey (Math. Program., 1986)

SQVAM: A variance minimizing algorithm. - Yahya Fathi (Oper. Res. Lett., 1991)

Heuristic methods for gang-rip saw arbor design. - Yahya Fathi; Vural Aksakalli (Eur. J. Oper. Res., 2004)

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. - Bagas Wardono; Yahya Fathi (Eur. J. Oper. Res., 2004)

A Formal Model for the Problem of View Selection for Aggregate Queries. - Jingni Li; Zohreh Asgharzadeh Talebi; Rada Chirkova; Yahya Fathi (ADBIS, 2005)

Integer programming models for the q. - Girish Kulkarni; Yahya Fathi (Eur. J. Oper. Res., 2007)

View and index selection for query-performance improvement: quality-centered algorithms and heuristics. - Maxim Kormilitsin; Rada Chirkova; Yahya Fathi; Matthias F. Stallmann (CIKM, 2008)

Exact and inexact methods for selecting views and indexes for OLAP performance improvement. - Zohreh Asgharzadeh Talebi; Rada Chirkova; Yahya Fathi; Matthias F. Stallmann (EDBT, 2008)

Algorithms for the q-model clustering problem with application in switching cabinet manufacturing. - Shona D. Morgan; Yahya Fathi (Eur. J. Oper. Res., 2008)

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring. - Maxim Kormilitsin; Rada Chirkova; Yahya Fathi; Matthias F. Stallmann (ADBIS, 2009)

Exact and inexact methods for solving the problem of view selection for aggregate queries. - Zohreh Asgharzadeh Talebi; Rada Chirkova; Yahya Fathi (Int. J. Bus. Intell. Data Min., 2009)

Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. - Kiavash Kianfar; Yahya Fathi (Math. Program., 2009)

Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions. - Kiavash Kianfar; Yahya Fathi (Eur. J. Oper. Res., 2010)

An active index algorithm for the nearest point problem in a polyhedral cone. - Zhe Liu 009; Yahya Fathi (Comput. Optim. Appl., 2011)

Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms. - Rong Huang; Rada Chirkova; Yahya Fathi (ADBIS, 2012)

Two-Stage Stochastic View Selection for Data-Analysis Queries. - Rong Huang; Rada Chirkova; Yahya Fathi (ADBIS (2), 2012)

The nearest point problem in a polyhedral set and its extensions. - Zhe Liu 009; Yahya Fathi (Comput. Optim. Appl., 2012)

An integer programming approach for the view and index selection problem. - Zohreh Asgharzadeh Talebi; Rada Chirkova; Yahya Fathi (Data Knowl. Eng., 2013)

Determining Query Readiness for Structured Data. - Farid Alborzi; Rada Chirkova; Jon Doyle; Yahya Fathi (DaWaK, 2015)

p-Median and p-dispersion problems: A bi-criteria analysis. - Fatemeh Sayyady; Golbarg K. Tutunchi; Yahya Fathi (Comput. Oper. Res., 2015)

An integer programming approach for solving the p-dispersion problem. - Fatemeh Sayyady; Yahya Fathi (Eur. J. Oper. Res., 2016)

Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. - Golbarg K. Tutunchi; Yahya Fathi (Comput. Oper. Res., 2019)

Valid inequalities for concave piecewise linear regression. - Karthick Gopalswamy; Yahya Fathi; Reha Uzsoy (Oper. Res. Lett., 2019)

Representative subsets of non-dominated points in the bi-criteria p-median p-dispersion problem. - Golbarg K. Tutunchi; Yahya Fathi (Comput. Ind. Eng., 2020)

Set covering problem with conflict constraints. - Saeed Saffari; Yahya Fathi (Comput. Oper. Res., 2022)

Bi-criteria set covering problem with conflict constraints. - Saeed Saffari; Yahya Fathi (Comput. Ind. Eng., 2023)