Invited Speakers

Title & Abstract: To be announced

Biography: Paolo Ferragina is a professor of Computer Science at the Scuola Superiore Sant'Anna, Pisa. He got a PhD in Computer Science from the University of Pisa and a postdoc from the Max-Planck Institut für Informatik. He has served the University of Pisa as Vice Rector for Applied Research and Innovation (2010-16), as Director of the PhD Program in Computer Science (2017-20), and as Vice Rector for ICT (2019-22). His research focuses on the design of algorithms and data structures for compression, indexing, and retrieval of information from large collections of data. His work has led to some patents and 200+ articles published in leading peer-reviewed conferences and journals in the field. He is the author of five books written in Italian and English, the last one edited by Cambridge University Press. He is the co-recipient of the "2022 ACM Paris Kanellakis Theory and Practice award", and several other international awards.

Title & Abstract: To be announced

Biography: To be added

Title & Abstract: To be announced

Biography: Bart M. P. Jansen is an Associate Professor leading the Graph Algorithms group at Eindhoven University of Technology (TU/e). He received an MSc in Applied Computing Science from Utrecht University in 2009, followed by a PhD in 2013. Bart's research interests mainly concern parameterized algorithms for NP-hard graph problems, with a special focus on provably effective preprocessing (kernelization). He received a VENI grant from NWO, along with a Starting Grant from ERC. He was awarded the Christiaan Huygens Prize in ICT. Bart is an Associate Editor for ACM Transactions on Algorithms (TALG) and chairs the Steering Committee of PACE (Parameterized Algorithms and Computational Experiments Challenge). He won best paper awards at WG, MFCS, and IPEC.