How Airlines and Airports Recover from Schedule Perturbations: A Survey. - Jerzy A. Filar; Prabhu Manyem; Kevin White 001 (Ann. Oper. Res., 2001)

Approximation Lower Bounds in Online LIB Bin Packing and Covering. - Prabhu Manyem; Rhonda L. Salt; Marc Simon Visser (J. Autom. Lang. Comb., 2003)

Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing. - Luke Finlay; Prabhu Manyem (RAIRO Oper. Res., 2005)

Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes) - Prabhu Manyem (CoRR, 2006)

Polynomial-Time Maximisation Classes: Syntactic Hierarchy. - Prabhu Manyem (Electron. Colloquium Comput. Complex., 2006)

Syntactic Characterizations of Polynomial Time Optimization Classes. - Prabhu Manyem (Chic. J. Theor. Comput. Sci., 2008)

Polynomial-TimeMaximisation Classes: Syntactic Hierarchy. - Orestes Bueno; Prabhu Manyem (Fundam. Informaticae, 2008)

Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions - Prabhu Manyem (CoRR, 2009)

Duality Gap, Computational Complexity and NP Completeness: A Survey - Prabhu Manyem (CoRR, 2010)

Nearly identical BFC expressions and identical OFC expressions for Matching and Clique - Prabhu Manyem (CoRR, 2011)

Computational Complexity, NP Completeness and Optimization Duality: A Survey. - Prabhu Manyem; Julien Ugon (Electron. Colloquium Comput. Complex., 2012)

Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique. - Prabhu Manyem (CoRR, 2014)

Disruption recovery at airports: Integer programming formulations and polynomial time algorithms. - Prabhu Manyem (Discret. Appl. Math., 2018)

Maximum independent set (stable set) problem: A mathematical programming model with valid inequalities and computational testing. - Prabhu Manyem (CoRR, 2022)