Assistant professor in Algorithms and Complexity
Department of Computer Science, Aalto University
My broad area of research interests is in theoretical computer science. More specifically, I study various aspects of efficient computations: approximation algorithms, hardness of approximation, data structures, and online algorithms. I completed my PhD from the department of computer science, University of Chicago in 2012, under the supervision of Julia Chuzhoy (at TTI-C) and Janos Simon.
After my Ph.D, I did a short (and yet very pleasant) postdoc at IDSIA. Afterwards, I spent 3.5 years rising from a postdoc to a senior researcher at Max Planck Institute for Informatics. I started assistant professorship at Aalto in August 2016.
I was a recipient of Simons-Berkeley Research Fellowship in 2017, attending the great 'jumbo' program on Bridging Continuous and Discrete Optimization. From 2018, my research has been generously supported by A Starting Grant from European Research Council (ERC) and Academy of Finland Research Fellowship. At least until 2022, there will occasionally be opening positions in my research group. Highly motivated students and postdocs in TCS are strongly encouraged to contact me any time.
- I am on ICALP 2019 (Track A) program committee. Please submit your excellent papers there!
- Dagstuhl's seminar on Parameterized Complexity. January 2019
- Reunion Meeting for "Bridging Continuous & Discrete Optimization" at Simons Institute. December 2018.
- ALGO 2018 (August 20 - 24, 2018)
- I am on APPROX 2018 program committee. August 2018.
- I am speaking at Parameterized Approximation Algorithms Workshop (PAAW). July 2018.
- Invited speaker at Highlights of Algorithms 2018. June 2018.
- Flexible Network Design 2018 at University of Maryland. May 2018.
See Old news for more.
Here is a list of what I view as my "most interesting" publications (many thanks to my great collaborators who contribute in these works). For the full list of publications, please refer to the publication page.
- From gap-ETH to FPT Inapproximability: Clique, Dominating Set and More, 2017. [PDF]
- Pattern Avoiding Access in Binary Search Trees, 2015. [PDF]
- Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs, 2014. [PDF]
- Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses, 2013. [PDF]
- Approximation Algorithms and Hardness of Integral Concurrent Flow, 2012. [PDF]
- Maximum Independent Set of Rectangles, 2009. [PDF]
- PC Member:
- International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2018)
- International Symposium on Algorithms and Computation (ISAAC 2017)
- European Symposium on Algorithms (ESA 2016)
- Fun with Algorithms (FUN 2016)
- Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
- International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2015)
- ALGO 2018. With Petteri Kaski and Jukka Suomela.
- Max Planck Advanced Course on Foundations of Computer Science (ADFOCS) 2014. With A. Karrenbauer.
Konemiehentie 2, Espoo/Otaniemi,
Email: Aalto e-mail always follows the format firstname dot lastname at aalto.fi. My first name is the one that starts with P.