default search action
Paolo Nobili
Person information
- affiliation: Department of Mathematics, University of Salento
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Pasquale Avella
, Paolo Nobili
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study. IEEE Access 12: 23725-23732 (2024) - 2021
- [j18]Paolo Nobili
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
- [j17]Paolo Nobili
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) - 2016
- [j16]Paolo Nobili
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4. Discret. Optim. 19: 63-78 (2016) - 2015
- [j15]Raffaele Mosca, Paolo Nobili
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. Graphs Comb. 31(5): 1649-1658 (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
- [j14]Paolo Nobili
A reduction algorithm for the weighted stable set problem in claw-free graphs. Discret. Appl. Math. 165: 245-262 (2014) - 2011
- [j13]János Barta, Valeria Leggieri, Roberto Montemanni
Minimum power multicasting in wireless networks under probabilistic node failures. Comput. Optim. Appl. 49(1): 193-212 (2011) - [c5]Paolo Nobili, Antonio Sassano:
A reduction algorithm for the weighted stable set problem in claw-free graphs. CTW 2011: 223-226 - 2010
- [j12]János Barta, Valeria Leggieri, Roberto Montemanni
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. Electron. Notes Discret. Math. 36: 463-470 (2010)
2000 – 2009
- 2008
- [j11]Valeria Leggieri, Paolo Nobili
Minimum power multicasting problem in wireless networks. Math. Methods Oper. Res. 68(2): 295-311 (2008) - [j10]Elisa Castorini, Paolo Nobili
Optimal routing and resource allocation in multi-hop wireless networks. Optim. Methods Softw. 23(4): 593-608 (2008) - 2006
- [j9]Anna Galluccio, Paolo Nobili
Improved approximation of maximum vertex cover. Oper. Res. Lett. 34(1): 77-84 (2006) - 2002
- [j8]David Avis, Caterina De Simone, Paolo Nobili
On the chromatic polynomial of a graph. Math. Program. 92(3): 439-452 (2002) - [j7]Hamish Waterer, Ellis L. Johnson, Paolo Nobili
The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Program. 93(3): 477-494 (2002) - 2000
- [c4]David Avis, Caterina De Simone, Paolo Nobili
Two Conjectures on the Chromatic Polynomial. LATIN 2000: 154-162
1990 – 1999
- 1998
- [j6]Paolo Nobili
(0, +-1) ideal matrices. Math. Program. 80: 265-281 (1998) - [j5]Sebastián Ceria, Paolo Nobili
A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81: 215-228 (1998) - 1995
- [c3]Paolo Nobili, Antonio Sassano:
(0, ±1) Ideal Matrices. IPCO 1995: 344-359 - 1993
- [j4]Paolo Nobili
The anti-join composition and polyhedra. Discret. Math. 119(1-3): 141-166 (1993) - [j3]Paolo Nobili
Polyhedral Properties of Clutter Amalgam. SIAM J. Discret. Math. 6(1): 139-151 (1993) - 1992
- [c2]Paolo Nobili, Antonio Sassano:
A Separation Routine for the Set Covering Polytope. IPCO 1992: 201-219 - 1990
- [j2]Maurizio Lenzerini
On the satisfiability of dependency constraints in entity-relationship schemata. Inf. Syst. 15(4): 453-461 (1990)
1980 – 1989
- 1989
- [j1]Paolo Nobili
Facets and lifting procedures for the set covering polytope. Math. Program. 45(1-3): 111-137 (1989) - 1987
- [c1]Maurizio Lenzerini, Paolo Nobili:
On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata. VLDB 1987: 147-154
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-20 22:56 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: