The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Prabhu Manyem: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser
    Approximation Lower Bounds in Online LIB Bin Packing and Covering. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:663-674 [Journal]
  2. Prabhu Manyem
    Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes) [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  3. Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions [Citation Graph (, )][DBLP]


  4. Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate [Citation Graph (, )][DBLP]


  5. Existential Second Order Logic Expression With Horn First Order for Maximum Clique (Decision Version) [Citation Graph (, )][DBLP]


  6. Polynomial-Time Maximisation Classes: Syntactic Hierarchy. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002