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
12 2021 Breaking O (nr) for matroid intersection J Blikstad
arXiv preprint arXiv:2105.05673, 2021
12 2021 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
11 2022 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
8 2023 Incremental J Blikstad, P Kiss
arXiv preprint arXiv:2302.08432, 2023
7 2023 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
2 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
2 2024 On the longest common subsequence of Thue-Morse words J Blikstad
Information Processing Letters 164, 106020, 2020
2 2020 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
1 2024 Sublinear-round parallel matroid intersection J Blikstad
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
1 2022 Maximum Flow by Augmenting Paths in A Bernstein, J Blikstad, T Saranurak, TW Tu
arXiv preprint arXiv:2406.03648, 2024
2024 