The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paola Alimonti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002