Paolo Nobili

According to our database, Paolo Nobili authored at least 24 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Power Reduction in FM Networks by Mixed-Integer Programming: A Case Study.

Pasquale Avella, Paolo Nobili, Antonio Sassano

IEEE Access, 2024

2021

An 풪(n² log n) algorithm for the weighted stable set problem in claw-free graphs.

Paolo Nobili, Antonio Sassano

Math. Program., 2021

2017

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

2016

An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4.

Paolo Nobili, Antonio Sassano

Discret. Optim., 2016

2015

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number.

Raffaele Mosca, Paolo Nobili

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$.

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}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$.

Paolo Nobili, Antonio Sassano

CoRR, 2015

2011

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

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

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

2008

Optimal routing and resource allocation in multi-hop wireless networks.

Elisa Castorini, Paolo Nobili, Chefi Triki

Optim. Methods Softw., 2008

Minimum power multicasting problem in wireless networks.

Valeria Leggieri, Paolo Nobili, Chefi Triki

Math. Methods Oper. Res., 2008

2006

Improved approximation of maximum vertex cover.

Anna Galluccio, Paolo Nobili

Oper. Res. Lett., 2006

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

On the chromatic polynomial of a graph.

David Avis, Caterina De Simone, Paolo Nobili

Math. Program., 2002

2000

Two Conjectures on the Chromatic Polynomial.

David Avis, Caterina De Simone, Paolo Nobili

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998

A Lagrangian-based heuristic for large-scale set covering problems.

Sebastián Ceria, Paolo Nobili, Antonio Sassano

Math. Program., 1998

1995

(0, ±1) Ideal Matrices.

Paolo Nobili, Antonio Sassano

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1993

Polyhedral Properties of Clutter Amalgam.

Paolo Nobili, Antonio Sassano

SIAM J. Discret. Math., 1993

The anti-join composition and polyhedra.

Paolo Nobili, Antonio Sassano

Discret. Math., 1993

1992

A Separation Routine for the Set Covering Polytope.

Paolo Nobili, Antonio Sassano

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1989

Facets and lifting procedures for the set covering polytope.

Paolo Nobili, Antonio Sassano

Math. Program., 1989

1987

On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata.

Maurizio Lenzerini, Paolo Nobili

Proceedings of the VLDB'87, 1987