Prabhu Manyem
Orcid: 0000-0003-3911-4366
According to our database1,
Prabhu Manyem
authored at least 14 papers
between 2001 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
Maximum independent set (stable set) problem: A mathematical programming model with valid inequalities and computational testing.
CoRR, 2022
2018
Disruption recovery at airports: Integer programming formulations and polynomial time algorithms.
Discret. Appl. Math., 2018
2014
Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique.
CoRR, 2014
2012
Electron. Colloquium Comput. Complex., 2012
2011
Nearly identical BFC expressions and identical OFC expressions for Matching and Clique
CoRR, 2011
2010
2009
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions
CoRR, 2009
2008
Chic. J. Theor. Comput. Sci., 2008
2006
Electron. Colloquium Comput. Complex., 2006
Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes)
CoRR, 2006
2005
RAIRO Oper. Res., 2005
2003
J. Autom. Lang. Comb., 2003
2001
Ann. Oper. Res., 2001