Valentin Borozan

                     Home | About | Contact

Menu

Presentation

Doctorant : equipe Algorithmique et Complexité

Etude de graphes arête-coloriés.

CURRICULUM VITAE
Research Statements
Publications :

"Minimal Valid Inequalities for Integer Constraints"
Valentin Borozan and Gerard Cornuejols,
Mathematics of Operations Research, volume 34 (2009), pages 538-546.

"Maximum colored trees in edge-colored graphs" submitted Discrete Mathematics
V. Borozan, W. Fernandez de la Vega, Y. Manoussakis, C. A. Martinhon, R. Muthu and R. Saad

"Sufficient conditions for the existence of spanning colored trees in edge-colored graphs" submitted Discrete Mathematics
R. Agueda, V.Borozan, Y.Manoussakis, G.Mendy and R.Muthu

"Proper connection of graphs" submitted Discrete Mathematics
V.Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero and Z. Tuza

"Proper Hamiltonian Paths in Edge-Colored Multigraphs" work in progress
R. Agueda, V. Borozan, M. Groshaus, Y. Manoussakis, G. Mendy and L. Montero


Communications :
"Colored Trees in Edge-Colored Graphs", 8th CTW09, Paris, June 2009

"Sufficient conditions for the existence of spanning colored trees in edge-colored graphs", 8th French Combinatorial Conference [8FCC], Université Paris-Sud 11, Orsay, France

"Proper connection of graphs", 8th French Combinatorial Conference [8FCC], Université Paris-Sud 11, Orsay, France


Organizing committee: 8th French Combinatorial Conference [8FCC]. Université Paris Sud, Orsay, France


Teaching Experience:
Network Systems: 64 hours - IUT d'Orsay - University Paris-Sud 11
C++ and Algorithms: 64 hours - IUT d'Orsay - University Paris-Sud 11
Network Systems: 64 hours - IUT d'Orsay - University Paris-Sud 11
Algorithms C: 44 hours - IFIPS - University Paris-Sud 11
Algorithms: 21 hours
C++: 10 hours

#

 

Design downloaded from Free Templates - your source for free web templates