Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Sara Nicoloso
Observed names:
NICOLOSO S,
Nicoloso, S.,
Nicoloso, Sara,
S Nicoloso,
S. Nicoloso
Institution:
Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
Observed institutions:
Bilkent University,
Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti,
Sapienza University of Rome
ORCID:
0000-0002-8825-2549
Observed ORCID:
0000-0002-8825-2549
OpenAlex ID:
A5014405584
On the Sum Coloring Problem on Interval Graphs
1999
·
S. Nicoloso
, M. Sarrafzadeh
, et al.
·
Algorithmica
·
69
On the chromatic number of Toeplitz graphs
2011
·
Sara Nicoloso
, Ugo Pietropaoli
·
Discrete Applied Mathematics
·
10
PDF
Vertex-colouring of 3-chromatic circulant graphs
2017
·
S. Nicoloso
, U. Pietropaoli
·
Discrete Applied Mathematics
·
9
PDF
Sum coloring and interval graphs: a tight upper bound for the minimum number of colors
2004
·
S Nicoloso
·
Discrete Mathematics
·
8
On the Benchmark Instances for the Bin Packing Problem with Conflicts
2020
·
Tiziano Bacci
, Sara Nicoloso
·
AIRO Springer series/AIRO Springer Series
·
5
PDF
On a 2-dimensional equipartition problem
1999
·
Francesco Conti
, Federico Malucelli
, et al.
·
European Journal of Operational Research
·
5
A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs
2017
·
Bacci, Tiziano
, Nicoloso, Sara
·
arXiv (Cornell University)
·
4
PDF
A Set Covering Formulation of the Matrix Equipartition Problem
1992
·
S. Nicoloso
, P. Nobili
·
Springer eBooks
·
4
Optimal partition of a bipartite graph into non-crossing matchings
2001
·
Federico Malucelli
, Sara Nicoloso
·
Electronic Notes in Discrete Mathematics
·
3
A set covering formulation of the matrix equipartition problem
2007
·
Sara Nicoloso
, Paolo Nobili
·
Springer eBooks
·
2
Shiftable intervals
2007
·
Federico Malucelli
, Sara Nicoloso
·
Annals of Operations Research
·
2
The PLA-folding problem: Simulated annealing and iterative improvement approaches
2005
·
Sara Nicoloso
, Maria Loredana Sales
·
Springer eBooks
·
2
The Dominating Set Problem on Shiftable Interval Graphs
1997
·
Federico Malucelli
, Sara Nicoloso
, et al.
·
OpenGrey (Institut de l'Information Scientifique et Technique)
·
2
The Maximum Independent Set problem on circulant graphs C n ( a , b )
2026
·
Pasquale Carotenuto
, Sara Nicoloso
, et al.
·
Discrete Applied Mathematics
·
1
Coloring Toeplitz graphs
2010
·
Sara Nicoloso
, Ugo Pietropaoli
·
Electronic Notes in Discrete Mathematics
·
1
Shiftable Intervals
2000
·
F. Malucelli
, S. Nicoloso
·
Electronic Notes in Discrete Mathematics
·
1
Vertex-colouring of some 3-chromatic circulant graphs Cn(a,b,c) where 3|gcd(n,a)
2026
·
Sara Nicoloso
·
Discrete Applied Mathematics
PDF
The Minimum Sum Coloring Problem on Circulant Graphs $$C_n(1,2)$$
2026
·
Eugenio Maria Cocco
, Sara Nicoloso
·
Lecture notes in computer science
Vertex-Colouring of Some 3-Chromatic Circulant Graphs $C_N(A,B,C)$ Where $3|\Gcd(N,A)$
2025
·
Sara Nicoloso
·
SSRN Electronic Journal
Vertex-Colouring of Some 3-Chromatic Circulant Graphs Cn(A, B, C) with Gcd(N, a) Mod 3 = 0
2023
·
Sara Nicoloso
·
SSRN Electronic Journal
Bipartite finite Toeplitz graphs
2013
·
Sara Nicoloso
, Ugo Pietropaoli
·
Discrete Applied Mathematics
PDF
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings
2005
·
Federico Malucelli
, Sara Nicoloso
·
Electronic Notes in Discrete Mathematics
Optimal partitioning of a bipartite graph into non-crossing matchings
2001
·
Federico Malucelli
, Sara Nicoloso
·
Virtual Community of Pathological Anatomy (University of Castilla La Mancha)
A Set Covering Formulation of the Matrix Equipartition Problem
1992
·
NICOLOSO S
, NOBILI, Paolo
·
AIRUS
Show more works
View as search
Works count:
27
Citation count:
129
H-index:
5
I10-index:
2
Year
Topic
Type
