Paolo Nobili

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 4

Top Topics

Detection Algorithm

Power Reduction

Experimental Evaluation

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

Pasquale Avella, Paolo Nobili, Antonio Sassano
Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study. IEEE Access 12 (2024)
Paolo Nobili, Antonio Sassano
log n) algorithm for the weighted stable set problem in claw-free graphs. Math. Program. 186 (1) (2021)
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) (2017)
Paolo Nobili, Antonio Sassano
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4. Discret. Optim. 19 (2016)
Paolo Nobili, Antonio Sassano
An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs. CoRR (2015)
Raffaele Mosca, Paolo Nobili
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. Graphs Comb. 31 (5) (2015)
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 (2015)
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 (2015)
Paolo Nobili, Antonio Sassano
A reduction algorithm for the weighted stable set problem in claw-free graphs. Discret. Appl. Math. 165 (2014)
Paolo Nobili, Antonio Sassano
A reduction algorithm for the weighted stable set problem in claw-free graphs. CTW (2011)
János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki
Minimum power multicasting in wireless networks under probabilistic node failures. Comput. Optim. Appl. 49 (1) (2011)
János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. Electron. Notes Discret. Math. 36 (2010)
Elisa Castorini, Paolo Nobili, Chefi Triki
Optimal routing and resource allocation in multi-hop wireless networks. Optim. Methods Softw. 23 (4) (2008)
Valeria Leggieri, Paolo Nobili, Chefi Triki
Minimum power multicasting problem in wireless networks. Math. Methods Oper. Res. 68 (2) (2008)
Anna Galluccio, Paolo Nobili
Improved approximation of maximum vertex cover. Oper. Res. Lett. 34 (1) (2006)
Hamish Waterer, Ellis L. Johnson, Paolo Nobili, Martin W. P. Savelsbergh
The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Program. 93 (3) (2002)
David Avis, Caterina De Simone, Paolo Nobili
On the chromatic polynomial of a graph. Math. Program. 92 (3) (2002)
David Avis, Caterina De Simone, Paolo Nobili
Two Conjectures on the Chromatic Polynomial. LATIN (2000)
Paolo Nobili, Antonio Sassano
(0, +-1) ideal matrices. Math. Program. 80 (1998)
Sebastián Ceria, Paolo Nobili, Antonio Sassano
A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81 (1998)
Paolo Nobili, Antonio Sassano
(0, ±1) Ideal Matrices. IPCO (1995)
Paolo Nobili, Antonio Sassano
The anti-join composition and polyhedra. Discret. Math. 119 (1-3) (1993)
Paolo Nobili, Antonio Sassano
Polyhedral Properties of Clutter Amalgam. SIAM J. Discret. Math. 6 (1) (1993)
Paolo Nobili, Antonio Sassano
A Separation Routine for the Set Covering Polytope. IPCO (1992)
Maurizio Lenzerini, Paolo Nobili
On the satisfiability of dependency constraints in entity-relationship schemata. Inf. Syst. 15 (4) (1990)
Paolo Nobili, Antonio Sassano
Facets and lifting procedures for the set covering polytope. Math. Program. 45 (1-3) (1989)
Maurizio Lenzerini, Paolo Nobili
On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata. VLDB (1987)