On the Comparison of Notions of Approximation. - Giorgio Ausiello; Marco Protasi (MFCS, 1975)

On the Structure of Combinatorial Problems and Structure Preserving Reductions. - Giorgio Ausiello; Alessandro D'Atri; Marco Protasi (ICALP, 1977)

Classes of Structurally Isomorphic {NP}-Optimization Problems. - Giorgio Ausiello; Alessandro D'Atri; Marco Gaudiano; Marco Protasi (MFCS, 1977)

Structure Preserving Reductions among Convex Optimization Problems. - Giorgio Ausiello; Alessandro D'Atri; Marco Protasi (J. Comput. Syst. Sci., 1980)

Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (Theor. Comput. Sci., 1980)

Full Approximatibility of a Class of Problems over Power Sets. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (CAAP, 1981)

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Marco Protasi (FCT, 1981)

Lattice theoretic ordering properties for NP-complete optimization problems. - Giorgio Ausiello; Alessandro D'Atri; Marco Protasi (Fundam. Informaticae, 1981)

A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. - Marco Protasi; Maurizio Talamo (FCT, 1983)

Probabilistic Models for Database Schemes and Random Hypergraphs. - Giorgio Ausiello; Marco Protasi; Maurizio Talamo (WG, 1983)

The Largest Tree in a Random Graph. - Alberto Marchetti-Spaccamela; Marco Protasi (Theor. Comput. Sci., 1983)

On the Maximum Size of Random Trees. - Marco Protasi; Maurizio Talamo (TAPSOFT, Vol.1, 1985)

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. - Ludek Kucera; Alberto Marchetti-Spaccamela; Marco Protasi; Maurizio Talamo (MFCS, 1986)

A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs. - Marco Protasi; Maurizio Talamo (RAIRO Theor. Informatics Appl., 1986)

On the Learnability of DNF Formulae. - Ludek Kucera; Alberto Marchetti-Spaccamela; Marco Protasi (ICALP, 1988)

Learning Under Uniform Distribution. - Alberto Marchetti-Spaccamela; Marco Protasi (FCT, 1989)

An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests. - Giorgio Gambosi; Marco Protasi; Maurizio Talamo (FSTTCS, 1989)

On the Number of Arithmetical Operations for Finding Fibonacci Numbers. - Marco Protasi; Maurizio Talamo (Theor. Comput. Sci., 1989)

Limiting Polynomial Approximation of Complexity Classes. - Giorgio Ausiello; Marco Protasi (Int. J. Found. Comput. Sci., 1990)

An efficient algorithm for the binary classification of patterns using MLP-networks. - S. Fanelli; M. Di Martino; Marco Protasi (ICNN, 1993)

An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets. - Giorgio Gambosi; Marco Protasi; Maurizio Talamo (BIT, 1993)

Limiting Characterizations of Low Level Space Complexity Classes. - Michele Angelaccio; Marco Protasi (RAIRO Theor. Informatics Appl., 1993)

On Learning Monotone DNF Formulae under Uniform Distributions - Ludek Kucera; Alberto Marchetti-Spaccamela; Marco Protasi (Inf. Comput., 1994)

Local Search, Reducibility and Approximability of NP-Optimization Problems. - Giorgio Ausiello; Marco Protasi (Inf. Process. Lett., 1995)

Approximate Solution of NP Optimization Problems. - Giorgio Ausiello; Pierluigi Crescenzi; Marco Protasi (Theor. Comput. Sci., 1995)

Solving MAX-SAT with non-oblivious functions and history-based heuristics. - Roberto Battiti; Marco Protasi (Satisfiability Problem: Theory and Applications, 1996)

Exploring and comparing the best "direct methods" for the efficient training of MLP-networks. - M. Di Martino; Stefano Fanelli; Marco Protasi (IEEE Trans. Neural Networks, 1996)

Suspiciousness of loading problems. - Paolo Frasconi; Marco Gori; Stefano Fanelli; Marco Protasi (ICNN, 1997)

Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent. - Monica Bianchini; Stefano Fanelli; Marco Gori; Marco Protasi (ICONIP (1), 1997)

Reactive Local Search for Maximum Clique. - Roberto Battiti; Marco Protasi (WAE, 1997)

Preserving Approximation in the Min-Weighted Set Cover Problem. - Giorgio Gambosi; Marco Protasi; Maurizio Talamo (Discret. Appl. Math., 1997)

Reactive Search, a History-Sensitive Heuristic for MAX-SAT. - Roberto Battiti; Marco Protasi (ACM J. Exp. Algorithmics, 1997)

Complexity and approximation: combinatorial optimization problems and their approximability properties. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Pierluigi Crescenzi; Giorgio Gambosi; Marco Protasi; Viggo Kann (Springer, 1999)

Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP). - Roberto Battiti; Marco Protasi (Discret. Appl. Math., 1999)

Reactive Local Search for the Maximum Clique Problem. - Roberto Battiti; Marco Protasi (Algorithmica, 2001)