default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Sassano
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Pasquale Avella
, Paolo Nobili, Antonio Sassano:
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study. IEEE Access 12: 23725-23732 (2024)- 2021
- [j39]Paolo Nobili, Antonio Sassano:
An 풪(n2 log n) algorithm for the weighted stable set problem in claw-free graphs. Math. Program. 186(1): 409-437 (2021)
2010 – 2019
- 2017
- [j38]Paolo Nobili, Antonio Sassano:
An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3. Math. Program. 164(1-2): 157-165 (2017) - [i5]Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano:
Negative Cycle Separation in Wireless Network Design. CoRR abs/1704.04656 (2017) - [i4]Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano:
GUB Covers and Power-Indexed formulations for Wireless Network Design. CoRR abs/1704.06674 (2017) - 2016
- [j37]Paolo Nobili, Antonio Sassano:
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4. Discret. Optim. 19: 63-78 (2016) - 2015
- [i3]Paolo Nobili, Antonio Sassano:
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$. CoRR abs/1501.05773 (2015) - [i2]Paolo Nobili, Antonio Sassano:
An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs. CoRR abs/1501.05775 (2015) - [i1]Paolo Nobili, Antonio Sassano:
An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$. CoRR abs/1501.05851 (2015) - 2014
- [j36]Paolo Nobili, Antonio Sassano:
A reduction algorithm for the weighted stable set problem in claw-free graphs. Discret. Appl. Math. 165: 245-262 (2014) - [j35]Carla Michini, Antonio Sassano:
The Hirsch Conjecture for the fractional stable set polytope. Math. Program. 147(1-2): 309-330 (2014) - 2013
- [j34]Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano:
GUB Covers and Power-Indexed Formulations for Wireless Network Design. Manag. Sci. 59(1): 142-156 (2013) - [p1]Fabrizio Rossi, Antonio Sassano, Stefano Smriglio:
The Shortest Walk to Watch TV. The Power of Algorithms 2013: 187-205 - 2011
- [j33]Carlo Mannino, Sara Mattia, Antonio Sassano:
Planning wireless networks by shortest path. Comput. Optim. Appl. 48(3): 533-551 (2011) - [c9]Paolo Nobili, Antonio Sassano:
A reduction algorithm for the weighted stable set problem in claw-free graphs. CTW 2011: 223-226 - [c8]Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano:
Negative Cycle Separation in Wireless Network Design. INOC 2011: 51-56
2000 – 2009
- 2008
- [j32]Carlo Mannino, Fabrizio Rossi, Antonio Sassano, Stefano Smriglio:
Time offset optimization in digital broadcasting. Discret. Appl. Math. 156(3): 339-351 (2008) - 2007
- [j31]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano:
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1): 79-129 (2007) - [j30]Pasquale Avella, Sara Mattia, Antonio Sassano:
Metric inequalities and the Network Loading Problem. Discret. Optim. 4(1): 103-114 (2007) - [j29]Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
Computational study of large-scale p -Median problems. Math. Program. 109(1): 89-114 (2007) - 2004
- [c7]Pasquale Avella, Sara Mattia, Antonio Sassano:
Metric Inequalities and the Network Loading Problem. IPCO 2004: 16-32 - 2003
- [j28]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano:
Models and solution techniques for frequency assignment problems. 4OR 1(4): 261-317 (2003) - [j27]Renato Bruni, Antonio Sassano:
A Complete Adaptive Algorithm for Propositional Satisfiability. Discret. Appl. Math. 127(3): 523-534 (2003) - [j26]Carlo Mannino, Antonio Sassano:
An Enumerative Algorithm for the Frequency Assignment Problem. Discret. Appl. Math. 129(1): 155-169 (2003) - [j25]Pasquale Avella, Antonio Sassano, Igor Vasil'ev:
A heuristic for large-scale p-median instances. Electron. Notes Discret. Math. 13: 14-17 (2003) - 2002
- [j24]Alessandro Avenali, Carlo Mannino, Antonio Sassano:
Minimizing the span of d -walks to compute optimum frequency assignments. Math. Program. 91(2): 357-374 (2002) - 2001
- [j23]Fabrizio Rossi, Stefano Smriglio, Antonio Sassano:
Models and Algorithms for Terrestrial Digital Broadcasting. Ann. Oper. Res. 107(1-4): 267-283 (2001) - [j22]Renato Bruni, Antonio Sassano:
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. Electron. Notes Discret. Math. 9: 162-173 (2001) - [j21]Pasquale Avella, Antonio Sassano:
On the p -Median polytope. Math. Program. 89(3): 395-411 (2001) - [c6]Renato Bruni, Antonio Sassano:
Errors Detection and Correction in Large Scale Data Collecting. IDA 2001: 84-94 - 2000
- [c5]Renato Bruni, Antonio Sassano:
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances. CP 2000: 495-499
1990 – 1999
- 1998
- [j20]Paolo Nobili, Antonio Sassano:
(0, +-1) ideal matrices. Math. Program. 80: 265-281 (1998) - [j19]Sebastián Ceria, Paolo Nobili, Antonio Sassano:
A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81: 215-228 (1998) - 1997
- [j18]Antonio Sassano:
Chair-Free Berge Graphs Are Perfect. Graphs Comb. 13(4): 369-395 (1997) - [j17]Anna Galluccio, Antonio Sassano:
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. J. Comb. Theory B 69(1): 1-38 (1997) - 1995
- [j16]Mario Lucertini, Giovanni Rinaldi, Antonio Sassano, Bruno Simeone:
Preface. Discret. Appl. Math. 62(1-3): 1-3 (1995) - [j15]Carlo Mannino, Antonio Sassano:
Solving hard set covering problems. Oper. Res. Lett. 18(1): 1-5 (1995) - [c4]Paolo Nobili, Antonio Sassano:
(0, ±1) Ideal Matrices. IPCO 1995: 344-359 - 1994
- [j14]Carlo Mannino, Antonio Sassano:
An exact algorithm for the maximum stable set problem. Comput. Optim. Appl. 3(3): 243-258 (1994) - 1993
- [j13]Caterina De Simone, Antonio Sassano:
Stability Number of Bull- and Chair-Free Graphs. Discret. Appl. Math. 41(2): 121-129 (1993) - [j12]Paolo Nobili, Antonio Sassano:
The anti-join composition and polyhedra. Discret. Math. 119(1-3): 141-166 (1993) - [j11]Paolo Nobili, Antonio Sassano:
Polyhedral Properties of Clutter Amalgam. SIAM J. Discret. Math. 6(1): 139-151 (1993) - [c3]Carlo Mannino, Antonio Sassano:
Edge projection and the maximum cardinality stable set problem. Cliques, Coloring, and Satisfiability 1993: 205-219 - 1992
- [j10]Monique Laurent, Antonio Sassano:
A characterization of knapsacks with the max-flow- - min-cut property. Oper. Res. Lett. 11(2): 105-110 (1992) - [c2]Paolo Nobili, Antonio Sassano:
A Separation Routine for the Set Covering Polytope. IPCO 1992: 201-219 - 1991
- [j9]Michele Conforti, M. R. Rao, Antonio Sassano:
The equipartition polytope. I: Formulations, dimension and basic facets. Math. Program. 49: 49-70 (1991) - [j8]Michele Conforti, M. R. Rao, Antonio Sassano:
The equipartition polytope. II: Valid inequalities and facets. Math. Program. 49: 71-90 (1991)
1980 – 1989
- 1989
- [j7]Paola Bertolazzi, Antonio Sassano:
A Decomposition Strategy for the Vertex Cover Problem. Inf. Process. Lett. 31(6): 299-304 (1989) - [j6]Manfred Padberg, Antonio Sassano:
The Complexity of Matching with Bonds. Inf. Process. Lett. 32(6): 297-300 (1989) - [j5]Gérard Cornuéjols, Antonio Sassano:
On the 0, 1 facets of the set covering polytope. Math. Program. 43(1-3): 45-55 (1989) - [j4]Antonio Sassano:
On the facial structure of the set covering polytope. Math. Program. 44(1-3): 181-202 (1989) - [j3]Paolo Nobili, Antonio Sassano:
Facets and lifting procedures for the set covering polytope. Math. Program. 45(1-3): 111-137 (1989) - 1988
- [j2]Paola Bertolazzi, Antonio Sassano:
A Class of Polynomially Solvable Set-Covering Problems. SIAM J. Discret. Math. 1(3): 306-316 (1988) - [c1]Alessandro D'Atri, Marina Moscarini, Antonio Sassano:
The Steiner Tree Problem and Homogeneous Sets. MFCS 1988: 249-261 - 1987
- [j1]Paola Bertolazzi, Antonio Sassano:
An O(mn) Algorithm for Regular Set-Covering Problems. Theor. Comput. Sci. 54: 237-247 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
