Search the dblp DataBase
Daniele Pretolani :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Daniele Pretolani Hypergraph Reductions and Satisfiability Problems. [Citation Graph (0, 0)][DBLP ] SAT, 2003, pp:383-397 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] The stack loading and unloading problem. [Citation Graph (, )][DBLP ] Search in 0.011secs, Finished in 0.012secs