Giulia Galbiati

Publication Activity (10 Years)

Years Active: 1981-2014
Publications (10 Years): 0

Top Topics

Transportation Problem

Top Venues

Discret. Appl. Math.

Publications

Giulia Galbiati, Stefano Gualandi, Francesco Maffioli
On Minimum Reload Cost Cycle Cover. Discret. Appl. Math. 164 (2014)
Giulia Galbiati, Stefano Gualandi
Coloring of paths into forests. CTW (2013)
Giulia Galbiati, Stefano Gualandi, Francesco Maffioli
On Minimum Changeover Cost Arborescences. SEA (2011)
Giulia Galbiati
Approximating Minimum Cut with Bounded Size. INOC (2011)
Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi
On the approximability of the minimum strictly fundamental cycle basis problem. Discret. Appl. Math. 159 (4) (2011)
Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli
On minimum reload cost paths, tours, and flows. Networks 57 (3) (2011)
Giulia Galbiati, Stefano Gualandi, Francesco Maffioli
On Minimum Reload Cost Cycle Cover. Electron. Notes Discret. Math. 36 (2010)
Giulia Galbiati, Stefano Gualandi, Francesco Maffioli
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. Networks 55 (3) (2010)
Giulia Galbiati
The complexity of a minimum reload cost diameter problem. Discret. Appl. Math. 156 (18) (2008)
Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli
On minimum reload cost paths, tours and flows. CTW (2008)
Giulia Galbiati, Francesco Maffioli
Approximation algorithms for maximum cut with limited unbalance. Theor. Comput. Sci. 385 (1-3) (2007)
Giulia Galbiati, Francesco Maffioli
Approximating Maximum Cut with Limited Unbalance. WAOA (2006)
Giulia Galbiati, Francesco Maffioli
Approximating Max Cut with Limited Unbalance. Electron. Notes Discret. Math. 25 (2006)
Giulia Galbiati, Edoardo Amaldi
On the Approximability of the Minimum Fundamental Cycle Basis Problem. WAOA (2003)
Giulia Galbiati
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. Inf. Process. Lett. 88 (4) (2003)
Giulia Galbiati
On the approximation of the Minimum Disturbance p-Facility Location Problem. Discret. Appl. Math. 118 (1-2) (2002)
Giulia Galbiati
On Optimum Cycle Bases. Electron. Notes Discret. Math. 10 (2001)
Giulia Galbiati
On Min-Max Cycle Bases. ISAAC (2001)
Francesco Maffioli, Giulia Galbiati
Approximability of hard combinatorial optimization problems: an introduction. Ann. Oper. Res. 96 (1-4) (2000)
Giulia Galbiati, Francesco Maffioli, Carlo Viola
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. J. Complex. 15 (4) (1999)
Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
On the Approximability of Some Maximum Spanning Tree Problems. Theor. Comput. Sci. 181 (1) (1997)
Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
On the Logical Definability of Some Maximum Leaves Problems. DMTCS (1996)
Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
On the Approximability of some Maximum Spanning Tree Problems. LATIN (1995)
Giulia Galbiati, Francesco Maffioli
on the Computation of Pfaffians. Discret. Appl. Math. 51 (3) (1994)
Giulia Galbiati, Francesco Maffioli, Angelo Morzenti
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Inf. Process. Lett. 52 (1) (1994)
Giulia Galbiati, Francesco Maffioli
Preface. Discret. Appl. Math. 42 (2) (1993)
Giulia Galbiati, Francesco Maffioli
. Parallel Process. Lett. 2 (1992)
Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. J. Algorithms 13 (2) (1992)
Giulia Galbiati
A phrase-based matching function. J. Am. Soc. Inf. Sci. 42 (1) (1991)
Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli
The image of weighted combinatorial problems. Ann. Oper. Res. 33 (3) (1991)
Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli
Modular Arithmetic and Randomization for Exact Matroid Problems. IPCO (1990)
Giulia Galbiati
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints. J. Complex. 6 (2) (1990)
Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli
On the complexity of finding multi-constrained spanning trees. Discret. Appl. Math. 5 (1) (1983)
Alan M. Frieze, Giulia Galbiati, Francesco Maffioli
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 (1) (1982)
Giulia Galbiati
M. J. Fischer: On the Complexity of 2-Output Boolean Networks. Theor. Comput. Sci. 16 (1981)