Giulia Galbiati

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