Dr. Marek Cygan is an assistant professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include fixed parameter tractability, approximation algorithms, and exact exponential algorithms. Prof. Fedor V. Fomin is a professor of algorithms in the Dept. of Informatics of the University of Bergen, Norway. His research interests are largely in ... Read morethe areas of algorithms and combinatorics, in particular: parameterized complexity, algorithms, and kernelization; exact (exponential time) algorithms; graph algorithms, in particular algorithmic graph minors; graph coloring and different modifications; graph widths parameters (treewidth, branchwidth, clique-width, etc.); and pursuit-evasion and search problems. Dr. Hab. Lukasz Kowalik is an associate professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include algorithms and graph theory, in particular approximation algorithms, exact algorithms for NP-hard problems, planar graphs, and graph coloring. Dr. Daniel Lokshtanov is a junior faculty member of the Dept. of Informatics of the University of Bergen, Norway. His research focuses on algorithmic graph theory, and he is the project leader for BeHard, a research project on kernelization. Dr. Daniel Marx is a senior research fellow at the Institute for Computer Science and Control (SZTAKI) of the Hungarian Academy of Sciences, Budapest, Hungary. His research areas include discrete algorithms, parameterized complexity, and graph theory. Dr. Marcin Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research focuses on algorithmics, especially fixed parameter tractability and exact computations of NP-hard problems. Dr. Michal Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research areas include parameterized complexity, moderately exponential-time algorithms, and kernelization. Prof. Saket Saurabh is a member of the Theoretical Computer Science (TCS) group of The Institute of Mathematical Sciences (CIT Campus) in Chennai, India. His research interests include algorithms and graph theory, in particular, parameterized and exact algorithms. Show Less