| Publication | Date of Publication | Type |
|---|
Generalized capacity planning for the hospital-residents problem
Theoretical Computer Science | 2026-02-27 | Paper |
| Critical Relaxed Stable Matchings with Two-Sided Ties | 2024-05-03 | Paper |
Popular critical matchings in the many-to-many setting
Theoretical Computer Science | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7799608 (Why is no real title available?) | 2024-02-05 | Paper |
Optimal cost-based allocations under two-sided preferences
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Trade-offs in dynamic coloring for bipartite and general graphs
Algorithmica | 2023-04-11 | Paper |
Envy-freeness and relaxed stability: hardness and approximation algorithms
Journal of Combinatorial Optimization | 2023-01-04 | Paper |
Envy-freeness and relaxed stability: hardness and approximation algorithms
Algorithmic Game Theory | 2022-12-21 | Paper |
How Good Are Popular Matchings
(available as arXiv preprint) | 2020-12-16 | Paper |
Popular matchings with lower quotas
(available as arXiv preprint) | 2020-11-25 | Paper |
| Classified rank-maximal matchings and popular matchings -- algorithms and hardness | 2020-02-24 | Paper |
| Many-to-one popular matchings with two-sided preferences and one-sided ties | 2020-02-24 | Paper |
Rank-maximal matchings -- structure and algorithms
Theoretical Computer Science | 2019-03-26 | Paper |
| Facility location on planar graphs with unreliable links | 2018-11-28 | Paper |
Popularity in the generalized hospital residents setting
(available as arXiv preprint) | 2017-08-22 | Paper |
| List coloring of planar graphs with forbidden cycles | 2017-02-14 | Paper |
Popular Matchings -- structure and cheating strategies
(available as arXiv preprint) | 2017-01-30 | Paper |
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
Algorithms and Computation | 2015-09-11 | Paper |
Rank-maximal matchings -- structure and algorithms
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Popular Matchings: Structure and Strategic Issues
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Betweenness centrality -- incremental and faster
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Popularity at minimum cost
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Rainbow connectivity: hardness and tractability
(available as arXiv preprint) | 2012-08-31 | Paper |
Bounded unpopularity matchings
Algorithmica | 2011-11-07 | Paper |
Popular mixed matchings
Theoretical Computer Science | 2011-06-07 | Paper |
Popular matchings with variable item copies
Theoretical Computer Science | 2011-03-14 | Paper |
Popularity at minimum cost
Lecture Notes in Computer Science | 2010-12-09 | Paper |
Optimal popular matchings
Discrete Applied Mathematics | 2010-04-28 | Paper |
Popular matchings with variable job capacities
Algorithms and Computation | 2009-12-17 | Paper |
Popular Mixed Matchings
Automata, Languages and Programming | 2009-07-14 | Paper |
Bounded Unpopularity Matchings
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
