| Publication | Date of Publication | Type |
|---|
| Arborescences, colorful forests, and popularity | 2024-11-28 | Paper |
Solving the maximum popular matching problem with matroid constraints
SIAM Journal on Discrete Mathematics | 2024-07-31 | Paper |
| Approximation algorithms for matroidal and cardinal generalizations of stable matching | 2024-05-14 | Paper |
A fair and truthful mechanism with limited subsidy
Games and Economic Behavior | 2024-04-30 | Paper |
| Maximally satisfying lower quotas in the hospitals/residents problem with ties | 2024-04-23 | Paper |
scientific article; zbMATH DE number 7788644 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
SIAM Journal on Computing | 2023-10-26 | Paper |
Fast primal-dual update against local weight update in linear assignment problem and its application
Information Processing Letters | 2023-10-12 | Paper |
Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
Algorithmic Game Theory | 2023-07-28 | Paper |
Matroid Intersection under Restricted Oracles
SIAM Journal on Discrete Mathematics | 2023-06-27 | Paper |
Hypergraph characterization of split matroids
Journal of Combinatorial Theory. Series A | 2022-11-29 | Paper |
Approximation by lexicographically maximal solutions in matching and matroid intersection problems
Theoretical Computer Science | 2022-03-23 | Paper |
Equitable partitions into matchings and coverings in mixed graphs
Discrete Mathematics | 2021-10-27 | Paper |
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems
(available as arXiv preprint) | 2021-07-21 | Paper |
| A note on a nearly uniform partition into common independent sets of two matroids | 2021-03-16 | Paper |
A note on a nearly uniform partition into common independent sets of two matroids
(available as arXiv preprint) | 2021-03-16 | Paper |
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| scientific article; zbMATH DE number 7278072 (Why is no real title available?) | 2020-11-25 | Paper |
Finding a stable allocation in polymatroid intersection
Mathematics of Operations Research | 2020-04-30 | Paper |
Envy-free matchings with lower quotas
Algorithmica | 2020-04-09 | Paper |
Envy-free matchings with lower quotas
Algorithmica | 2020-04-09 | Paper |
Matroidal choice functions
SIAM Journal on Discrete Mathematics | 2019-09-30 | Paper |
List supermodular coloring with shorter lists
Combinatorica | 2019-09-04 | Paper |
A generalized-polymatroid approach to disjoint common independent sets in two matroids
Discrete Mathematics | 2019-06-18 | Paper |
List supermodular coloring
Combinatorica | 2019-06-12 | Paper |
| Optimal cache placement for an academic backbone network | 2018-09-17 | Paper |
Finding a stable allocation in polymatroid intersection
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
Mathematics of Operations Research | 2017-04-13 | Paper |
On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
Mathematics of Operations Research | 2015-05-29 | Paper |
