# Giulia Galbiati

According to our database

Collaborative distances:

^{1}, Giulia Galbiati authored at least 32 papers between 1981 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

Coloring of paths into forests.

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011

Networks, 2011

Discret. Appl. Math., 2011

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance.

Networks, 2010

Electron. Notes Discret. Math., 2010

2008

Discret. Appl. Math., 2008

2007

Theor. Comput. Sci., 2007

2006

Electron. Notes Discret. Math., 2006

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

2003

Inf. Process. Lett., 2003

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002

Discret. Appl. Math., 2002

2001

Electron. Notes Discret. Math., 2001

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Ann. Oper. Res., 2000

1999

J. Complex., 1999

1997

Theor. Comput. Sci., 1997

1996

On the Logical Definability of Some Maximum Leaves Problems.

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1994

Inf. Process. Lett., 1994

Discret. Appl. Math., 1994

1993

Discret. Appl. Math., 1993

1992

Parallel Process. Lett., 1992

J. Algorithms, 1992

1991

J. Am. Soc. Inf. Sci., 1991

Ann. Oper. Res., 1991

1990

On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints.

J. Complex., 1990

Modular Arithmetic and Randomization for Exact Matroid Problems.

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1983

Discret. Appl. Math., 1983

1982

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem.

Networks, 1982

1981

Theor. Comput. Sci., 1981