Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. - Paola Alimonti; Esteban Feuerstein; Umberto Nanni (LATIN, 1992)

Petri Nets, Hypergraphs and Conflicts (Preliminary Version). - Paola Alimonti; Esteban Feuerstein (WG, 1992)

Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. - Paola Alimonti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela; Xavier Messeguer (WG, 1993)

Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems. - Paola Alimonti (WG, 1995)

Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. - Paola Alimonti; Tiziana Calamoneri (WG, 1996)

New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. - Paola Alimonti (Inf. Process. Lett., 1996)

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. - Paola Alimonti; Stefano Leonardi 001; Alberto Marchetti-Spaccamela (RAIRO Theor. Informatics Appl., 1996)

Finding the Extrema of a Distributed Multiset. - Paola Alimonti; Paola Flocchini; Nicola Santoro (J. Parallel Distributed Comput., 1996)

Hardness of Approximating Problems on Cubic Graphs. - Paola Alimonti; Viggo Kann (CIAC, 1997)

Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. - Paola Alimonti (WG, 1997)

Some APX-completeness results for cubic graphs. - Paola Alimonti; Viggo Kann (Theor. Comput. Sci., 2000)

Linear time analysis of properties of conflict-free and general Petri nets. - Paola Alimonti; Esteban Feuerstein; Luigi Laura; Umberto Nanni (Theor. Comput. Sci., 2011)