Pubblicazioni

An O(n2logn) algorithm for the weighted stable set problem in claw-free graphs

2020 - MATHEMATICAL PROGRAMMING
Nobili, Paolo; Sassano, Antonio

A note on selective line-graphs and partition colorings

2019 - OPERATIONS RESEARCH LETTERS
Cornaz, D.; Furini, F.; Malaguti, E.; Santini, A.

An O(mlogn) algorithm for the weighted stable set problem in claw-free graphs with α(G)≤3

2017 - MATHEMATICAL PROGRAMMING
Nobili, Paolo; Sassano, Antonio

Solving vertex coloring problems as maximum weight stable set problems

2017 - DISCRETE APPLIED MATHEMATICS
Cornaz, D.; Furini, F.; Malaguti, E.

An O(n√m) algorithm for the weighted stable set problem in claw, net-free graphs with α(G)≥4

2016 - DISCRETE OPTIMIZATION
Nobili, Paolo; Sassano, Antonio

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma