Helsinki · Finland
20–24 August 2018
Claire Mathieu · CNRS, Paris
Claire Mathieu does research on the design and analysis of algorithms, with a focus on approximation algorithms, particularly approximation schemes for NP-hard problems. A former student of Ecole normale supérieure, she received a PhD in Computer Science in 1988 at Paris-Sud University. She has held research and faculty positions at CNRS, Paris-Sud University, Ecole Polytechnique, Brown University, and Collège de France. She is currently a CNRS research director in Paris, France.
Tim Roughgarden · Stanford
Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He joined the Stanford faculty in 2004, following a PhD at Cornell and a postdoc at UC Berkeley. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Social Choice and Welfare Prize, the Mathematical Programming Society’s Tucker Prize, and the EATCS-SIGACT Gödel Prize. He was an invited speaker at the 2006 International Congress of Mathematicians, the Shapley Lecturer at the 2008 World Congress of the Game Theory Society, and a Guggenheim Fellow in 2017. His books include Twenty Lectures on Algorithmic Game Theory (2016) and Algorithms Illuminated (2017).
Stefan Kratsch and Magnus Wahlström, the recipients of the EATCS-IPEC Nerode Prize 2018, will give an invited talk at IPEC 2018.
Mihai Pop · University of Maryland
Dr. Pop is a Professor in the Department of Computer Science and the Center for Bioinformatics and Computational Biology at the University of Maryland, College Park (UMCP) and currently serves as the Interim Director of the University of Maryland Institute for Advanced Computer Studies, and as the Director of the Center for Health-related Informatics and Bioimaging. Dr. Pop received his Ph.D. in Computer Science at Johns Hopkins University where he focused on algorithms for computer graphics and Geographic Information Systems (GIS) applications. Dr. Pop's current research interests include metagenomic assembly and analysis algorithms, software testing in bioinformatics, and dynamic models of microbial communities. His lab has developed a number of widely used open-source software tools, such as the assembly suite AMOS, the NGS aligner Bowtie, and the metagenomic assembly package MetAMOS. He also co-led the data analysis working group for the Human Microbiome Project and led the sub-group responsible for the assembly of the data generated in this project. Dr. Pop is actively involved in teaching at the undergraduate and graduate levels and is strongly interested in the development of educational resources for introductory computer science and bioinformatics.
Gerhard Woeginger · RWTH Aachen
Gerhard Woeginger is a professor at RWTH Aachen where he chairs the algorithms and complexity group. His research interests lie in the intersection area of Foundations of Computer Science, Discrete Mathematics and Operations Research. Concrete topics are approximation, scheduling, competitive analysis of online algorithms, parameterized complexity, graph theory; recently also algorithmic game theory and computational social choice.
Woeginger served as program chair of ESA 1997, ICALP 2003, the European Conference on Operational Research (EURO 2009), and of several other conferences. He received a Humboldt Research Award in 2011, and he was elected to the Academia Europaea in 2014.