( en | de | ru )

 

Disambiguation of "Alimonti, Paola"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.

, and . WG, volume 1197 of Lecture Notes in Computer Science, page 2-16. Springer, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anna-Pia Paolazzi

Domingos Paola

Paola Belloni

Paola Bozzi

Paola Traverso

 

Other publications of authors with the same name

New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.. Inf. Process. Lett., 57 (3): 151-158 (1996)Finding the Extrema of a Distributed Multiset., , and . J. Parallel Distributed Comput., 37 (2): 123-133 (1996)Improved Approximations of Independent Dominating Set in Bounded Degree Graphs., and . WG, volume 1197 of Lecture Notes in Computer Science, page 2-16. Springer, (1996)Finding the Extrema of a Distributed Multiset., , and . WDAG, volume 857 of Lecture Notes in Computer Science, page 164-178. Springer, (1994)Petri Nets, Hypergraphs and Conflicts (Preliminary Version)., and . WG, volume 657 of Lecture Notes in Computer Science, page 293-309. Springer, (1992)Hardness of Approximating Problems on Cubic Graphs., and . CIAC, volume 1203 of Lecture Notes in Computer Science, page 288-298. Springer, (1997)Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems.. WG, volume 1017 of Lecture Notes in Computer Science, page 167-180. Springer, (1995)Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.. WG, volume 1335 of Lecture Notes in Computer Science, page 2-14. Springer, (1997)Linear time analysis of properties of conflict-free and general Petri nets., , , and . Theor. Comput. Sci., 412 (4-5): 320-338 (2011)Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs., , , and . WG, volume 790 of Lecture Notes in Computer Science, page 87-98. Springer, (1993)