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

A polyhedral study of triplet formulation for single row facility layout problem. - Sujeevraja Sanjeevi; Kiavash Kianfar (Discret. Appl. Math., 2010)

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 Integer Programming Approach for Analyzing the Measurement Redundancy in Structured Linear Systems. - Kiavash Kianfar; Arash Pourhabib; Yu Ding 002 (IEEE Trans Autom. Sci. Eng., 2011)

On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets. - Kiavash Kianfar (Discret. Appl. Math., 2012)

Mixed n-step MIR inequalities: Facets for the n-mixing set. - Sujeevraja Sanjeevi; Kiavash Kianfar (Discret. Optim., 2012)

n-step mingling inequalities: new facets for the mixed-integer knapsack set. - Alper Atamtürk; Kiavash Kianfar (Math. Program., 2012)

Hybridization of Bound-and-Decompose and Mixed Integer Feasibility Checking to Measure Redundancy in Structured Linear Systems. - Manish Bansal; Kiavash Kianfar; Yu Ding 005; Erick Moreno-Centeno (IEEE Trans Autom. Sci. Eng., 2013)

n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem. - Manish Bansal; Kiavash Kianfar (IPCO, 2014)

n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem. - Manish Bansal; Kiavash Kianfar (Math. Program., 2015)

Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets. - Sujeevraja Sanjeevi; Sina Masihabadi; Kiavash Kianfar (Math. Program., 2016)

An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. - Vishnu Vijayaraghavan; Kiavash Kianfar; Yu Ding 005; Hamid Parsaei (CASE, 2017)

FAMOUS: Fast Approximate string Matching using OptimUm search Schemes. - Kiavash Kianfar; Christopher Pockrandt; Bahman Torkamandi; Haochen Luo; Knut Reinert (CoRR, 2017)

Facets for continuous multi-mixing set with general coefficients and bounded integer variables. - Manish Bansal; Kiavash Kianfar (Discret. Optim., 2017)

Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones. - Manish Bansal; Kiavash Kianfar (INFORMS J. Comput., 2017)

A Mixed Integer Programming Based Recursive Variance Reduction Method for Reliability Evaluation of Linear Sensor Systems. - Vishnu Vijayaraghavan; Kiavash Kianfar; Yu Ding 005; Hamid Parsaei (CASE, 2018)

Making Data Engineering Declarative. - Michael Armbrust; Ali Ghodsi 002; Reynold Xin; Vuk Ercegovac; Sourav Chatterji; Eun-Gyu Kim; Paul Lappas; Yannis Papakonstantinou; Yingyi Bu; Yuhong Chen; Yijia Cui; Rahul Govind; et al. (CIDR, 2023)

Valid inequalities and facets for multi-module survivable network design problem. - Haochen Luo; Kiavash Kianfar (Networks, 2023)