3 papers
cs.DS2021
Breaking O(nr) for Matroid Intersection
Joakim Blikstad
We present algorithms that break the -independence-query bound for the Matroid Intersection problem for the full range of ; where is the size of the ground set…
cs.DS2021
Breaking the Quadratic Barrier for Matroid Intersection
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay +1
The matroid intersection problem is a fundamental problem that has been extensively studied for half a century. In the classic version of this problem, we are given two matroids $\…
cs.DM2019
On the longest common subsequence of Thue-Morse words
Joakim Blikstad
The length of the longest common subsequence of the 'th Thue-Morse word and its bitwise complement is studied. An open problem suggested by Jean Berstel in 2006 is to fin…