Fast algorithms via dynamic-oracle matroids J Blikstad, S Mukhopadhyay, D Nanongkai, TW Tu
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1229-1242, 2023
16 2023 Nearly optimal communication and query complexity of bipartite matching J Blikstad, J Van Den Brand, Y Efron, S Mukhopadhyay, D Nanongkai
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
16 2022 Breaking O (nr) for matroid intersection J Blikstad
arXiv preprint arXiv:2105.05673, 2021
16 2021 Breaking the quadratic barrier for matroid intersection J Blikstad, J Van Den Brand, S Mukhopadhyay, D Nanongkai
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
15 2021 Online edge coloring is (nearly) as easy as offline J Blikstad, O Svensson, R Vintan, D Wajc
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 36-46, 2024
12 2024 Simple and asymptotically optimal online bipartite edge coloring J Blikstad, O Svensson, R Vintan, D Wajc
2024 Symposium on Simplicity in Algorithms (SOSA), 331-336, 2024
8 2024 Incremental (1-ǫ)-approximate dynamic matching in o (poly (1/ǫ)) update time J Blikstad, P Kiss
31st Annual European Symposium on Algorithms, ESA, 4-6, 2023
7 2023 Incremental J Blikstad, P Kiss
arXiv preprint arXiv:2302.08432, 2023
6 2023 Maximum Flow by Augmenting Paths in A Bernstein, J Blikstad, T Saranurak, TW Tu
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
4 2024 Minimum star partitions of simple polygons in polynomial time M Abrahamsen, J Blikstad, A Nusser, H Zhang
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 904-910, 2024
4 2024 Sublinear-round parallel matroid intersection J Blikstad
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
4 2022 Deterministic Online Bipartite Edge Coloring J Blikstad, O Svensson, R Vintan, D Wajc
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
3 2025 On the longest common subsequence of Thue-Morse words J Blikstad
Information Processing Letters 164, 106020, 2020
3 2020 Efficient Matroid Intersection via a Batch-Update Auction Algorithm J Blikstad, TW Tu
2025 Symposium on Simplicity in Algorithms (SOSA), 226-237, 2025
1 2025 Global vs. st Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations J Blikstad, Y Jiang, S Mukhopadhyay, Y Sorrachai
57th Annual ACM Symposium on Theory of Computing, 2025
2025 Matchings, Maxflows, Matroids: The Power of Augmenting Paths and Computational Models J Blikstad
KTH Royal Institute of Technology, 2024
2024 Matchings, Maxflows, Matroids J BLIKSTAD