On the Sum Coloring Problem on Interval Graphs. - Sara Nicoloso; Majid Sarrafzadeh; X. Song (Algorithmica, 1999)

On a 2-dimensional equipartition problem. - Francesco Conti 002; Federico Malucelli; Sara Nicoloso; Bruno Simeone (Eur. J. Oper. Res., 1999)

Optimal partition of a bipartite graph into non-crossing matchings. - Federico Malucelli; Sara Nicoloso (Electron. Notes Discret. Math., 2001)

Sum coloring and interval graphs: a tight upper bound for the minimum number of colors. - Sara Nicoloso (Discret. Math., 2004)

Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings. - Federico Malucelli; Sara Nicoloso (Electron. Notes Discret. Math., 2005)

Shiftable intervals. - Federico Malucelli; Sara Nicoloso (Ann. Oper. Res., 2007)

Coloring Toeplitz graphs. - Sara Nicoloso; Ugo Pietropaoli (Electron. Notes Discret. Math., 2010)

On the chromatic number of Toeplitz graphs. - Sara Nicoloso; Ugo Pietropaoli (Discret. Appl. Math., 2014)

Bipartite finite Toeplitz graphs. - Sara Nicoloso; Ugo Pietropaoli (Discret. Appl. Math., 2014)

A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs. - Tiziano Bacci; Sara Nicoloso (CoRR, 2017)

Vertex-colouring of 3-chromatic circulant graphs. - Sara Nicoloso; Ugo Pietropaoli (Discret. Appl. Math., 2017)