Prabhu Manyem

16 papers Journal 14
YearRankTypeTitle / Venue / Authors
2022 J jnl
Maximum independent set (stable set) problem: A mathematical programming model with valid inequalities and computational testing.
CoRR
Prabhu Manyem
2018 J jnl
Disruption recovery at airports: Integer programming formulations and polynomial time algorithms.
Discret. Appl. Math.
Prabhu Manyem
2014 J jnl
Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique.
CoRR
Prabhu Manyem
2012 J jnl
Computational Complexity, NP Completeness and Optimization Duality: A Survey.
Electron. Colloquium Comput. Complex.
Prabhu Manyem, Julien Ugon
2011 J jnl
Nearly identical BFC expressions and identical OFC expressions for Matching and Clique
CoRR
Prabhu Manyem
2010 J jnl
Duality Gap, Computational Complexity and NP Completeness: A Survey
CoRR
Prabhu Manyem
2009 J jnl
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions
CoRR
Prabhu Manyem
2009 — ed.
Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009
CATS
Rod Downey, Prabhu Manyem
2008 J jnl
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy.
Fundam. Informaticae
Orestes Bueno, Prabhu Manyem
2008 J jnl
Syntactic Characterizations of Polynomial Time Optimization Classes.
Chic. J. Theor. Comput. Sci.
Prabhu Manyem
2008 — ed.
Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings
CATS
James Harland, Prabhu Manyem
2006 J jnl
Polynomial-Time Maximisation Classes: Syntactic Hierarchy.
Electron. Colloquium Comput. Complex.
Prabhu Manyem
2006 J jnl
Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes)
CoRR
Prabhu Manyem
2005 J jnl
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing.
RAIRO Oper. Res.
Luke Finlay, Prabhu Manyem
2003 J jnl
Approximation Lower Bounds in Online LIB Bin Packing and Covering.
J. Autom. Lang. Comb.
Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser
2001 J jnl
How Airlines and Airports Recover from Schedule Perturbations: A Survey.
Ann. Oper. Res.
Jerzy A. Filar, Prabhu Manyem, Kevin White