Paolo Nobili - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2024

Power Reduction in FM Networks by Mixed-Integer Programming: A Case StudyPasquale Avella, Paolo Nobili, Antonio Sassano. access, 12:23725-23732, 2024. [doi]

2021

2 log n) algorithm for the weighted stable set problem in claw-free graphsPaolo Nobili, Antonio Sassano. mp, 186(1):409-437, 2021. [doi]

2016

An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4Paolo Nobili, Antonio Sassano. disopt, 19:63-78, 2016. [doi]

2015

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching NumberRaffaele Mosca, Paolo Nobili. gc, 31(5):1649-1658, 2015. [doi]

2014

A reduction algorithm for the weighted stable set problem in claw-free graphsPaolo Nobili, Antonio Sassano. DAM, 165:245-262, 2014. [doi]

2011

Minimum power multicasting in wireless networks under probabilistic node failuresJános Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki. coap, 49(1):193-212, 2011. [doi]

A reduction algorithm for the weighted stable set problem in claw-free graphsPaolo Nobili, Antonio Sassano. colognetwente 2011: 223-226 [doi]

2010

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting ProblemJános Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki. endm, 36:463-470, 2010. [doi]

2008

Optimal routing and resource allocation in multi-hop wireless networksElisa Castorini, Paolo Nobili, Chefi Triki. oms, 23(4):593-608, 2008. [doi]

Minimum power multicasting problem in wireless networksValeria Leggieri, Paolo Nobili, Chefi Triki. mmor, 68(2):295-311, 2008. [doi]

2006

Improved approximation of maximum vertex coverAnna Galluccio, Paolo Nobili. orl, 34(1):77-84, 2006. [doi]

2002

On the chromatic polynomial of a graphDavid Avis, Caterina De Simone, Paolo Nobili. mp, 92(3):439-452, 2002. [doi]

2000

Two Conjectures on the Chromatic PolynomialDavid Avis, Caterina De Simone, Paolo Nobili. latin 2000: 154-162

1998

A Lagrangian-based heuristic for large-scale set covering problemsSebastián Ceria, Paolo Nobili, Antonio Sassano. mp, 81:215-228, 1998.

(0, +-1) ideal matricesPaolo Nobili, Antonio Sassano. mp, 80:265-281, 1998.

1995

(0, ±1) Ideal MatricesPaolo Nobili, Antonio Sassano. ipco 1995: 344-359

1993

The anti-join composition and polyhedraPaolo Nobili, Antonio Sassano. DM, 119(1-3):141-166, 1993. [doi]

Polyhedral Properties of Clutter AmalgamPaolo Nobili, Antonio Sassano. siamdm, 6(1):139-151, 1993.

1992

A Separation Routine for the Set Covering PolytopePaolo Nobili, Antonio Sassano. ipco 1992: 201-219

1990

On the satisfiability of dependency constraints in entity-relationship schemataMaurizio Lenzerini, Paolo Nobili. is, 15(4):453-461, 1990.

1989

Facets and lifting procedures for the set covering polytopePaolo Nobili, Antonio Sassano. mp, 45(1-3):111-137, 1989. [doi]

1987

On The Satisfiability of Dependency Constraints in Entity-Relationship SchemataMaurizio Lenzerini, Paolo Nobili. VLDB 1987: 147-154 [doi]

Sign in or sign up to see more results.

runs on WebDSL