Fedor V. Fomin


Title: Graph Modification Problems: A modern perspective

Brief Biography:

He 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.

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.

He is a member of editorial boards in algorithmica, SIAM J. Discrete Mathematics (SIDMA), and Information and Computation. He was a conference PC Chair in ICALP 2013, SWAT 2012, IWPEC 2009, and WG 2006. He was a member of steering Committees in IPEC from 2011 to 2012 and a member of steering Committees in WG since 2010. Moreover, he was involved in lots of conferences (talks, conference PCs, organization, etc.), such as, ESA 2014, STACS 2006, SODA 2007 etc.

Chee K. Yap


Title: Soft Subdivision Search in Motion Planning, II: Axiomatics

Brief Biography:

Chee Yap is Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University. He has published over 170 papers in the areas of computational geometry, visualization, computer algebra, robotics and complexity theory. His book "Fundamental Problems in Algorithmic Algebra" published by Oxford University Press (2000) is widely cited in algebraic computation. For many years, he has worked on Exact Geometric Computation, the most successful approach for attacking the numerical nonrobustness problem in geometric computing. His current interest in resolution-exactness extends this to wider classes of problems.

Chee Yap was born in Singapore and educated in Boys Wing, Royal Military College in Malaysia. He obtained a double BS degree in Computer Science and Mathematics from MIT in 1975, and a PhD from Yale in 1980, under Richard Lipton. He has served on editorial boards of various journals: SIAM Journal of Computing, Journal of Symbolic Computation, Algorithmica, JCSS, IJCGA, CGTA and MCS.

Jin-Yi Cai


Title: Is Valiant + FKT universal?

Brief Biography:

Jin-Yi Cai studied at Fudan University (class of 77). He received his Ph.D. from Cornell in 1986. After faculty positions at Yale, Princeton, SUNY Buffalo, he is currently Steenbock Professor at the University of Wisconsin--Madison.

He received a PYI Award in 1990, a Sloan Fellowship in 1994, a Guggenheim Fellowship in 1998. He was elected an ACM Fellow in 2001 and an AAAS Fellow in 2007.

An Editor of JCSS and several other journals, he works primarily in computational complexity theory. In the past 10 years he has been focused on the classification program of counting problems.