Search the dblp DataBase

Publications of Author

1. Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli
   Modular Arithmetic and Randomization for Exact Matroid Problems. [Citation Graph (0, 0)][DBLP]
   IPCO, 1990, pp:101-113 [Conf]
   
2. Giulia Galbiati
   On Min-Max Cycle Bases. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2001, pp:116-123 [Conf]
   
3. Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
   On the Approximability of some Maximum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
   LATIN, 1995, pp:300-310 [Conf]
   
4. Giulia Galbiati, Francesco Maffioli
   Approximating Maximum Cut with Limited Unbalance. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:202-213 [Conf]
   
5. Giulia Galbiati, Edoardo Amaldi
   On the Approximability of the Minimum Fundamental Cycle Basis Problem. [Citation Graph (0, 0)][DBLP]
   WAOA, 2003, pp:151-164 [Conf]
   
6. Giulia Galbiati
   On the approximation of the Minimum Disturbance p-Facility Location Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:73-83 [Journal]
   
7. Giulia Galbiati, Francesco Maffioli
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:119- [Journal]
   
8. Giulia Galbiati, Francesco Maffioli
   on the Computation of Pfaffians. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:3, pp:269-275 [Journal]
   
9. Giulia Galbiati
   On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:88, n:4, pp:155-159 [Journal]
   
10. Giulia Galbiati, Francesco Maffioli, Angelo Morzenti
    A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:1, pp:45-49 [Journal]
    
11. Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli
    Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:258-273 [Journal]
    
12. Giulia Galbiati
    A phrase-based matching function. [Citation Graph (0, 0)][DBLP]
    JASIS, 1991, v:42, n:1, pp:36-48 [Journal]
    
13. Giulia Galbiati
    On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:2, pp:149-165 [Journal]
    
14. Giulia Galbiati, Francesco Maffioli, Carlo Viola
    Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:4, pp:537-556 [Journal]
    
15. Giulia Galbiati, Francesco Maffioli
    Constructing an Exact Parity Base Is in RNC². [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:301-309 [Journal]
    
16. Giulia Galbiati
    M. J. Fischer: On the Complexity of 2-Output Boolean Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:177-185 [Journal]
    
17. Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
    On the Approximability of Some Maximum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:107-118 [Journal]
    
18. Giulia Galbiati, Francesco Maffioli
    Approximation algorithms for maximum cut with limited unbalance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:78-87 [Journal]
    
19. 
    On minimum reload cost paths, tours and flows. [Citation Graph (, )][DBLP]
    
    
20. 
    The complexity of a minimum reload cost diameter problem. [Citation Graph (, )][DBLP]