Joakim Blikstad

34 papers A* 12A 1Journal 19Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Deterministic Edge Coloring with few Colors in CONGEST.
CoRR
Joakim Blikstad, Yannic Maus, Tijn de Vos
2026 J jnl
Minimum Star Partitions of Simple Polygons in Polynomial Time.
TheoretiCS
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
2025 A* conf
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs.
FOCS
Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu
2025 J jnl
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs.
CoRR
Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu
2025 A* conf
Deterministic Online Bipartite Edge Coloring.
SODA
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2025 — conf
Efficient Matroid Intersection via a Batch-Update Auction Algorithm.
SOSA
Joakim Blikstad, Ta-Wei Tu
2025 J jnl
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations.
CoRR
Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai
2025 A* conf
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations.
STOC
Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai
2025 J jnl
Greedy Algorithms for Shortcut Sets and Hopsets.
CoRR
Ben Bals, Joakim Blikstad, Greg Bodwin, Daniel Dadush, Sebastian Forster, Yasamin Nazari
2025 A* conf
Online Edge Coloring: Sharp Thresholds.
FOCS
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2025 J jnl
Online Edge Coloring: Sharp Thresholds.
CoRR
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024 J jnl
Deterministic Online Bipartite Edge Coloring.
CoRR
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024 J jnl
Efficient Matroid Intersection via a Batch-Update Auction Algorithm.
CoRR
Joakim Blikstad, Ta-Wei Tu
2024 A* conf
Maximum Flow by Augmenting Paths in n
FOCS
Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu
2024 J jnl
Maximum Flow by Augmenting Paths in n
CoRR
Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu
2024 A* conf
Minimum Star Partitions of Simple Polygons in Polynomial Time.
STOC
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
2024 A* conf
Online Edge Coloring Is (Nearly) as Easy as Offline.
STOC
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024 J jnl
Online Edge Coloring is (Nearly) as Easy as Offline.
CoRR
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024 — conf
Simple and Asymptotically Optimal Online Bipartite Edge Coloring.
SOSA
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2023 A* conf
Fast Algorithms via Dynamic-Oracle Matroids.
STOC
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu
2023 J jnl
Fast Algorithms via Dynamic-Oracle Matroids.
CoRR
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu
2023 A conf
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time.
ESA
Joakim Blikstad, Peter Kiss
2023 J jnl
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time.
CoRR
Joakim Blikstad, Peter Kiss
2023 J jnl
Minimum Star Partitions of Simple Polygons in Polynomial Time.
CoRR
Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang
2023 J jnl
Simple and Asymptotically Optimal Online Bipartite Edge Coloring.
CoRR
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2022 A* conf
Nearly Optimal Communication and Query Complexity of Bipartite Matching.
FOCS
Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
2022 J jnl
Nearly Optimal Communication and Query Complexity of Bipartite Matching.
CoRR
Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
2022 A* conf
Sublinear-Round Parallel Matroid Intersection.
ICALP
Joakim Blikstad
2021 A* conf
Breaking O(nr) for Matroid Intersection.
ICALP
Joakim Blikstad
2021 J jnl
Breaking O(nr) for Matroid Intersection.
CoRR
Joakim Blikstad
2021 J jnl
Breaking the Quadratic Barrier for Matroid Intersection.
CoRR
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai
2021 A* conf
Breaking the quadratic barrier for matroid intersection.
STOC
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai
2020 J jnl
On the longest common subsequence of Thue-Morse words.
Inf. Process. Lett.
Joakim Blikstad
2019 J jnl
On the longest common subsequence of Thue-Morse words.
CoRR
Joakim Blikstad