PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Caramia, Massimiliano"

Author of the publication

copydeleteadd this publication to your clipboard
A lower bound on the chromatic number of Mycielski graphs.

, and . Discrete Mathematics, 235 (1-3): 79-86 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Caramia, Massimiliano
add a person with the name Caramia, Massimiliano
 

Other publications of authors with the same name

Mengerian quasi-graphical families and clutters., and . Eur. J. Comb., 34 (3): 647-659 (2013)An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations., and . European Journal of Operational Research, 219 (1): 73-85 (2012)A fast heuristic algorithm for the maximum concurrent k-splittable flow problem., and . Optimization Letters, 4 (1): 37-55 (2010)An Economic Model for Resource Allocation in Grid Computing., and . Operations Research, 59 (4): 956-972 (2011)A lower bound on the chromatic number of Mycielski graphs., and . Discrete Mathematics, 235 (1-3): 79-86 (2001)On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing., and . Discrete Mathematics, 308 (16): 3699-3703 (2008)An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations., and . CTW, page 210-214. (2009)New lower bounds on the weighted chromatic number of a graph., and . Discussiones Mathematicae Graph Theory, 24 (2): 183-195 (2004)Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic., , , and . Algorithms, 3 (3): 294-310 (2010)On the Galois Lattice of Bipartite Distance Hereditary Graphs., , and . IWOCA, volume 8986 of Lecture Notes in Computer Science, page 37-48. Springer, (2014)