 | 2009 |
|---|
| 8 |       | Prabhu Manyem:
Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions
CoRR abs/0904.4331: (2009) |
| 7 | | Prabhu Manyem:
Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate
CoRR abs/0909.5521: (2009) |
| 2008 |
|---|
| 6 |  | James Harland,
Prabhu Manyem:
Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings
Australian Computer Society 2008 |
| 5 | | Orestes Bueno,
Prabhu Manyem:
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy.
Fundam. Inform. 84(1): 111-133 (2008) |
| 2006 |
|---|
| 4 | | Prabhu Manyem:
Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes)
CoRR abs/cs/0606050: (2006) |
| 3 | | Prabhu Manyem:
Polynomial-Time Maximisation Classes: Syntactic Hierarchy.
Electronic Colloquium on Computational Complexity (ECCC) 13(082): (2006) |
| 2003 |
|---|
| 2 | | Prabhu Manyem,
Rhonda L. Salt,
Marc Simon Visser:
Approximation Lower Bounds in Online LIB Bin Packing and Covering.
Journal of Automata, Languages and Combinatorics 8(4): 663-674 (2003) |
| 2001 |
|---|
| 1 | | Jerzy A. Filar,
Prabhu Manyem,
Kevin White:
How Airlines and Airports Recover from Schedule Perturbations: A Survey.
Annals OR 108(1-4): 315-333 (2001) |
