Joakim Blikstad

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 20

Top Topics

Query Complexity

Longest Common Subsequence

Bipartite Matching

Top Venues

Inf. Process. Lett.

Publications

Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Online Edge Coloring is (Nearly) as Easy as Offline. CoRR (2024)
Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu
Time. CoRR (2024)
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Online Edge Coloring Is (Nearly) as Easy as Offline. STOC (2024)
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
Minimum Star Partitions of Simple Polygons in Polynomial Time. STOC (2024)
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA (2024)
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR (2023)
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu
Fast Algorithms via Dynamic-Oracle Matroids. STOC (2023)
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
Minimum Star Partitions of Simple Polygons in Polynomial Time. CoRR (2023)
Joakim Blikstad, Peter Kiss
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time. CoRR (2023)
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu
Fast Algorithms via Dynamic-Oracle Matroids. CoRR (2023)
Joakim Blikstad, Peter Kiss
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time. ESA (2023)
Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
Nearly Optimal Communication and Query Complexity of Bipartite Matching. FOCS (2022)
Joakim Blikstad
Sublinear-Round Parallel Matroid Intersection. ICALP (2022)
Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
Nearly Optimal Communication and Query Complexity of Bipartite Matching. CoRR (2022)
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai
Breaking the Quadratic Barrier for Matroid Intersection. CoRR (2021)
Joakim Blikstad
Breaking O(nr) for Matroid Intersection. ICALP (2021)
Joakim Blikstad
Breaking O(nr) for Matroid Intersection. CoRR (2021)
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai
Breaking the quadratic barrier for matroid intersection. STOC (2021)
Joakim Blikstad
On the longest common subsequence of Thue-Morse words. Inf. Process. Lett. 164 (2020)
Joakim Blikstad
On the longest common subsequence of Thue-Morse words. CoRR (2019)