Giulia Galbiati

Discret. Appl. Math., 2014

2013

Coloring of paths into forests.

[BibT_eX]

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

2011

On minimum reload cost paths, tours, and flows.

[BibT_eX]

[DOI]

Edoardo Amaldi

Networks, 2011

On the approximability of the minimum strictly fundamental cycle basis problem.

[BibT_eX]

[DOI]

Romeo Rizzi

Edoardo Amaldi

Discret. Appl. Math., 2011

On Minimum Changeover Cost Arborescences.

[BibT_eX]

[DOI]

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

Approximating Minimum Cut with Bounded Size.

[BibT_eX]

[DOI]

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

2010

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

[BibT_eX]

[DOI]

Networks, 2010

2008

The complexity of a minimum reload cost diameter problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Approximation algorithms for maximum cut with limited unbalance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

Approximating Max Cut with Limited Unbalance.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Approximating Maximum Cut with Limited Unbalance.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

On the Approximability of the Minimum Fundamental Cycle Basis Problem.

[BibT_eX]

[DOI]

Edoardo Amaldi

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

2002

On the approximation of the Minimum Disturbance p-Facility Location Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

On Optimum Cycle Bases.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On Min-Max Cycle Bases.

[BibT_eX]

[DOI]

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

2000

Approximability of hard combinatorial optimization problems: an introduction.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2000

1999

Randomized Algorithms over Finite Fields for the Exact Parity Base Problem.

[BibT_eX]

[DOI]

Carlo Viola

J. Complex., 1999

1997

On the Approximability of Some Maximum Spanning Tree Problems.

[BibT_eX]

[DOI]

Angelo Morzenti

Theor. Comput. Sci., 1997

1996

On the Logical Definability of Some Maximum Leaves Problems.

[BibT_eX]

Angelo Morzenti

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.

[BibT_eX]

[DOI]

Angelo Morzenti

Inf. Process. Lett., 1994

on the Computation of Pfaffians.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

Constructing an Exact Parity Base Is in RNC<sup>2</sup>.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1992

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1992

1991

A phrase-based matching function.

[BibT_eX]

[DOI]

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

The image of weighted combinatorial problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

1990

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

[BibT_eX]

[DOI]

J. Complex., 1990

Modular Arithmetic and Randomization for Exact Matroid Problems.

[BibT_eX]

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

1983

On the complexity of finding multi-constrained spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

1982

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

[BibT_eX]

[DOI]

Alan M. Frieze

Networks, 1982

1981

M. J. Fischer: On the Complexity of 2-Output Boolean Networks.

[BibT_eX]

[DOI]