Sara Nicoloso

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

	2011
c1		Sara Nicoloso, Ugo Pietropaoli: Bipartite finite Toeplitz graphs. CTW 2011: 219-222
	2010
j8		Sara Nicoloso, Ugo Pietropaoli: Coloring Toeplitz graphs. Electronic Notes in Discrete Mathematics 36: 567-574 (2010)
	2007
j7		Federico Malucelli, Sara Nicoloso: Shiftable intervals. Annals OR 150(1): 137-157 (2007)
	2005
j6		Federico Malucelli, Sara Nicoloso: Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings. Electronic Notes in Discrete Mathematics 22: 507-513 (2005)
	2004
j5		Sara Nicoloso: Sum coloring and interval graphs: a tight upper bound for the minimum number of colors. Discrete Mathematics 280(1-3): 251-257 (2004)
	2001
j4		Federico Malucelli, Sara Nicoloso: Optimal partition of a bipartite graph into non-crossing matchings. Electronic Notes in Discrete Mathematics 10: 187-191 (2001)
	2000
j3		Federico Malucelli, Sara Nicoloso: Shiftable Intervals. Electronic Notes in Discrete Mathematics 5: 214-217 (2000)
	1999
j2		Sara Nicoloso, Majid Sarrafzadeh, X. Song: On the Sum Coloring Problem on Interval Graphs. Algorithmica 23(2): 109-126 (1999)
j1		Francesco Conti, Federico Malucelli, Sara Nicoloso, Bruno Simeone: On a 2-dimensional equipartition problem. European Journal of Operational Research 113(1): 215-231 (1999)

Coauthor Index

Colors in the list of coauthors

Last update Tue May 21 18:57:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page