The densest subgraph problem in a graph (DSG), in the simplest form, is the following.
Given an undirected graph G=(V, E) find a subset S⊆ V of vertices that maximizes the ratio …

In this paper we consider the classic matroid intersection problem: given two matroids M
1=(V, I 1) and M 2=(V, I 2) defined over a common ground set V, compute a set S∈ I 1∩ I 2 …

We consider the matroid intersection problem in the independence oracle model. Given two
matroids over n common elements such that the intersection has rank k, our main technique …

We present algorithms that break the $\tilde O (nr) $-independence-query bound for the
Matroid Intersection problem for the full range of $ r $; where $ n $ is the size of the ground …

For two matroids M _1 and M _2 defined on the same ground set E, the online matroid
intersection problem is to design an algorithm that constructs a large common independent …

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 M …

In the matroid partitioning problem, we are given $ k $ matroids $\mathcal {M}
_1=(V,\mathcal {I} _1),\dots,\mathcal {M} _k=(V,\mathcal {I} _k) $ defined over a common …

In this paper, we propose new exact and approximation algorithms for the weighted matroid
intersection problem. Our exact algorithm is faster than previous algorithms when the largest …

Given two matroids $\mathcal {M} _1=(V,\mathcal {I} _1) $ and $\mathcal {M} _2=(V,\mathcal
{I} _2) $ over an $ n $-element integer-weighted ground set $ V $, the weighted matroid …

In the matroid intersection problem, we are given two matroids $\mathcal {M} _1=(V,\mathcal
{I} _1) $ and $\mathcal {M} _2=(V,\mathcal {I} _2) $ defined on the same ground set $ V $ of …