( en | de | ru )

 

Disambiguation of "Nobili, Paolo"

Author of the publication

copydeleteadd this publication to your clipboard
An 풪(n2 log n) algorithm for the weighted stable set problem in claw-free graphs.

, and . Math. Program., 186 (1): 409-437 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Giordano Paolo

Paolo Molteni

Paolo Bavaj

Paolo Fornara

Paolo Varutti

 

Other publications of authors with the same name

A Separation Routine for the Set Covering Polytope., and . IPCO, page 201-219. Carnegie Mellon University, (1992)An 풪(n2 log n) algorithm for the weighted stable set problem in claw-free graphs., and . Math. Program., 186 (1): 409-437 (2021)A Lagrangian-based heuristic for large-scale set covering problems., , and . Math. Program., (1998)A reduction algorithm for the weighted stable set problem in claw-free graphs., and . CTW, page 223-226. (2011)Two Conjectures on the Chromatic Polynomial., , and . LATIN, volume 1776 of Lecture Notes in Computer Science, page 154-162. Springer, (2000)Minimum power multicasting problem in wireless networks., , and . Math. Methods Oper. Res., 68 (2): 295-311 (2008)Facets and lifting procedures for the set covering polytope., and . Math. Program., 45 (1-3): 111-137 (1989)On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata., and . VLDB, page 147-154. Morgan Kaufmann, (1987)Improved approximation of maximum vertex cover., and . Oper. Res. Lett., 34 (1): 77-84 (2006)(0, ±1) Ideal Matrices., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 344-359. Springer, (1995)