M. J. Fischer: On the Complexity of 2-Output Boolean Networks. - Giulia Galbiati (Theor. Comput. Sci., 1981)

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. - Alan M. Frieze; Giulia Galbiati; Francesco Maffioli (Networks, 1982)

On the complexity of finding multi-constrained spanning trees. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (Discret. Appl. Math., 1983)

Modular Arithmetic and Randomization for Exact Matroid Problems. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (IPCO, 1990)

On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints. - Giulia Galbiati (J. Complex., 1990)

The image of weighted combinatorial problems. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (Ann. Oper. Res., 1991)

A phrase-based matching function. - Giulia Galbiati (J. Am. Soc. Inf. Sci., 1991)

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. - Paolo M. Camerini; Giulia Galbiati; Francesco Maffioli (J. Algorithms, 1992)

Constructing an Exact Parity Base Is in RNC2. - Giulia Galbiati; Francesco Maffioli (Parallel Process. Lett., 1992)

Preface. - Giulia Galbiati; Francesco Maffioli (Discret. Appl. Math., 1993)

on the Computation of Pfaffians. - Giulia Galbiati; Francesco Maffioli (Discret. Appl. Math., 1994)

A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. - Giulia Galbiati; Francesco Maffioli; Angelo Morzenti (Inf. Process. Lett., 1994)

On the Logical Definability of Some Maximum Leaves Problems. - Giulia Galbiati; Angelo Morzenti; Francesco Maffioli (DMTCS, 1996)

On the Approximability of Some Maximum Spanning Tree Problems. - Giulia Galbiati; Angelo Morzenti; Francesco Maffioli (Theor. Comput. Sci., 1997)

Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. - Giulia Galbiati; Francesco Maffioli; Carlo Viola (J. Complex., 1999)

Approximability of hard combinatorial optimization problems: an introduction. - Francesco Maffioli; Giulia Galbiati (Ann. Oper. Res., 2000)

On Min-Max Cycle Bases. - Giulia Galbiati (ISAAC, 2001)

On Optimum Cycle Bases. - Giulia Galbiati (Electron. Notes Discret. Math., 2001)

On the approximation of the Minimum Disturbance p-Facility Location Problem. - Giulia Galbiati (Discret. Appl. Math., 2002)

On the Approximability of the Minimum Fundamental Cycle Basis Problem. - Giulia Galbiati; Edoardo Amaldi (WAOA, 2003)

On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. - Giulia Galbiati (Inf. Process. Lett., 2003)

Approximating Maximum Cut with Limited Unbalance. - Giulia Galbiati; Francesco Maffioli (WAOA, 2006)

Approximating Max Cut with Limited Unbalance. - Giulia Galbiati; Francesco Maffioli (Electron. Notes Discret. Math., 2006)

Approximation algorithms for maximum cut with limited unbalance. - Giulia Galbiati; Francesco Maffioli (Theor. Comput. Sci., 2007)

The complexity of a minimum reload cost diameter problem. - Giulia Galbiati (Discret. Appl. Math., 2008)

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. - Giulia Galbiati; Stefano Gualandi; Francesco Maffioli (Networks, 2010)

Approximating Minimum Cut with Bounded Size. - Giulia Galbiati (INOC, 2011)

On Minimum Changeover Cost Arborescences. - Giulia Galbiati; Stefano Gualandi; Francesco Maffioli (SEA, 2011)

On the approximability of the minimum strictly fundamental cycle basis problem. - Giulia Galbiati; Romeo Rizzi; Edoardo Amaldi (Discret. Appl. Math., 2011)

On minimum reload cost paths, tours, and flows. - Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli (Networks, 2011)

Coloring of paths into forests. - Giulia Galbiati; Stefano Gualandi (CTW, 2013)

On Minimum Reload Cost Cycle Cover. - Giulia Galbiati; Stefano Gualandi; Francesco Maffioli (Discret. Appl. Math., 2014)