The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Daniele Pretolani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniele Pretolani
    Hypergraph Reductions and Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:383-397 [Conf]
  2. Kim Allan Andersen, Daniele Pretolani
    Easy Cases of Probabilistic Satisfiability. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2001, v:33, n:1, pp:69-91 [Journal]
  3. Daniele Pretolani
    Probability logic and optimization SAT: The PSAT and CPA models. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:211-221 [Journal]
  4. Daniele Pretolani
    Hierarchies of Polynomially Solvable Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:17, n:3-4, pp:339-357 [Journal]
  5. Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani
    Finding the K shortest hyperpaths. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1477-1497 [Journal]
  6. Alberto Caprara, Federico Malucelli, Daniele Pretolani
    On bandwidth-2 graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:1-13 [Journal]
  7. Giorgio Gallo, Daniele Pretolani
    A New Algorithm for the Propositional Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:159-179 [Journal]
  8. Federico Malucelli, Thomas Ottmann, Daniele Pretolani
    Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:2, pp:175-179 [Journal]
  9. Daniele Pretolani
    A Linear Time Algorithm for Unique Horn Satisfiability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:61-66 [Journal]
  10. Giorgio Gallo, Claudio Gentile, Daniele Pretolani, Gabriella Rago
    Max Horn SAT and the minimum cut problem in directed hypergraphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:213-237 [Journal]
  11. Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen
    Finding the K shortest hyperpaths using reoptimization. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:155-164 [Journal]

  12. The stack loading and unloading problem. [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002