Address

Tor Vergata
Stanza: 406

Sara Nicoloso

Role: Senior Researcher

Research group: OPTIMA

My research interests are Classical Combinatorial Optimisation Problems on special classes of Graphs. In particular, I’m interested in exact solution for problems such as Min Colouring, Min Sum Colouring, Graph Searching, and Max Independent Set on Circulant and Toeplitz graphs.
Settore ERC:
PE1_16: Discrete Mathematics and Combinatorics

Recent publications

  1. 2018
    On the benchmark instances for the Bin Packing with Conflicts
    Tiziano Bacci, Sara Nicoloso
  2. 2018
    A heuristic algorithm for the Bin Packing Problem with Conflicts on interval graphs
    Tiziano Bacci, Sara Nicoloso
  3. 2017
    A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs
    Tiziano Bacci, Sara Nicoloso
  4. 2018
    On the benchmark instances for the Bin Packing with Conflicts
    Tiziano Bacci, Sara Nicoloso
  5. 2018
    A heuristic algorithm for the Bin Packing Problem with Conflicts on interval graphs
    Tiziano Bacci, Sara Nicoloso
  6. 2017
    A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs
    Tiziano Bacci, Sara Nicoloso
  7. 2018
    On the benchmark instances for the Bin Packing with Conflicts
    Tiziano Bacci, Sara Nicoloso
  8. 2018
    A heuristic algorithm for the Bin Packing Problem with Conflicts on interval graphs
    Tiziano Bacci, Sara Nicoloso
  9. 2017
    A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs
    Tiziano Bacci, Sara Nicoloso
  10. 2018
    On the benchmark instances for the Bin Packing with Conflicts
    Tiziano Bacci, Sara Nicoloso