Paolo Nobili

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