Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Paolo Nobili
Author information
- Department of Mthematics, University of Salento
2010 – today
- 2011
[j11]János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki: Minimum power multicasting in wireless networks under probabilistic node failures. Comp. Opt. and Appl. 49(1): 193-212 (2011)- [c5]Paolo Nobili, Antonio Sassano: A reduction algorithm for the weighted stable set problem in claw-free graphs. CTW 2011: 223-226
- 2010
- [j10]János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki: Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. Electronic Notes in Discrete Mathematics 36: 463-470 (2010)
2000 – 2009
- 2008
- [j9]Valeria Leggieri, Paolo Nobili, Chefi Triki: Minimum power multicasting problem in wireless networks. Math. Meth. of OR 68(2): 295-311 (2008)
- 2006
- [j8]Anna Galluccio, Paolo Nobili: Improved approximation of maximum vertex cover. Oper. Res. Lett. 34(1): 77-84 (2006)
- 2002
- [j7]David Avis, Caterina De Simone, Paolo Nobili: On the chromatic polynomial of a graph. Math. Program. 92(3): 439-452 (2002)
- [j6]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): 477-494 (2002)
- 2000
- [c4]David Avis, Caterina De Simone, Paolo Nobili: Two Conjectures on the Chromatic Polynomial. LATIN 2000: 154-162
1990 – 1999
- 1998
- [j5]
- [j4]Sebastián Ceria, Paolo Nobili, Antonio Sassano: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81: 215-228 (1998)
- 1995
- [c3]
- 1993
- [j3]Paolo Nobili, Antonio Sassano: The anti-join composition and polyhedra. Discrete Mathematics 119(1-3): 141-166 (1993)
- [j2]Paolo Nobili, Antonio Sassano: Polyhedral Properties of Clutter Amalgam. SIAM J. Discrete Math. 6(1): 139-151 (1993)
- 1992
- [c2]Paolo Nobili, Antonio Sassano: A Separation Routine for the Set Covering Polytope. IPCO 1992: 201-219
- 1990
- [j1]Maurizio Lenzerini, Paolo Nobili: On the satisfiability of dependency constraints in entity-relationship schemata. Inf. Syst. 15(4): 453-461 (1990)
1980 – 1989
- 1987
- [c1]Maurizio Lenzerini, Paolo Nobili: On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata. VLDB 1987: 147-154
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:49 CET by the dblp team