Daniel Porumbel, PhD

Teaching and Research Assistant (ATER)
Metaheuristics, Optimization and Applications Team
LERIA CS. Laboratory,
Angers, France

Contact: porumbel AT info.univ-angers.fr, daniel.porumbel AT gmail.com
Just me

International communications

Journals

D. Porumbel, J-K. Hao and P. Kuntz, A Search Space "Cartography" for Guiding Graph Coloring Heuristics. Computers & Operations Research, 37(4):769-778, 2010. (pdf, doi) Elsevier© 

D. Porumbel, J-K. Hao and P. Kuntz, An Evolutionary Approach with Diversity Guarantee and Well-Informed Grouping Recombination for Graph Coloring, Computers & Operations Research, 37(10):1822-1832, 2010. (pdf draft, doi) Elsevier© 

Journal submissions (available on request):

[Reinforced Tabu Search for Graph Coloring. Submitted 2007], [An Efficient Algorithm for Computing the Partition Distance. Submitted 2009]

Conferences:

D. Porumbel, J-K. Hao and P. Kuntz, Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. Accepted at Evocop 2009 (9th European Conference on Evolutionary Computation in Combinatorial Optimisation, Tübingen, Germany), LNCS 5482: 121-132, 2009. (ps, pdf) Springer©  selected among the three best paper nominees

D. Porumbel, J-K. Hao and P. Kuntz, Position-Guided Tabu Search for Graph Coloring. Accepted for the post-proceedings of LION 3 (Learning and Intelligent OptimizatioN conference, Trento, Italy), LNCS 5851:148-162, 2009. (paper draft, slides) Springer©

D. Porumbel, J-K. Hao and P. Kuntz, A study of evaluation functions for the graph K-coloring problem. Selected papers from the 8th International Conference on Artificial Evolution (Tours, France), LNCS 4926: 124-135, 2008. (ps, pdf) Springer© 

Other communications:

Principles of Guiding Local Search Heuristics Towards Diversification and Intensification, Talk at the PhD seminar of the Computer Science department, Leicester University, United Kingdom, 2009 (slides)

PhD Thesis, Heuristic algorithms and learning techniques, applications to the graph coloring problem, (official French manuscript, English draft, slides in English), 2009

Reinforced Tabu Search for Graph Coloring, Talk at the ASAP (Automated Scheduling, Optimisation and Planning) research group seminar, University of Nottingham, United Kingdom, 2008 (slides)

Local (national) conferences and talks (mostly in French)

D. Porumbel, J-K. Hao and P. Kuntz, Diversity, Reactive Dispersion, and Informed Crossover in the Coloring Genetic Approach (in French), Presented at the 11th congress of the French Operational Research Society, Toulouse, France, 2010. (pdf, in French)

D. Porumbel. Position-guided diversification and intensification for graph coloring local search. Presented at the seminar of the team Symbiose, INRIA Rennes, 2010.

D. Porumbel, J-K. Hao and P. Kuntz, Guided Local Search for Graph Coloring (in French), Presented at the 10th congress of the French Operational Research Society, Nancy, France, 2009. (ps, pdf, in French)

D. Porumbel, J-K. Hao and P. Kuntz, A Guided Algorithm for Graph Coloring (in French), Talk at the Graphes and Algorithms workshop. Sophia-Antipolis, Nice, France, 2008 (slides, in french)

D. Porumbel, J-K. Hao and P. Kuntz, Reinforced Tabu Search for Graph Coloring, Presented at the 9th congress of the French Operational Research Society, Clermont-Ferrand, France, 2008. (ps, pdf, in French)

D. Porumbel, Nano-computers based on DNA (in French), Talk at the "Séminaire des Applications Statistiques et Informatiques aux Sciences Médicales", Université de Lille 2, France 2005 (slides, in French)

More[+]
Theses [+]

Other Research And Teaching Resources

I maintain a Graph Coloring Page with the perfomances of the best algorithms on all instances from the second Dimacs Implementation Challenge.
Course list (an archive of teaching notes that I wrote up since 2004)
Other notes (interesting mathematical facts, computer science projects, etc.)

Quick Facts

Between December 2006 and November 2009, I carried out my PhD concerning heuristic algorithms with learning techniques, supervised by Prof. Jin-Kao Hao (University of Angers, on the heuristic algorithms direction) and Prof. Pascale Kuntz Cosperec (University of Nantes, on the machine learning direction). I am interested in heuristic algorithms guided by position (i.e. using distance measures of the search space), meta-heuristics, hyper heuristics, combinatorial optimization and operations research problems, applying machine learning techniques to optimization (e.g. by recording the trajectory of the search process, search space analyses), evolutionary computation, etc. Apart from my main research directions, I have also carried out numerous projects on various other fields---see some examples in this archive. I am open to many research directions and I enjoy problem solving; I am an International Mathematical Olympiad medalist and I have always been interested in the mathematical side of Computer Science
  ˇ M.S. Knowledge Extraction from Data, Ecole Polytechnique de l'Université de Nantes, a joint degree program with Universities of Lyon, Université Paris Sud XI, (collaboration with University Politehnica of Bucharest) [class rank: 1/25]
  ˇ B.S. University "Politehnica" of Bucharest, Romania, Faculty of Automatic Control and Computers, Artificial Intelligence and Computer Graphics specialization.