Joakim Blikstad

Orcid: 0009-0004-0874-2356

According to our database1, Joakim Blikstad authored at least 12 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deterministic Online Bipartite Edge Coloring.
CoRR, 2024

Maximum Flow by Augmenting Paths in n<sup>2+o(1)</sup> Time.
CoRR, 2024

Online Edge Coloring Is (Nearly) as Easy as Offline.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Minimum Star Partitions of Simple Polygons in Polynomial Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Simple and Asymptotically Optimal Online Bipartite Edge Coloring.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023
Fast Algorithms via Dynamic-Oracle Matroids.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Sublinear-Round Parallel Matroid Intersection.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Nearly Optimal Communication and Query Complexity of Bipartite Matching.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Breaking the quadratic barrier for matroid intersection.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Breaking O(nr) for Matroid Intersection.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
On the longest common subsequence of Thue-Morse words.
Inf. Process. Lett., 2020


  Loading...