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

On the satisfiability of dependency constraints in entity-relationship schemata. - Maurizio Lenzerini; Paolo Nobili (Inf. Syst., 1990)

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

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)

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)

Two Conjectures on the Chromatic Polynomial. - David Avis; Caterina De Simone; Paolo Nobili (LATIN, 2000)

On the chromatic polynomial of a graph. - David Avis; Caterina De Simone; Paolo Nobili (Math. Program., 2002)

The relation of time indexed formulations of single machine scheduling problems to the node packing problem. - Hamish Waterer; Ellis L. Johnson; Paolo Nobili; Martin W. P. Savelsbergh (Math. Program., 2002)

Improved approximation of maximum vertex cover. - Anna Galluccio; Paolo Nobili (Oper. Res. Lett., 2006)

Minimum power multicasting problem in wireless networks. - Valeria Leggieri; Paolo Nobili; Chefi Triki (Math. Methods Oper. Res., 2008)

Optimal routing and resource allocation in multi-hop wireless networks. - Elisa Castorini; Paolo Nobili; Chefi Triki (Optim. Methods Softw., 2008)

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. - János Barta; Valeria Leggieri; Roberto Montemanni; Paolo Nobili; Chefi Triki (Electron. Notes Discret. Math., 2010)

Minimum power multicasting in wireless networks under probabilistic node failures. - János Barta; Valeria Leggieri; Roberto Montemanni; Paolo Nobili; Chefi Triki (Comput. Optim. Appl., 2011)

A reduction algorithm for the weighted stable set problem in claw-free graphs. - Paolo Nobili; Antonio Sassano (Discret. Appl. Math., 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)

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. - Raffaele Mosca; Paolo Nobili (Graphs Comb., 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)