An O(mn) Algorithm for Regular Set-Covering Problems. - Paola Bertolazzi; Antonio Sassano (Theor. Comput. Sci., 1987)

The Steiner Tree Problem and Homogeneous Sets. - Alessandro D'Atri; Marina Moscarini; Antonio Sassano (MFCS, 1988)

A Class of Polynomially Solvable Set-Covering Problems. - Paola Bertolazzi; Antonio Sassano (SIAM J. Discret. Math., 1988)

A Decomposition Strategy for the Vertex Cover Problem. - Paola Bertolazzi; Antonio Sassano (Inf. Process. Lett., 1989)

The Complexity of Matching with Bonds. - Manfred Padberg; Antonio Sassano (Inf. Process. Lett., 1989)

On the 0, 1 facets of the set covering polytope. - Gérard Cornuéjols; Antonio Sassano (Math. Program., 1989)

Facets and lifting procedures for the set covering polytope. - Paolo Nobili; Antonio Sassano (Math. Program., 1989)

On the facial structure of the set covering polytope. - Antonio Sassano (Math. Program., 1989)

The equipartition polytope. I: Formulations, dimension and basic facets. - Michele Conforti; M. R. Rao; Antonio Sassano (Math. Program., 1991)

The equipartition polytope. II: Valid inequalities and facets. - Michele Conforti; M. R. Rao; Antonio Sassano (Math. Program., 1991)

A Separation Routine for the Set Covering Polytope. - Paolo Nobili; Antonio Sassano (IPCO, 1992)

A characterization of knapsacks with the max-flow- - min-cut property. - Monique Laurent; Antonio Sassano (Oper. Res. Lett., 1992)

Edge projection and the maximum cardinality stable set problem. - Carlo Mannino; Antonio Sassano (Cliques, Coloring, and Satisfiability, 1993)

Stability Number of Bull- and Chair-Free Graphs. - Caterina De Simone; Antonio Sassano (Discret. Appl. Math., 1993)

The anti-join composition and polyhedra. - Paolo Nobili; Antonio Sassano (Discret. Math., 1993)

Polyhedral Properties of Clutter Amalgam. - Paolo Nobili; Antonio Sassano (SIAM J. Discret. Math., 1993)

An exact algorithm for the maximum stable set problem. - Carlo Mannino; Antonio Sassano (Comput. Optim. Appl., 1994)

Preface. - Mario Lucertini; Giovanni Rinaldi; Antonio Sassano; Bruno Simeone (Discret. Appl. Math., 1995)

Solving hard set covering problems. - Carlo Mannino; Antonio Sassano (Oper. Res. Lett., 1995)

Chair-Free Berge Graphs Are Perfect. - Antonio Sassano (Graphs Comb., 1997)

The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. - Anna Galluccio; Antonio Sassano (J. Comb. Theory B, 1997)

A Lagrangian-based heuristic for large-scale set covering problems. - Sebastián Ceria; Paolo Nobili; Antonio Sassano (Math. Program., 1998)

(0, +-1) ideal matrices. - Paolo Nobili; Antonio Sassano (Math. Program., 1998)

Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances. - Renato Bruni; Antonio Sassano (CP, 2000)

Errors Detection and Correction in Large Scale Data Collecting. - Renato Bruni; Antonio Sassano (IDA, 2001)

Models and Algorithms for Terrestrial Digital Broadcasting. - Fabrizio Rossi; Stefano Smriglio; Antonio Sassano (Ann. Oper. Res., 2001)

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. - Renato Bruni; Antonio Sassano (Electron. Notes Discret. Math., 2001)

On the p -Median polytope. - Pasquale Avella; Antonio Sassano (Math. Program., 2001)

Minimizing the span of d -walks to compute optimum frequency assignments. - Alessandro Avenali; Carlo Mannino; Antonio Sassano (Math. Program., 2002)

Models and solution techniques for frequency assignment problems. - Karen I. Aardal; Stan P. M. van Hoesel; Arie M. C. A. Koster; Carlo Mannino; Antonio Sassano (4OR, 2003)

A Complete Adaptive Algorithm for Propositional Satisfiability. - Renato Bruni; Antonio Sassano (Discret. Appl. Math., 2003)

An Enumerative Algorithm for the Frequency Assignment Problem. - Carlo Mannino; Antonio Sassano (Discret. Appl. Math., 2003)

A heuristic for large-scale p-median instances. - Pasquale Avella; Antonio Sassano; Igor Vasil'ev (Electron. Notes Discret. Math., 2003)

Metric inequalities and the Network Loading Problem. - Pasquale Avella; Sara Mattia; Antonio Sassano (Discret. Optim., 2007)

Computational study of large-scale p -Median problems. - Pasquale Avella; Antonio Sassano; Igor Vasil'ev (Math. Program., 2007)

Time offset optimization in digital broadcasting. - Carlo Mannino; Fabrizio Rossi; Antonio Sassano; Stefano Smriglio (Discret. Appl. Math., 2008)

Negative Cycle Separation in Wireless Network Design. - Fabio D'Andreagiovanni; Carlo Mannino; Antonio Sassano (INOC, 2011)

Planning wireless networks by shortest path. - Carlo Mannino; Sara Mattia; Antonio Sassano (Comput. Optim. Appl., 2011)

The Shortest Walk to Watch TV. - Fabrizio Rossi; Antonio Sassano; Stefano Smriglio (The Power of Algorithms, 2013)

GUB Covers and Power-Indexed Formulations for Wireless Network Design. - Fabio D'Andreagiovanni; Carlo Mannino; Antonio Sassano (Manag. Sci., 2013)

A reduction algorithm for the weighted stable set problem in claw-free graphs. - Paolo Nobili; Antonio Sassano (Discret. Appl. Math., 2014)

The Hirsch Conjecture for the fractional stable set polytope. - Carla Michini; Antonio Sassano (Math. Program., 2014)

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

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

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

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

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

An 풪(n2 log n) algorithm for the weighted stable set problem in claw-free graphs. - Paolo Nobili; Antonio Sassano (Math. Program., 2021)

Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study. - Pasquale Avella; Paolo Nobili; Antonio Sassano (IEEE Access, 2024)