Giulia Galbiati

According to our database1, 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
On minimum reload cost paths, tours, and flows.
Networks, 2011

On the approximability of the minimum strictly fundamental cycle basis problem.
Discret. Appl. Math., 2011

On Minimum Changeover Cost Arborescences.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Approximating Minimum Cut with Bounded Size.
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

On Minimum Reload Cost Cycle Cover.
Electron. Notes Discret. Math., 2010

2008
The complexity of a minimum reload cost diameter problem.
Discret. Appl. Math., 2008

2007
Approximation algorithms for maximum cut with limited unbalance.
Theor. Comput. Sci., 2007

2006
Approximating Max Cut with Limited Unbalance.
Electron. Notes Discret. Math., 2006

Approximating Maximum Cut with Limited Unbalance.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

2003
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle.
Inf. Process. Lett., 2003

On the Approximability of the Minimum Fundamental Cycle Basis Problem.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

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

2001
On Optimum Cycle Bases.
Electron. Notes Discret. Math., 2001

On Min-Max Cycle Bases.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Approximability of hard combinatorial optimization problems: an introduction.
Ann. Oper. Res., 2000

1999
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem.
J. Complex., 1999

1997
On the Approximability of Some Maximum Spanning Tree Problems.
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
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem.
Inf. Process. Lett., 1994

on the Computation of Pfaffians.
Discret. Appl. Math., 1994

1993
Preface.
Discret. Appl. Math., 1993

1992
Constructing an Exact Parity Base Is in RNC<sup>2</sup>.
Parallel Process. Lett., 1992

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.
J. Algorithms, 1992

1991
A phrase-based matching function.
J. Am. Soc. Inf. Sci., 1991

The image of weighted combinatorial problems.
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
On the complexity of finding multi-constrained spanning trees.
Discret. Appl. Math., 1983

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

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


  Loading...