Bio
Kazuo Iwama is a Visiting Chair Professor at National Tsing Hua University. He received his Ph.D. in Electrical Engineering from Kyoto University in 1980. His research interests include the design and analysis of algorithms, complexity theory, and quantum computation. He served as Editor-in-Chief of the EATCS Bulletin for more than eight years and has played leading roles in the organization of major international conferences, including SODA, ICALP, and LICS. He is a member of Academia Europaea, a founder of the Asian Association for Algorithms and Computation (AAAC), and a recipient of an honorary doctorate from the University of Latvia.
Bio
Peter Rossmanith is a professor of Theoretical Computer Science at RWTH Aachen University since 2003. He received his Ph.D. in Computer Science from the Technical University of Munich in 1994. His research focuses on parameterized complexity, kernelization, graph algorithms, and model checking. His contributions include work on kernelization using structural parameters on sparse graph classes, parameterized algorithms for treedepth and treewidth, and efficient first-order model checking on random graph models. He co-organized the Dagstuhl Seminar on optimality and tight results in parameterized complexity and serves as chair of the German National Computer Science Faculties Association (FTI) and associate editor of Computer Science Review.