default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Protasi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j17]Roberto Battiti
, Marco Protasi:
Reactive Local Search for the Maximum Clique Problem. Algorithmica 29(4): 610-637 (2001)
1990 – 1999
- 1999
- [b1]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann:
Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer 1999, ISBN 3540654313, pp. I-XIX, 1-524 - [j16]Roberto Battiti, Marco Protasi:
Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP). Discret. Appl. Math. 96-97: 3-27 (1999) - 1997
- [j15]Giorgio Gambosi, Marco Protasi, Maurizio Talamo:
Preserving Approximation in the Min-Weighted Set Cover Problem. Discret. Appl. Math. 73(1): 13-22 (1997) - [j14]Roberto Battiti, Marco Protasi:
Reactive Search, a History-Sensitive Heuristic for MAX-SAT. ACM J. Exp. Algorithmics 2: 2 (1997) - [c17]Paolo Frasconi, Marco Gori, Stefano Fanelli, Marco Protasi:
Suspiciousness of loading problems. ICNN 1997: 1240-1245 - [c16]Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi:
Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent. ICONIP (1) 1997: 531-534 - [c15]Roberto Battiti, Marco Protasi:
Reactive Local Search for Maximum Clique. WAE 1997: 74-83 - 1996
- [j13]M. Di Martino, Stefano Fanelli, Marco Protasi:
Exploring and comparing the best "direct methods" for the efficient training of MLP-networks. IEEE Trans. Neural Networks 7(6): 1497-1502 (1996) - [c14]Roberto Battiti, Marco Protasi:
Solving MAX-SAT with non-oblivious functions and history-based heuristics. Satisfiability Problem: Theory and Applications 1996: 649-667 - 1995
- [j12]Giorgio Ausiello, Marco Protasi:
Local Search, Reducibility and Approximability of NP-Optimization Problems. Inf. Process. Lett. 54(2): 73-79 (1995) - [j11]Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi:
Approximate Solution of NP Optimization Problems. Theor. Comput. Sci. 150(1): 1-55 (1995) - 1994
- [j10]Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi:
On Learning Monotone DNF Formulae under Uniform Distributions. Inf. Comput. 110(1): 84-95 (1994) - 1993
- [j9]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) - [j8]Michele Angelaccio, Marco Protasi:
Limiting Characterizations of Low Level Space Complexity Classes. RAIRO Theor. Informatics Appl. 27(3): 175-182 (1993) - [c13]S. Fanelli, M. Di Martino, Marco Protasi:
An efficient algorithm for the binary classification of patterns using MLP-networks. ICNN 1993: 936-943 - 1990
- [j7]Giorgio Ausiello, Marco Protasi:
Limiting Polynomial Approximation of Complexity Classes. Int. J. Found. Comput. Sci. 1(2): 111-122 (1990)
1980 – 1989
- 1989
- [j6]Marco Protasi, Maurizio Talamo:
On the Number of Arithmetical Operations for Finding Fibonacci Numbers. Theor. Comput. Sci. 64(1): 119-124 (1989) - [c12]Alberto Marchetti-Spaccamela, Marco Protasi:
Learning Under Uniform Distribution. FCT 1989: 327-338 - [c11]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 - 1988
- [c10]Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi:
On the Learnability of DNF Formulae. ICALP 1988: 347-361 - 1986
- [j5]Marco Protasi, Maurizio Talamo:
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs. RAIRO Theor. Informatics Appl. 20(3): 211-219 (1986) - [c9]Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo:
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. MFCS 1986: 501-511 - 1985
- [c8]Marco Protasi, Maurizio Talamo:
On the Maximum Size of Random Trees. TAPSOFT, Vol.1 1985: 139-144 - 1983
- [j4]Alberto Marchetti-Spaccamela, Marco Protasi:
The Largest Tree in a Random Graph. Theor. Comput. Sci. 23: 273-286 (1983) - [c7]Marco Protasi, Maurizio Talamo:
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. FCT 1983: 360-367 - [c6]Giorgio Ausiello, Marco Protasi, Maurizio Talamo:
Probabilistic Models for Database Schemes and Random Hypergraphs. WG 1983: 5-16 - [e1]Giorgio Ausiello, Marco Protasi:
CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings. Lecture Notes in Computer Science 159, Springer 1983, ISBN 3-540-12727-5 [contents] - 1981
- [j3]Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
Lattice theoretic ordering properties for NP-complete optimization problems. Fundam. Informaticae 4(1): 83-94 (1981) - [c5]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Full Approximatibility of a Class of Problems over Power Sets. CAAP 1981: 76-87 - [c4]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 - 1980
- [j2]Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
Structure Preserving Reductions among Convex Optimization Problems. J. Comput. Syst. Sci. 21(1): 136-153 (1980) - [j1]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)
1970 – 1979
- 1977
- [c3]Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
On the Structure of Combinatorial Problems and Structure Preserving Reductions. ICALP 1977: 45-60 - [c2]Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi:
Classes of Structurally Isomorphic {NP}-Optimization Problems. MFCS 1977: 222-230 - 1975
- [c1]Giorgio Ausiello, Marco Protasi:
On the Comparison of Notions of Approximation. MFCS 1975: 172-178
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
