We stand with Ukraine  

Sara Nicoloso

Affiliations:
  • Institute for Systems Analysis and Computer Science, Italian National Research Council


According to our database1, Sara Nicoloso authored at least 11 papers between 1999 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Vertex-colouring of 3-chromatic circulant graphs.
[BibTeX]
[DOI]
Sara Nicoloso
,
Ugo Pietropaoli
Discret. Appl. Math., 2017

A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs.
[BibTeX]
[DOI]
Tiziano Bacci
,
Sara Nicoloso
CoRR, 2017

2014
Bipartite finite Toeplitz graphs.
[BibTeX]
[DOI]
Sara Nicoloso
,
Ugo Pietropaoli
Discret. Appl. Math., 2014

On the chromatic number of Toeplitz graphs.
[BibTeX]
[DOI]
Sara Nicoloso
,
Ugo Pietropaoli
Discret. Appl. Math., 2014

2010
Coloring Toeplitz graphs.
[BibTeX]
[DOI]
Sara Nicoloso
,
Ugo Pietropaoli
Electron. Notes Discret. Math., 2010

2007
Shiftable intervals.
[BibTeX]
[DOI]
Federico Malucelli
,
Sara Nicoloso
Ann. Oper. Res., 2007

2005
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.
[BibTeX]
[DOI]
Federico Malucelli
,
Sara Nicoloso
Electron. Notes Discret. Math., 2005

2004
Sum coloring and interval graphs: a tight upper bound for the minimum number of colors.
[BibTeX]
[DOI]
Sara Nicoloso
Discret. Math., 2004

2001
Optimal partition of a bipartite graph into non-crossing matchings.
[BibTeX]
[DOI]
Federico Malucelli
,
Sara Nicoloso
Electron. Notes Discret. Math., 2001

1999
On a 2-dimensional equipartition problem.
[BibTeX]
[DOI]
Francesco Conti
,
Federico Malucelli
,
Sara Nicoloso
,
Bruno Simeone
Eur. J. Oper. Res., 1999

On the Sum Coloring Problem on Interval Graphs.
[BibTeX]
[DOI]
Sara Nicoloso
,
Majid Sarrafzadeh
,
X. Song
Algorithmica, 1999


  Loading...