default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaola Alimonti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j5]Paola Alimonti, Esteban Feuerstein, Luigi Laura
, Umberto Nanni:
Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412(4-5): 320-338 (2011)
2000 – 2009
- 2000
- [j4]Paola Alimonti, Viggo Kann:
Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1-2): 123-134 (2000)
1990 – 1999
- 1997
- [c9]Paola Alimonti, Viggo Kann:
Hardness of Approximating Problems on Cubic Graphs. CIAC 1997: 288-298 - [c8]Paola Alimonti:
Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. WG 1997: 2-14 - 1996
- [j3]Paola Alimonti:
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. Inf. Process. Lett. 57(3): 151-158 (1996) - [j2]Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. RAIRO Theor. Informatics Appl. 30(4): 305-318 (1996) - [j1]Paola Alimonti, Paola Flocchini, Nicola Santoro:
Finding the Extrema of a Distributed Multiset. J. Parallel Distributed Comput. 37(2): 123-133 (1996) - [c7]Paola Alimonti, Tiziana Calamoneri:
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. WG 1996: 2-16 - 1995
- [c6]Paola Alimonti:
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems. WG 1995: 167-180 - 1994
- [c5]Paola Alimonti:
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. CIAC 1994: 40-53 - [c4]Paola Alimonti, Paola Flocchini, Nicola Santoro:
Finding the Extrema of a Distributed Multiset. WDAG 1994: 164-178 - 1993
- [c3]Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer:
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993: 87-98 - 1992
- [c2]Paola Alimonti, Esteban Feuerstein, Umberto Nanni:
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. LATIN 1992: 1-14 - [c1]Paola Alimonti, Esteban Feuerstein:
Petri Nets, Hypergraphs and Conflicts (Preliminary Version). WG 1992: 293-309
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 21:11 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:
