Paolo Nobili
Orcid: 0000-0003-4016-853XAffiliations:
- Department of Mathematics, University of Salento
According to our database1,
Paolo Nobili
authored at least 24 papers
between 1989 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dm.unile.it
On csauthors.net:
Bibliography
2024
IEEE Access, 2024
2021
An 풪(n<sup>2</sup> log n) algorithm for the weighted stable set problem in claw-free graphs.
Math. Program., 2021
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
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number.
Graphs Comb., 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
Discret. Appl. Math., 2014
2011
Comput. Optim. Appl., 2011
2010
Electron. Notes Discret. Math., 2010
2008
Optim. Methods Softw., 2008
Math. Methods Oper. Res., 2008
2006
2002
The relation of time indexed formulations of single machine scheduling problems to the node packing problem.
Math. Program., 2002
2000
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
1998
Math. Program., 1998
1993
1992
A Separation Routine for the Set Covering Polytope.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1990
Inf. Syst., 1990
1989