Claudia Snels

According to our database, Claudia Snels authored at least 7 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Minimum weighted clique cover on claw-free perfect graphs.

Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels

J. Graph Theory, 2021

2013

Knowledge Management and Routing in Embodied Agents Network.

Claudio Moriconi, Claudia Snels

Proceedings of the 3rd IFAC Symposium on Telematics Applications, 2013

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.

Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.

Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).

Yuri Faenza, Gianpaolo Oriolo, Claudia Snels

Oper. Res. Lett., 2011

A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)

Yuri Faenza, Gianpaolo Oriolo, Claudia Snels

CoRR, 2011

A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.

Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011