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