| 2001 |
|---|
| 28 | EE | Roberto Battiti,
Marco Protasi:
Reactive Local Search for the Maximum Clique Problem.
Algorithmica 29(4): 610-637 (2001) |
| 1999 |
|---|
| 27 | EE | Roberto Battiti,
Marco Protasi:
Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP).
Discrete Applied Mathematics 96-97: 3-27 (1999) |
| 1997 |
|---|
| 26 | EE | Roberto Battiti,
Marco Protasi:
Reactive Search, a History-Sensitive Heuristic for MAX-SAT.
ACM Journal of Experimental Algorithmics 2: 2 (1997) |
| 25 | EE | Giorgio Gambosi,
Marco Protasi,
Maurizio Talamo:
Preserving Approximation in the Min-Weighted Set Cover Problem.
Discrete Applied Mathematics 73(1): 13-22 (1997) |
| 1995 |
|---|
| 24 | EE | Giorgio Ausiello,
Marco Protasi:
Local Search, Reducibility and Approximability of NP-Optimization Problems.
Inf. Process. Lett. 54(2): 73-79 (1995) |
| 23 | EE | Giorgio Ausiello,
Pierluigi Crescenzi,
Marco Protasi:
Approximate Solution of NP Optimization Problems.
Theor. Comput. Sci. 150(1): 1-55 (1995) |
| 1994 |
|---|
| 22 | | Ludek Kucera,
Alberto Marchetti-Spaccamela,
Marco Protasi:
On Learning Monotone DNF Formulae under Uniform Distributions
Inf. Comput. 110(1): 84-95 (1994) |
| 1993 |
|---|
| 21 | | Giorgio Gambosi,
Marco Protasi,
Maurizio Talamo:
An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets.
BIT 33(1): 29-45 (1993) |
| 20 | | Michele Angelaccio,
Marco Protasi:
Limiting Characterizations of Low Level Space Complexity Classes.
ITA 27(3): 175-182 (1993) |
| 1990 |
|---|
| 19 | | Giorgio Ausiello,
Marco Protasi:
Limiting Polynomial Approximation of Complexity Classes.
Int. J. Found. Comput. Sci. 1(2): 111-122 (1990) |
| 1989 |
|---|
| 18 | | Alberto Marchetti-Spaccamela,
Marco Protasi:
Learning Under Uniform Distribution.
FCT 1989: 327-338 |
| 17 | | Giorgio Gambosi,
Marco Protasi,
Maurizio Talamo:
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests.
FSTTCS 1989: 252-266 |
| 16 | | Marco Protasi,
Maurizio Talamo:
On the Number of Arithmetical Operations for Finding Fibonacci Numbers.
Theor. Comput. Sci. 64(1): 119-124 (1989) |
| 1988 |
|---|
| 15 | | Ludek Kucera,
Alberto Marchetti-Spaccamela,
Marco Protasi:
On the Learnability of DNF Formulae.
ICALP 1988: 347-361 |
| 1986 |
|---|
| 14 | | Ludek Kucera,
Alberto Marchetti-Spaccamela,
Marco Protasi,
Maurizio Talamo:
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
MFCS 1986: 501-511 |
| 13 | | Marco Protasi,
Maurizio Talamo:
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs.
ITA 20(3): 211-219 (1986) |
| 1985 |
|---|
| 12 | | Marco Protasi,
Maurizio Talamo:
On the Maximum Size of Random Trees.
TAPSOFT, Vol.1 1985: 139-144 |
| 1983 |
|---|
| 11 | | Giorgio Ausiello,
Marco Protasi:
CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings
Springer 1983 |
| 10 | | Marco Protasi,
Maurizio Talamo:
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems.
FCT 1983: 360-367 |
| 9 | | Alberto Marchetti-Spaccamela,
Marco Protasi:
The Largest Tree in a Random Graph.
Theor. Comput. Sci. 23: 273-286 (1983) |
| 1981 |
|---|
| 8 | | Giorgio Ausiello,
Alberto Marchetti-Spaccamela,
Marco Protasi:
Full Approximatibility of a Class of Problems over Power Sets.
CAAP 1981: 76-87 |
| 7 | | Giorgio Ausiello,
Alberto Marchetti-Spaccamela,
Marco Protasi:
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.
FCT 1981: 24-33 |
| 6 | | Giorgio Ausiello,
Alessandro D'Atri,
Marco Protasi:
Lattice theoretic ordering properties for NP-complete optimization problems.
Fundam. Inform. 4(1): 83-94 (1981) |
| 1980 |
|---|
| 5 | | Giorgio Ausiello,
Alessandro D'Atri,
Marco Protasi:
Structure Preserving Reductions among Convex Optimization Problems.
J. Comput. Syst. Sci. 21(1): 136-153 (1980) |
| 4 | | Giorgio Ausiello,
Alberto Marchetti-Spaccamela,
Marco Protasi:
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.
Theor. Comput. Sci. 12: 83-96 (1980) |
| 1977 |
|---|
| 3 | | Giorgio Ausiello,
Alessandro D'Atri,
Marco Protasi:
On the Structure of Combinatorial Problems and Structure Preserving Reductions.
ICALP 1977: 45-60 |
| 2 | | Giorgio Ausiello,
Alessandro D'Atri,
Marco Gaudiano,
Marco Protasi:
Classes of Structurally Isomorphic {NP}-Optimization Problems.
MFCS 1977: 222-230 |
| 1975 |
|---|
| 1 | | Giorgio Ausiello,
Marco Protasi:
On the Comparison of Notions of Approximation.
MFCS 1975: 172-178 |
