Giulia Galbiati - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On minimum reload cost paths, tours, and flowsEdoardo Amaldi, Giulia Galbiati, Francesco Maffioli. networks, 57(3):254-260, 2011. [doi]

On Minimum Changeover Cost ArborescencesGiulia Galbiati, Stefano Gualandi, Francesco Maffioli. wea 2011: 112-123 [doi]

On the approximability of the minimum strictly fundamental cycle basis problemGiulia Galbiati, Romeo Rizzi, Edoardo Amaldi. DAM, 159(4):187-200, 2011. [doi]

2010

On Minimum Reload Cost Cycle CoverGiulia Galbiati, Stefano Gualandi, Francesco Maffioli. endm, 36:81-88, 2010. [doi]

Computational experience with a SDP-based algorithm for maximum cut with limited unbalanceGiulia Galbiati, Stefano Gualandi, Francesco Maffioli. networks, 55(3):247-255, 2010. [doi]

2008

On minimum reload cost paths, tours and flowsEdoardo Amaldi, Giulia Galbiati, Francesco Maffioli. colognetwente 2008: 112-115

The complexity of a minimum reload cost diameter problemGiulia Galbiati. DAM, 156(18):3494-3497, 2008. [doi]

2007

Approximation algorithms for maximum cut with limited unbalanceGiulia Galbiati, Francesco Maffioli. TCS, 385(1-3):78-87, 2007. [doi]

2006

Approximating Max Cut with Limited UnbalanceGiulia Galbiati, Francesco Maffioli. endm, 25:101-104, 2006. [doi]

Approximating Maximum Cut with Limited UnbalanceGiulia Galbiati, Francesco Maffioli. waoa 2006: 202-213 [doi]

2003

On finding cycle bases and fundamental cycle bases with a shortest maximal cycleGiulia Galbiati. ipl, 88(4):155-159, 2003. [doi]

On the Approximability of the Minimum Fundamental Cycle Basis ProblemGiulia Galbiati, Edoardo Amaldi. waoa 2004: 151-164 [doi]

2002

On the approximation of the Minimum Disturbance p-Facility Location ProblemGiulia Galbiati. DAM, 118(1-2):73-83, 2002.

2001

On Optimum Cycle BasesGiulia Galbiati. endm, 10:113-116, 2001. [doi]

On Min-Max Cycle BasesGiulia Galbiati. isaac 2001: 116-123 [doi]

1999

Randomized Algorithms over Finite Fields for the Exact Parity Base ProblemGiulia Galbiati, Francesco Maffioli, Carlo Viola. jc, 15(4):537-556, 1999. [doi]

1997

On the Approximability of Some Maximum Spanning Tree ProblemsGiulia Galbiati, Angelo Morzenti, Francesco Maffioli. TCS, 181(1):107-118, 1997. [doi]

1995

On the Approximability of some Maximum Spanning Tree ProblemsGiulia Galbiati, Angelo Morzenti, Francesco Maffioli. latin 1995: 300-310

1994

A Short Note on the Approximability of the Maximum Leaves Spanning Tree ProblemGiulia Galbiati, Francesco Maffioli, Angelo Morzenti. ipl, 52(1):45-49, 1994.

on the Computation of PfaffiansGiulia Galbiati, Francesco Maffioli. DAM, 51(3):269-275, 1994. [doi]

1993

PrefaceGiulia Galbiati, Francesco Maffioli. DAM, 42(2):119, 1993. [doi]

1992

Random Pseudo-Polynomial Algorithms for Exact Matroid ProblemsPaolo M. Camerini, Giulia Galbiati, Francesco Maffioli. jal, 13(2):258-273, 1992.

Constructing an Exact Parity Base Is in RNC:::2:::Giulia Galbiati, Francesco Maffioli. ppl, 2:301-309, 1992.

1991

A phrase-based matching functionGiulia Galbiati. jasis, 42(1):36-48, 1991.

1990

Modular Arithmetic and Randomization for Exact Matroid ProblemsPaolo M. Camerini, Giulia Galbiati, Francesco Maffioli. ipco 1990: 101-113

On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraintsGiulia Galbiati. jc, 6(2):149-165, 1990. [doi]

1981

M. J. Fischer: On the Complexity of 2-Output Boolean NetworksGiulia Galbiati. TCS, 16:177-185, 1981.