 | 2000 |
|---|
| 13 |       | Paola Alimonti,
Viggo Kann:
Some APX-completeness results for cubic graphs.
Theor. Comput. Sci. 237(1-2): 123-134 (2000) |
| 1997 |
|---|
| 12 | | Paola Alimonti,
Viggo Kann:
Hardness of Approximating Problems on Cubic Graphs.
CIAC 1997: 288-298 |
| 11 | | Paola Alimonti:
Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.
WG 1997: 2-14 |
| 1996 |
|---|
| 10 | | Paola Alimonti,
Tiziana Calamoneri:
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.
WG 1996: 2-16 |
| 9 |  | Paola Alimonti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela:
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.
ITA 30(4): 305-318 (1996) |
| 8 | | Paola Alimonti:
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
Inf. Process. Lett. 57(3): 151-158 (1996) |
| 7 | | Paola Alimonti,
Paola Flocchini,
Nicola Santoro:
Finding the Extrema of a Distributed Multiset.
J. Parallel Distrib. Comput. 37(2): 123-133 (1996) |
| 1995 |
|---|
| 6 | | Paola Alimonti:
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems.
WG 1995: 167-180 |
| 1994 |
|---|
| 5 | | Paola Alimonti:
New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems.
CIAC 1994: 40-53 |
| 4 | | Paola Alimonti,
Paola Flocchini,
Nicola Santoro:
Finding the Extrema of a Distributed Multiset.
WDAG 1994: 164-178 |
| 1993 |
|---|
| 3 | | Paola Alimonti,
Stefano Leonardi,
Alberto Marchetti-Spaccamela,
Xavier Messeguer:
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.
WG 1993: 87-98 |
| 1992 |
|---|
| 2 | | Paola Alimonti,
Esteban Feuerstein,
Umberto Nanni:
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.
LATIN 1992: 1-14 |
| 1 | | Paola Alimonti,
Esteban Feuerstein:
Petri Nets, Hypergraphs and Conflicts (Preliminary Version).
WG 1992: 293-309 |
