The SCEAS System
Navigation Menu

Search the dblp DataBase


Fabio Tardella: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella
    A general class of greedily solvable linear programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:385-399 [Conf]

  2. On the Complexity of Graph-Based Bounds for the Probability Bounding Problem. [Citation Graph (, )][DBLP]

  3. A clique algorithm for standard quadratic programming. [Citation Graph (, )][DBLP]

  4. On a class of functions attaining their maximum at the vertices of a polyhedron. [Citation Graph (, )][DBLP]

  5. On the complexity of some subgraph problems. [Citation Graph (, )][DBLP]

  6. Sublattices of product spaces: Hulls, representations and counting. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.001secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002