We consider the problem of determining which matrices are permutable to ...
We consider the problem of finding a subgraph of a given graph which
min...
A perfect matching in a hypergraph is a set of edges that partition the ...
We consider the vector partition problem, where n agents, each with a
d-...
We consider the problem of finding a Young diagram minimizing the sum of...
We consider the problem of finding a subgraph of a given graph which
max...
Configuration integer programs (IP) have been key in the design of algor...
We consider the problem of finding a subgraph of a given graph minimizin...
We study the general integer programming problem where the number of
var...
We investigate the computational complexity of problems on toric ideals ...
The theory of n-fold integer programming has been recently emerging as a...