44th International Symposium on

Mathematical Foundations of Computer Science

August 26-30, 2019, Aachen (Germany)


EATCS
MFCS 2019 is organized in cooperation with EATCS
 

  

Invited Speakers


Jérôme Leroux (LaBRI, Talence)

Jérôme Leroux

Jérôme Leroux is a CNRS senior researcher, head of the Formal Methods team of the computer science laboratory of Bordeaux (LaBRI) in France. He did his PhD under the supervision of Alain Finkel at the computer science laboratory of Cachan (LSV) in France on the model-checking of counter machines (defended in 2003). Over the past twenty years, he has been involved in several national and international research projects in the areas of the formal verification of infinite state systems, supported by several research grants from governmental research agencies. He worked on automata approaches for solving the Presburger arithmetic up to 2006 before starting his research project on the reachability problem for vector addition systems, also known as Petri nets, one of the central problem in theoretical computed science. In 2009 a provided a new approach for solving that problem based on Presburger inductive invariants. Very recently, in 2015 and 2018, he provided with his coauthors the very first complexity upper-bound and improved the best known lower-bound of the reachability problem for vector addition systems, a 40 years old open problem.


Daniel Lokshtanov (University of California at Santa Barbara (UCSB))

Daniel Logshtanov

Daniel Lokshtanov received his PhD in Computer Science (2009), from the University of Bergen. Lokshtanov spent two years (2010-2012) as a Simons Postdoctoral Fellow at University of California at San Diego, six years (2012-2018) as a faculty member at the University of Bergen and is now an Associate Professor at the Department of Computer Science at the University of California Santa Barbara. His main research interests are in graph algorithms, parameterized algorithms and complexity. He is a co-author of the recent Parameterized Algorithms book.


Kurt Mehlhorn (Max-Planck-Institut für Informatik, Saarbrücken)

Kurt Mehlhorn

Kurt Mehlhorn is a Director of the MPI for Informatics and Professor of Computer Science at Saarland University. He heads the algorithms and complexity group at the MPI for Informatics. He works on data structures and algorithms in a broad sense. He co-authored some 300 publications in the field, published six books, and is one of the people behind the LEDA software library. He supervised more than 100 PhD-students and postdocs, many of whom have now faculty positions. He has received several prizes (Leibniz Award, Beckurts Award, Zuse Medal, Humboldt Award, EATCS Award, ACM Paris Kanellakis Theory and Practice Award, Erasmus Medal of the Academia Europaea) for his work. He holds Honorary Doctorate Degrees from Magdeburg, Waterloo, Aarhus, Gothenburg, and Patras universities and is an ACM Fellow. He is a member of the German Academy of Sciences Leopoldina, Academia Europaea, the German Academy of Science and Engineering acatech, the US Academy of Engineering, and the US Academy of Science. From 2002 to 2008, he was vice president of the Max Planck Society. He is a co-founder of Algorithmic Solutions Software GmbH.


Alexandra Silva (University College London)

Alexandra Silva

Alexandra Silva is a theoretical computer scientist whose main research focuses on semantics of programming languages and modular development of algorithms for computational models. A lot of her work uses the unifying perspective offered by coalgebra, a mathematical framework established in the last decades. Alexandra is currently a Professor of Algebra, Semantics, and Computation at University College London. Previously, she was an assistant professor in Nijmegen and a post-doc at Cornell University, with Prof. Dexter Kozen, and a PhD student at the Dutch national research center for Mathematics and Computer Science (CWI), under the supervision of Prof. Jan Rutten and Dr. Marcello Bonsangue. She was the recipient of the Needham Award 2018, the Presburger Award 2017, the Leverhulme prize 2016, and an ERC starting Grant in 2015.


Kavitah Telikepalli (Tata Institute of Fundamental Research, Mumbai)

Kavitah Telikepalli

Kavitha Telikepalli is an Associate Professor at the Tata Institute of Fundamental Research (TIFR), Mumbai. She works in combinatorial optimization and efficient graph algorithms. She has worked on matchings under preferences, spanners and related problems on approximate distances, min-cuts and Gomory-Hu trees, and minimum cycle basis algorithms. She did her PhD from TIFR Mumbai and was a post-doctoral researcher at Max-Planck-Institut für Informatik, Saarbrücken. She was an Assistant Professor at Indian Institute of Science, Bangalore before joining the faculty of TIFR Mumbai. She is currently an Associate Editor of ACM Transactions on Algorithms.

Important Dates

Paper submission deadline:    Monday April 22nd, 2019 (AoE)  
Notification of authors: Wednesday, June 12th, 2019   
Early registration deadline: To be announced   
Late registration deadline: To be announced   
Conference dates: August 26th–30th, 2019

Contact: Peter Rossmanith mfcs2019@cs.rwth-aachen.de