| Publication | Date of Publication | Type |
|---|
| Computational complexity of \(k\)-stable matchings | 2024-05-29 | Paper |
Popular matchings with weighted voters
Games and Economic Behavior | 2024-04-30 | Paper |
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
Constraints | 2023-09-15 | Paper |
On weakly and strongly popular rankings
Discrete Applied Mathematics | 2023-09-14 | Paper |
A quest for a fair schedule: the international Young Physicists' Tournament
Journal of Scheduling | 2023-06-23 | Paper |
A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
Constraints | 2022-09-29 | Paper |
| Popular Matchings in Complete Graphs | 2022-07-21 | Paper |
Pairwise Preferences in the Stable Marriage Problem
(available as arXiv preprint) | 2022-07-18 | Paper |
Understanding popular matchings via stable matchings
SIAM Journal on Discrete Mathematics | 2022-02-09 | Paper |
The complexity of cake cutting with unequal shares
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Popular matchings in complete graphs
Algorithmica | 2021-04-19 | Paper |
The stable marriage problem with ties and restricted edges
Discrete Optimization | 2020-07-30 | Paper |
| Selected open problems in matching under preferences | 2020-01-13 | Paper |
Paths to stable allocations
International Journal of Game Theory | 2019-10-17 | Paper |
New and simple algorithms for stable flow problems
Algorithmica | 2019-05-17 | Paper |
Stable flows over time
Algorithms | 2019-03-26 | Paper |
The stable roommates problem with short lists
Theory of Computing Systems | 2019-03-21 | Paper |
The complexity of cake cutting with unequal shares
Lecture Notes in Computer Science | 2018-11-08 | Paper |
Popular edges and dominant matchings
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Stable marriage and roommates problems with restricted edges: complexity and approximability
Discrete Optimization | 2018-05-24 | Paper |
Matchings with lower quotas: algorithms and complexity
Algorithmica | 2018-02-28 | Paper |
New and simple algorithms for stable flow problems
Lecture Notes in Computer Science | 2018-01-04 | Paper |
Popular matchings with two-sided preferences and one-sided ties
SIAM Journal on Discrete Mathematics | 2017-10-24 | Paper |
Improved algorithmic results for unsplittable stable allocation problems
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
The Stable Roommates Problem with Short Lists
Algorithmic Game Theory | 2016-09-29 | Paper |
The Stable Roommates Problem with Short Lists
Algorithmic Game Theory | 2016-09-29 | Paper |
Popular edges and dominant matchings
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Many-to-one matchings with lower quotas: algorithms and complexity
Algorithms and Computation | 2016-01-11 | Paper |
Stable marriage and roommates problems with restricted edges: complexity and approximability
Algorithmic Game Theory | 2015-11-04 | Paper |
Stable marriage and roommates problems with restricted edges: complexity and approximability
Algorithmic Game Theory | 2015-11-04 | Paper |
Popular matchings with two-sided preferences and one-sided ties
Automata, Languages, and Programming | 2015-10-27 | Paper |
Paths to Stable Allocations
Algorithmic Game Theory | 2015-01-14 | Paper |
