Paola Alimonti

According to our database, Paola Alimonti authored at least 12 papers between 1992 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Linear time analysis of properties of conflict-free and general Petri nets.

Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni

Theor. Comput. Sci., 2011

2000

Some APX-completeness results for cubic graphs.

Paola Alimonti, Viggo Kann

Theor. Comput. Sci., 2000

1997

Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.

Paola Alimonti

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Hardness of Approximating Problems on Cubic Graphs.

Paola Alimonti, Viggo Kann

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Finding the Extrema of a Distributed Multiset.

Paola Alimonti, Paola Flocchini, Nicola Santoro

J. Parallel Distributed Comput., 1996

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.

Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela

RAIRO Theor. Informatics Appl., 1996

New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.

Paola Alimonti

Inf. Process. Lett., 1996

Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.

Paola Alimonti, Tiziana Calamoneri

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems.

Paola Alimonti

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1993

Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.

Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Petri Nets, Hypergraphs and Conflicts (Preliminary Version).

Paola Alimonti, Esteban Feuerstein

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.

Paola Alimonti, Esteban Feuerstein, Umberto Nanni

Proceedings of the LATIN '92, 1992