International 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 draft, doi) Elsevier© 

D. Porumbel. Isomorphism Testing using Polynomial-Time Graph Extensions. Journal of Mathematical Modelling and Algorithms, 10(2):119-143, 2011 (pdf draft, doi, isomorphism program GI-Ext) Springer© 

D. Porumbel, J-K. Hao and P. Kuntz. An Efficient Algorithm for Computing the Distance Between Close Partitions. Discrete Applied Mathematics, 159(1):53-59, 2011. (pdf draft, doi) Elsevier© 

D. Porumbel, J-K. Hao, F. Glover. A Simple and Effective Algorithm for the MaxMin Diversity Problem. Annals of Operations Research, 186 (1):275-293, 2011. (pdf, doi, program source code) Springer© 

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© 

International Conferences and Book Chapters:

D. Porumbel, J-K. Hao and P. Kuntz, Spacing Memetic Algorithms. In proceedings of GECCO 2011, GA track, 1061-1068. ACM. (pdf draft)

Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Porumbel, Recent advances in graph vertex coloring, In I. Zelinka, V. Snasel, A. Abraham (eds.), Handbook of Optimization, Springer© (Intelligent Systems Series)

D. Porumbel, J-K. Hao and P. Kuntz, Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. Evocop 2009 (9th European Conference on Evolutionary Computation in Combinatorial Optimisation, Tübingen, Germany), LNCS 5482: 121-132, 2009. (ps, pdf) Springer©  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 2009 (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© 

Scientific Activities

I received the Simon Régnier prize. This prize is awarded each year by the "Société Francophone de Classification" (French-speaking Classification Society) to a researcher of maximum 35 years with a PhD thesis on classification. (slides)

I accepted review invitations from the editorial board of several journals, including: Journal of Artificial Intelligence Research (open access, AAAI press), The Computer Journal (Oxford University Press), IEEE Transactions on Evolutionary Computation (IEEE Computer Society) Computers & Mathematics with Applications (Elsevier), Engineering Applications of Artificial Intelligence (Elsevier). I am in the program committee of Evocop 2012. Indirectly, I accepted writting reviews for papers (e.g., as a sub-reviewer) submitted to various conferences (e.g., ICTAI, CEC, GECCO, MOSIM).

I have created and maintain a Graph Coloring Library with the results (upper bounds) of the best algorithms on all instances from the second DIMACS Implementation Challenge. I started this work during my PhD thesis.

In teaching, I have been involved involved in very diverse topics over the years (e.g., networks, security, artificial intelligence, algorithms and complexity, compilation, operating systems, graphics, programming, etc.) at University of Artois, University of Angers, Univeristy of Nantes (Ecole Polytechnique) and University Politehnica of Bucharest (list and materials).

I am interested in various algorithmic methods for combinatorial optimization, operations research or discrete mathematics problems (isomorphism, transfer distance between partitions, graph coloring, MaxMin diversity, etc -- see publications above). I have an educational background in computing and engineering, but I have always been open to the mathematical side of Computer Science. I have a bronze medal at the International Mathematical Olympiad, a problem-solving competition with contestants from almost 100 countries (ranked 2nd in the qualification rounds of Romania).