Joakim Blikstad
Scholar

Joakim Blikstad

Google Scholar ID: BkbZTYUAAAAJ
Centrum Wiskunde & Informatica
Theoretical computer scienceGraph algorithmsDynamic algorithmsMatroid Intersection
Citations & Impact
All-time
Citations
134
 
H-index
7
 
i10-index
6
 
Publications
16
 
Co-authors
0
 
Contact
Resume (English only)
Academic Achievements
  • Recipient of the EATCS Distinguished Dissertation Award 2025
  • Google PhD Fellowship awardee in 2023
  • Best Student Paper Award at ESA'23 for 'Incremental (1−ε)-approximate dynamic matching in O(poly(1/ε)) update time'
  • Best Student Paper Award at ICALP'22 for 'Sublinear-round Parallel Matroid Intersection'
  • Multiple papers accepted at top-tier conferences, including:
  • - FOCS'25: 'Online Edge Coloring: Sharp Thresholds' and 'Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs'
  • - STOC'25: 'Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations'
  • - SODA'25: 'Deterministic Online Bipartite Edge Coloring'
  • - SOSA'25: 'Efficient Matroid Intersection via a Batch-Update Auction Algorithm'
  • - FOCS'24: 'Maximum Flow by Augmenting Paths in n^{2+o(1)} Time'
  • - STOC'24: 'Online Edge Coloring is (Nearly) as Easy as Offline' and 'Minimum Star Partitions of Simple Polygons in Polynomial Time'
  • - SOSA'24: 'Simple and Asymptotically Optimal Online Bipartite Edge Coloring'
  • - STOC'23: 'Fast Algorithms via Dynamic-Oracle Matroids'
  • - FOCS'22: 'Nearly Optimal Communication and Query Complexity of Bipartite Matching'
  • Ranked 13th in the ICPC World Finals 2023 (with teammates Nicole Hedblom and Tobias Glimmerfors)
  • Invited talks at TTIC, ETH Zürich, TCS+, and other venues
  • Jury member organizing the European Girls' Olympiad in Informatics (EGOI) in 2023–2025
Co-authors
0 total
Co-authors: 0 (list not available)