Joakim Blikstad

I am a fourth-year PhD student at KTH Royal Institute of Technology, fortunate to be advised by Prof. Danupon Nanongkai. Previously, I did my undergrad at University of Waterloo.

I am currently a long-term visitor at the Max Planck Institute for Informatics.

I am primarily interested in combinatorial optimization topics such as matching, matroid intersection, and related graph problems. I like to study these problems in many models of computations simultaneously, such as dynamic, communication, parallel, and distributed models.

In my free time one can often find me sailing, skiing, hiking, or playing the piano.

Email: (lastname)

Office: Room 308, Max-Planck-Institut für Informatik, Campus E1 4, 66123 Saarbrücken, Germany


Older News


See also: [dblp] [Google Scholar]

  1. Online Edge Coloring is (Nearly) as Easy as Offline
    Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc.
    STOC 2024
  2. Minimum Star Partitions of Simple Polygons in Polynomial Time
    Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang.
    STOC 2024
  3. Simple and Asymptotically Optimal Online Bipartite Edge Coloring
    Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc.
    SOSA 2024
    [arxiv] [proceedings]
  4. Incremental (1−ε)-approximate dynamic matching in O(poly(1/ε)) update time
    Joakim Blikstad, Peter Kiss.
    ESA 2023 Best Student Paper Award
    [arxiv] [proceedings] [slides]
  5. Fast Algorithms via Dynamic-Oracle Matroids
    Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu.
    STOC 2023
    [arxiv] [proceedings] [slides] [talk@ETH] [talk@STOC by T.T.]
  6. Nearly Optimal Communication and Query Complexity of Bipartite Matching
    Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai.
    FOCS 2022
    [arxiv] [proceedings] [slides] [talk@TCS+] [talk@IAS by Y.E.]
  7. Sublinear-round Parallel Matroid Intersection
    Joakim Blikstad.
    ICALP 2022 Best Student Paper Award
    [proceedings] [slides]
  8. Breaking O(nr) for Matroid Intersection
    Joakim Blikstad.
    ICALP 2021
    [arxiv] [proceedings] [slides]
  9. Breaking the Quadratic Barrier for Matroid Intersection
    Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai.
    STOC 2021
    [arxiv] [proceedings] [slides] [talk@STOC]
  10. On the longest common subsequence of Thue-Morse words
    Joakim Blikstad.
    Information Processing Letters (2020)
    [arxiv] [journal]

(Website last updated: March 2024)