Paola Alimonti

14 papers B 6C 2Journal 5Unranked 1
YearRankTypeTitle / Venue / Authors
2011 J jnl
Linear time analysis of properties of conflict-free and general Petri nets.
Theor. Comput. Sci.
Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni
2000 J jnl
Some APX-completeness results for cubic graphs.
Theor. Comput. Sci.
Paola Alimonti, Viggo Kann
1997 C conf
Hardness of Approximating Problems on Cubic Graphs.
CIAC
Paola Alimonti, Viggo Kann
1997 B conf
Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.
WG
Paola Alimonti
1996 J jnl
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.
RAIRO Theor. Informatics Appl.
Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela
1996 J jnl
Finding the Extrema of a Distributed Multiset.
J. Parallel Distributed Comput.
Paola Alimonti, Paola Flocchini, Nicola Santoro
1996 B conf
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.
WG
Paola Alimonti, Tiziana Calamoneri
1996 J jnl
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
Inf. Process. Lett.
Paola Alimonti
1995 B conf
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems.
WG
Paola Alimonti
1994 — conf
Finding the Extrema of a Distributed Multiset.
WDAG
Paola Alimonti, Paola Flocchini, Nicola Santoro
1994 C conf
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
CIAC
Paola Alimonti
1993 B conf
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.
WG
Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer
1992 B conf
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.
LATIN
Paola Alimonti, Esteban Feuerstein, Umberto Nanni
1992 B conf
Petri Nets, Hypergraphs and Conflicts (Preliminary Version).
WG
Paola Alimonti, Esteban Feuerstein