Joakim Blikstad

According to our database, Joakim Blikstad authored at least 13 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Efficient Matroid Intersection via a Batch-Update Auction Algorithm.

Joakim Blikstad, Ta-Wei Tu

CoRR, 2024

Deterministic Online Bipartite Edge Coloring.

Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc

CoRR, 2024

Online Edge Coloring Is (Nearly) as Easy as Offline.

Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Minimum Star Partitions of Simple Polygons in Polynomial Time.

Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Simple and Asymptotically Optimal Online Bipartite Edge Coloring.

Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Maximum Flow by Augmenting Paths in n^2+o(1) Time.

Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Fast Algorithms via Dynamic-Oracle Matroids.

Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time.

Joakim Blikstad, Peter Kiss

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Sublinear-Round Parallel Matroid Intersection.

Joakim Blikstad

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Nearly Optimal Communication and Query Complexity of Bipartite Matching.

Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Breaking the quadratic barrier for matroid intersection.

Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Breaking O(nr) for Matroid Intersection.

Joakim Blikstad

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

On the longest common subsequence of Thue-Morse words.

Joakim Blikstad

Inf. Process. Lett., 2020