An arborescence, which is a directed analogue of a spanning tree in an
u...
The qubit routing problem, also known as the swap minimization problem, ...
We prove that the computation of a combinatorial shortest path between t...
Robust subsets of matroids were introduced by Huang and Sellier to propo...
We consider the problem of determining whether a target item assignment ...
We consider a many-to-one variant of the stable matching problem. More
c...
We consider the problem of reforming an envy-free matching when each age...
This paper deals with the complexity of the problem of computing a pure ...
We study the complexity of computing a uniform Nash equilibrium on a bim...
We initiate the study of k-edge-connected orientations of undirected gra...
We study fairness in house allocation, where m houses are to be allocate...
In this study, we consider the real-world problem of assigning students ...
A super-stable matching, which was introduced by Irving, is a solution
c...
In fair division problems, we are given a set S of m items and a set N
o...
Motivated by adjacency in perfect matching polytopes, we study the short...
In this paper, we introduce the concept of b-branchings in digraphs, whi...