default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiavash Kianfar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Haochen Luo
, Kiavash Kianfar:
Valid inequalities and facets for multi-module survivable network design problem. Networks 81(2): 155-176 (2023)- [c4]Michael Armbrust, Ali Ghodsi, Reynold Xin, Vuk Ercegovac, Sourav Chatterji, Eun-Gyu Kim, Paul Lappas, Yannis Papakonstantinou, Yingyi Bu, Yuhong Chen, Yijia Cui, Rahul Govind, Aakash Japi, Kiavash Kianfar, Xi Liang, Jon Mio, Mukul Murthy, Supun Nakandala, Andreas Neumann, Nitin Sharma, Yannis Sismanis, Justin Tang, Joseph Torres, Min Yang, Li Zhang, Bilal Aslam:
Making Data Engineering Declarative. CIDR 2023
2010 – 2019
- 2018
- [c3]Vishnu Vijayaraghavan, Kiavash Kianfar, Yu Ding, Hamid Parsaei:
A Mixed Integer Programming Based Recursive Variance Reduction Method for Reliability Evaluation of Linear Sensor Systems. CASE 2018: 836-842 - 2017
- [j12]Manish Bansal, Kiavash Kianfar:
Facets for continuous multi-mixing set with general coefficients and bounded integer variables. Discret. Optim. 26: 1-25 (2017) - [j11]Manish Bansal, Kiavash Kianfar:
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones. INFORMS J. Comput. 29(1): 152-169 (2017) - [c2]Vishnu Vijayaraghavan, Kiavash Kianfar, Yu Ding, Hamid Parsaei:
An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. CASE 2017: 424-428 - [i1]Kiavash Kianfar, Christopher Pockrandt, Bahman Torkamandi, Haochen Luo, Knut Reinert:
FAMOUS: Fast Approximate string Matching using OptimUm search Schemes. CoRR abs/1711.02035 (2017) - 2016
- [j10]Sujeevraja Sanjeevi, Sina Masihabadi, Kiavash Kianfar:
Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets. Math. Program. 159(1-2): 571-583 (2016) - 2015
- [j9]Manish Bansal, Kiavash Kianfar:
n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem. Math. Program. 154(1-2): 113-144 (2015) - 2014
- [c1]Manish Bansal, Kiavash Kianfar:
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem. IPCO 2014: 102-113 - 2013
- [j8]Manish Bansal, Kiavash Kianfar, Yu Ding, Erick Moreno-Centeno:
Hybridization of Bound-and-Decompose and Mixed Integer Feasibility Checking to Measure Redundancy in Structured Linear Systems. IEEE Trans Autom. Sci. Eng. 10(4): 1151-1157 (2013) - 2012
- [j7]Kiavash Kianfar:
On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets. Discret. Appl. Math. 160(10-11): 1567-1582 (2012) - [j6]Sujeevraja Sanjeevi, Kiavash Kianfar:
Mixed n-step MIR inequalities: Facets for the n-mixing set. Discret. Optim. 9(4): 216-235 (2012) - [j5]Alper Atamtürk, Kiavash Kianfar:
n-step mingling inequalities: new facets for the mixed-integer knapsack set. Math. Program. 132(1-2): 79-98 (2012) - 2011
- [j4]Kiavash Kianfar, Arash Pourhabib, Yu Ding:
An Integer Programming Approach for Analyzing the Measurement Redundancy in Structured Linear Systems. IEEE Trans Autom. Sci. Eng. 8(2): 447-450 (2011) - 2010
- [j3]Sujeevraja Sanjeevi, Kiavash Kianfar:
A polyhedral study of triplet formulation for single row facility layout problem. Discret. Appl. Math. 158(16): 1861-1867 (2010) - [j2]Kiavash Kianfar, Yahya Fathi:
Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions. Eur. J. Oper. Res. 207(1): 105-109 (2010)
2000 – 2009
- 2009
- [j1]Kiavash Kianfar, Yahya Fathi:
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Math. Program. 120(2): 313-346 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
