Sara Nicoloso

13 papers C 1Journal 12
YearRankTypeTitle / Venue / Authors
2017 J jnl
A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs.
CoRR
Tiziano Bacci, Sara Nicoloso
2017 J jnl
Vertex-colouring of 3-chromatic circulant graphs.
Discret. Appl. Math.
Sara Nicoloso, Ugo Pietropaoli
2014 J jnl
Bipartite finite Toeplitz graphs.
Discret. Appl. Math.
Sara Nicoloso, Ugo Pietropaoli
2014 J jnl
On the chromatic number of Toeplitz graphs.
Discret. Appl. Math.
Sara Nicoloso, Ugo Pietropaoli
2011 C conf
Bipartite finite Toeplitz graphs.
CTW
Sara Nicoloso, Ugo Pietropaoli
2010 J jnl
Coloring Toeplitz graphs.
Electron. Notes Discret. Math.
Sara Nicoloso, Ugo Pietropaoli
2007 J jnl
Shiftable intervals.
Ann. Oper. Res.
Federico Malucelli, Sara Nicoloso
2005 J jnl
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.
Electron. Notes Discret. Math.
Federico Malucelli, Sara Nicoloso
2004 J jnl
Sum coloring and interval graphs: a tight upper bound for the minimum number of colors.
Discret. Math.
Sara Nicoloso
2001 J jnl
Optimal partition of a bipartite graph into non-crossing matchings.
Electron. Notes Discret. Math.
Federico Malucelli, Sara Nicoloso
2000 J jnl
Shiftable Intervals.
Electron. Notes Discret. Math.
Federico Malucelli, Sara Nicoloso
1999 J jnl
On a 2-dimensional equipartition problem.
Eur. J. Oper. Res.
Francesco Conti, Federico Malucelli, Sara Nicoloso, Bruno Simeone
1999 J jnl
On the Sum Coloring Problem on Interval Graphs.
Algorithmica
Sara Nicoloso, Majid Sarrafzadeh, X. Song