 | 2011 |
|---|
| 28 |       | Giulia Galbiati:
Approximating Minimum Cut with Bounded Size.
INOC 2011: 210-215 |
| 27 | | Giulia Galbiati,
Stefano Gualandi,
Francesco Maffioli:
On Minimum Changeover Cost Arborescences.
SEA 2011: 112-123 |
| 26 | | Giulia Galbiati,
Romeo Rizzi,
Edoardo Amaldi:
On the approximability of the minimum strictly fundamental cycle basis problem.
Discrete Applied Mathematics 159(4): 187-200 (2011) |
| 25 | | Edoardo Amaldi,
Giulia Galbiati,
Francesco Maffioli:
On minimum reload cost paths, tours, and flows.
Networks 57(3): 254-260 (2011) |
| 2010 |
|---|
| 24 | | Giulia Galbiati,
Stefano Gualandi,
Francesco Maffioli:
On Minimum Reload Cost Cycle Cover.
Electronic Notes in Discrete Mathematics 36: 81-88 (2010) |
| 23 | | Giulia Galbiati,
Stefano Gualandi,
Francesco Maffioli:
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance.
Networks 55(3): 247-255 (2010) |
| 2008 |
|---|
| 22 |  | Edoardo Amaldi,
Giulia Galbiati,
Francesco Maffioli:
On minimum reload cost paths, tours and flows.
CTW 2008: 112-115 |
| 21 | | Giulia Galbiati:
The complexity of a minimum reload cost diameter problem.
Discrete Applied Mathematics 156(18): 3494-3497 (2008) |
| 2007 |
|---|
| 20 | | Giulia Galbiati,
Francesco Maffioli:
Approximation algorithms for maximum cut with limited unbalance.
Theor. Comput. Sci. 385(1-3): 78-87 (2007) |
| 2006 |
|---|
| 19 | | Giulia Galbiati,
Francesco Maffioli:
Approximating Maximum Cut with Limited Unbalance.
WAOA 2006: 202-213 |
| 18 | | Giulia Galbiati,
Francesco Maffioli:
Approximating Max Cut with Limited Unbalance.
Electronic Notes in Discrete Mathematics 25: 101-104 (2006) |
| 2003 |
|---|
| 17 | | Giulia Galbiati,
Edoardo Amaldi:
On the Approximability of the Minimum Fundamental Cycle Basis Problem.
WAOA 2003: 151-164 |
| 16 | | Giulia Galbiati:
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle.
Inf. Process. Lett. 88(4): 155-159 (2003) |
| 2002 |
|---|
| 15 | | Giulia Galbiati:
On the approximation of the Minimum Disturbance p-Facility Location Problem.
Discrete Applied Mathematics 118(1-2): 73-83 (2002) |
| 2001 |
|---|
| 14 | | Giulia Galbiati:
On Min-Max Cycle Bases.
ISAAC 2001: 116-123 |
| 13 | | Giulia Galbiati:
On Optimum Cycle Bases.
Electronic Notes in Discrete Mathematics 10: 113-116 (2001) |
| 1999 |
|---|
| 12 | | Giulia Galbiati,
Francesco Maffioli,
Carlo Viola:
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem.
J. Complexity 15(4): 537-556 (1999) |
| 1997 |
|---|
| 11 | | Giulia Galbiati,
Angelo Morzenti,
Francesco Maffioli:
On the Approximability of Some Maximum Spanning Tree Problems.
Theor. Comput. Sci. 181(1): 107-118 (1997) |
| 1995 |
|---|
| 10 | | Giulia Galbiati,
Angelo Morzenti,
Francesco Maffioli:
On the Approximability of some Maximum Spanning Tree Problems.
LATIN 1995: 300-310 |
| 1994 |
|---|
| 9 | | Giulia Galbiati,
Francesco Maffioli:
on the Computation of Pfaffians.
Discrete Applied Mathematics 51(3): 269-275 (1994) |
| 8 | | Giulia Galbiati,
Francesco Maffioli,
Angelo Morzenti:
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem.
Inf. Process. Lett. 52(1): 45-49 (1994) |
| 1993 |
|---|
| 7 | | Giulia Galbiati,
Francesco Maffioli:
Preface.
Discrete Applied Mathematics 42(2): 119 (1993) |
| 1992 |
|---|
| 6 | | Paolo M. Camerini,
Giulia Galbiati,
Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.
J. Algorithms 13(2): 258-273 (1992) |
| 5 | | Giulia Galbiati,
Francesco Maffioli:
Constructing an Exact Parity Base Is in RNC2.
Parallel Processing Letters 2: 301-309 (1992) |
| 1991 |
|---|
| 4 | | Giulia Galbiati:
A phrase-based matching function.
JASIS 42(1): 36-48 (1991) |
| 1990 |
|---|
| 3 | | Paolo M. Camerini,
Giulia Galbiati,
Francesco Maffioli:
Modular Arithmetic and Randomization for Exact Matroid Problems.
IPCO 1990: 101-113 |
| 2 | | Giulia Galbiati:
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints.
J. Complexity 6(2): 149-165 (1990) |
| 1981 |
|---|
| 1 | | Giulia Galbiati:
M. J. Fischer: On the Complexity of 2-Output Boolean Networks.
Theor. Comput. Sci. 16: 177-185 (1981) |
Data released under the ODC-BY 1.0 license — See also our legal information page