Sara Nicoloso

Affiliations:

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

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

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2017

Vertex-colouring of 3-chromatic circulant graphs.

[BibT_eX]

[DOI]

Sara Nicoloso

Ugo Pietropaoli

Discret. Appl. Math., 2017

A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs.

[BibT_eX]

[DOI]

Tiziano Bacci

Sara Nicoloso

CoRR, 2017

2014

Bipartite finite Toeplitz graphs.

[BibT_eX]

[DOI]

Sara Nicoloso

Ugo Pietropaoli

Discret. Appl. Math., 2014

On the chromatic number of Toeplitz graphs.

[BibT_eX]

[DOI]

Sara Nicoloso

Ugo Pietropaoli

Discret. Appl. Math., 2014

2010

Coloring Toeplitz graphs.

[BibT_eX]

[DOI]

Sara Nicoloso

Ugo Pietropaoli

Electron. Notes Discret. Math., 2010

2005

Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.

[BibT_eX]

[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.

[BibT_eX]

[DOI]

Sara Nicoloso

Discret. Math., 2004

2001

Optimal partition of a bipartite graph into non-crossing matchings.

[BibT_eX]

[DOI]

Federico Malucelli

Sara Nicoloso

Electron. Notes Discret. Math., 2001

2000

Shiftable Intervals.

[BibT_eX]

[DOI]

Federico Malucelli

Sara Nicoloso

Electron. Notes Discret. Math., 2000

1999

On a 2-dimensional equipartition problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

On the Sum Coloring Problem on Interval Graphs.

[BibT_eX]

[DOI]

Sara Nicoloso

Majid Sarrafzadeh

X. Song

Algorithmica, 1999

Sara Nicoloso

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...