Antonio Sassano

According to our database1, Antonio Sassano authored at least 47 papers between 1987 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3.
Math. Program., 2017

2016
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4.
Discret. Optim., 2016

2015
An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$.
CoRR, 2015

An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs.
CoRR, 2015

An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$.
CoRR, 2015

2014
The Hirsch Conjecture for the fractional stable set polytope.
Math. Program., 2014

A reduction algorithm for the weighted stable set problem in claw-free graphs.
Discret. Appl. Math., 2014

2013
GUB Covers and Power-Indexed Formulations for Wireless Network Design.
Manag. Sci., 2013

The Shortest Walk to Watch TV.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2011
Planning wireless networks by shortest path.
Comput. Optim. Appl., 2011

Negative Cycle Separation in Wireless Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011

2008
Time offset optimization in digital broadcasting.
Discret. Appl. Math., 2008

2007
Computational study of large-scale <i>p</i> -Median problems.
Math. Program., 2007

Metric inequalities and the Network Loading Problem.
Discret. Optim., 2007

Models and solution techniques for frequency assignment problems.
Ann. Oper. Res., 2007

2003
A heuristic for large-scale p-median instances.
Electron. Notes Discret. Math., 2003

An Enumerative Algorithm for the Frequency Assignment Problem.
Discret. Appl. Math., 2003

A Complete Adaptive Algorithm for Propositional Satisfiability.
Discret. Appl. Math., 2003

2002
Minimizing the span of <i>d</i> -walks to compute optimum frequency assignments.
Math. Program., 2002

2001
On the <i>p</i> -Median polytope.
Math. Program., 2001

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae.
Electron. Notes Discret. Math., 2001

Models and Algorithms for Terrestrial Digital Broadcasting.
Ann. Oper. Res., 2001

Errors Detection and Correction in Large Scale Data Collecting.
Proceedings of the Advances in Intelligent Data Analysis, 4th International Conference, 2001

2000
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.
Proceedings of the Principles and Practice of Constraint Programming, 2000

1998
(0, +-1) ideal matrices.
Math. Program., 1998

A Lagrangian-based heuristic for large-scale set covering problems.
Math. Program., 1998

1997
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.
J. Comb. Theory, Ser. B, 1997

Chair-Free Berge Graphs Are Perfect.
Graphs Comb., 1997

1995
Solving hard set covering problems.
Oper. Res. Lett., 1995

Preface.
Discret. Appl. Math., 1995

1994
An exact algorithm for the maximum stable set problem.
Comput. Optim. Appl., 1994

1993
Polyhedral Properties of Clutter Amalgam.
SIAM J. Discret. Math., 1993

The anti-join composition and polyhedra.
Discret. Math., 1993

Stability Number of Bull- and Chair-Free Graphs.
Discret. Appl. Math., 1993

Edge projection and the maximum cardinality stable set problem.
Proceedings of the Cliques, 1993

1992
A characterization of knapsacks with the max-flow- - min-cut property.
Oper. Res. Lett., 1992

A Separation Routine for the Set Covering Polytope.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
The equipartition polytope. II: Valid inequalities and facets.
Math. Program., 1991

The equipartition polytope. I: Formulations, dimension and basic facets.
Math. Program., 1991

1989
On the facial structure of the set covering polytope.
Math. Program., 1989

Facets and lifting procedures for the set covering polytope.
Math. Program., 1989

On the 0, 1 facets of the set covering polytope.
Math. Program., 1989

The Complexity of Matching with Bonds.
Inf. Process. Lett., 1989

A Decomposition Strategy for the Vertex Cover Problem.
Inf. Process. Lett., 1989

1988
A Class of Polynomially Solvable Set-Covering Problems.
SIAM J. Discret. Math., 1988

The Steiner Tree Problem and Homogeneous Sets.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
An O(mn) Algorithm for Regular Set-Covering Problems.
Theor. Comput. Sci., 1987


  Loading...