Enumeration Algorithms & Exact Methods
For Exponential Problems in Computational Biology
September 23-28, 2012
University Residential Center
Bertinoro (Forlì-Cesena), Italy
ENUMEX is the first event organized by the AMICI International Partnership. The goal of ENUMEX is to focus on enumeration algorithms and exact methods for exponential problems with a particular focus on computational biology. The School is addressed to young researchers at the PhD student or postdoc level, but may, depending on space, greet other interested listeners. The scope of ENUMEX is international.
Prof. Dr. Martin E. Dyer is from the Computer Science Department of the University of Leeds. He has published over a 100 papers, the majority of them as publication in top-journals in the field or as contribution to proceedings of the most prestigious, highly selective, conferences in the field. Since over 20 years his main research topic is the study of rapidly mixing Markov Chains in relation to approximate counting. In 1991 he won the Fulkerson Prize of the Mathematical Programming Society for his work on computing the volume of convex bodies, essentially a counting problem. The approach is Markov Chain Monte Carlo simulation. The breakthrough was a polynomial bound on the convergence time of this Markov Chain. Since then he has become one of the authorities in this field of approximate counting and approximate uniform random generation.
Khaled Elbassioni is a senior researcher at Max-Planck Institute for Informatics. He received B.Sc. and M.Sc. degrees in Computer Science from Alexandria University, Egypt in 1992 and 1995, respectively, and a Ph.D. degree in Computer Science from Rutgers University, USA, in 2002. His main interests are in Theoretical Computer Science, in particular, in the complexity of enumeration problems, approximation algorithms, and game theory.
Fedor received his Master (1992) and PhD (1997) degrees from the Faculty of Mathematics and Mechanics, St. Petersburg State University, supervised by Prof. Nikolay Petrov. He was an assistant professor at St. Petersburg State University (chair of Operations Research) till 1999. He was a postdoc in Chile (CMM and Universidad de Chile), in Czech Republic (ITI and Charles University), and in Germany (University of Paderborn). Since 2002, he is a professor in Algorithms, at the Department of Informatics, University of Bergen. In 2004 he received Young Investigator Award (YFF) from Norwegian Research Council and in 2010 Advanced Grant from European Research Council. His current research interests are mainly in Algorithms and Combinatorics: Parameterized Complexity; Algorithms, and Kernelization; Exact (exponential time) Algorithms; Graph Algorithms and, in particular, Algorithmic Graph Minors; Graph Coloring and different modifications; Graph widths parameters (treewidth, branchwidth, clique-width, etc.); Pursuit-evasion and Search problems.
Takeaki Uno received the Ph.D. degree from Department of Systems Science, Tokyo Institute of Technology Japan, 1998. He was an assistant professor in Department of Industrial and Management Science in Tokyo Institute of Technology from 1998 to 2001, and has been an associate professor of National Institute of Informatics Japan, from 2001. His research topic is discrete algorithms, especially enumeration algorithms, algorithms on graph classes, and data mining algorithms. On the theoretical part, he studies low degree polynomial time algorithms, and hardness proofs. In the application area, he works on the paradigm of constructing practically efficient algorithms for large scale data that are data oriented and theoretically supported. In an international frequent patterm mining competition in 2004 he won the best implementation award. He got Young Scientists'Prize, of The Commendation for Science and Technology in Japan, in 2010.