Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Prabhu Manyem
2010 – today
- 2012
[i8]Prabhu Manyem, Julien Ugon: Computational Complexity, NP Completeness and Optimization Duality: A Survey. Electronic Colloquium on Computational Complexity (ECCC) 19: 9 (2012)- 2011
- [i7]Prabhu Manyem: Nearly identical BFC expressions and identical OFC expressions for Matching and Clique. CoRR abs/1106.4606 (2011)
- 2010
- [i6]Prabhu Manyem: Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version). CoRR abs/1004.1814 (2010)
- [i5]Prabhu Manyem: Duality Gap, Computational Complexity and NP Completeness: A Survey. CoRR abs/1012.5568 (2010)
2000 – 2009
- 2009
- [e2]Rod Downey, Prabhu Manyem (Eds.): Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009. CRPIT 94, Australian Computer Society 2009, ISBN 978-1-920682-75-0
- [i4]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)
- [i3]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
- [j5]Prabhu Manyem: Syntactic Characterizations of Polynomial Time Optimization Classes. Chicago J. Theor. Comput. Sci. 2008 (2008)
- [j4]Orestes Bueno, Prabhu Manyem: Polynomial-TimeMaximisation Classes: Syntactic Hierarchy. Fundam. Inform. 84(1): 111-133 (2008)
- [e1]James Harland, Prabhu Manyem (Eds.): Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings. CRPIT 77, Australian Computer Society 2008, ISBN 978-1-920682-58-3
- 2006
- [i2]Prabhu Manyem: Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes). CoRR abs/cs/0606050 (2006)
- [i1]Prabhu Manyem: Polynomial-Time Maximisation Classes: Syntactic Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 13(082) (2006)
- 2005
- [j3]Luke Finlay, Prabhu Manyem: Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing. RAIRO - Operations Research 39(3): 163-183 (2005)
- 2003
- [j2]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
- [j1]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)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:02 CEST by the dblp team