| Publication | Date of Publication | Type |
|---|
| Faster algorithms for approximate distance oracles and all-pairs small stretch paths | 2026-05-29 | Paper |
| Maximum matchings and popularity | 2026-05-12 | Paper |
| Min-cost popular matchings | 2026-03-23 | Paper |
| Popular matchings with one-sided bias | 2026-03-18 | Paper |
| Perfect matchings and popularity in the many-to-many setting | 2025-07-28 | Paper |
Popular arborescences and their matroid generalization
ACM Transactions on Algorithms | 2025-07-22 | Paper |
Matchings, relaxed popularity, and optimality
SIAM Journal on Discrete Mathematics | 2025-05-07 | Paper |
| Popular solutions for optimal matchings | 2025-05-02 | Paper |
Popular matchings with one-sided bias
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Popular roommates in simply exponential time
Algorithmica | 2025-02-14 | Paper |
| Fault-tolerant approximate distance oracles with a source set | 2025-01-01 | Paper |
| Arborescences, colorful forests, and popularity | 2024-11-28 | Paper |
| Stable matchings with one-sided ties and approximate popularity | 2024-09-12 | Paper |
| The popular assignment problem: when cardinality is more important than popularity | 2024-07-19 | Paper |
Envy-free relaxations for goods, chores, and mixed items
Theoretical Computer Science | 2024-06-03 | Paper |
Stable matchings, one-sided ties, and approximate popularity
Algorithmica | 2024-05-30 | Paper |
Maximum matchings and popularity
SIAM Journal on Discrete Mathematics | 2024-04-23 | Paper |
| Fairly popular matchings and optimality | 2024-04-23 | Paper |
| scientific article; zbMATH DE number 7799603 (Why is no real title available?) | 2024-02-05 | Paper |
| Popular Roommates in Simply Exponential Time. | 2023-02-03 | Paper |
Popular branchings and their dual certificates
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
| Popular Matchings in Complete Graphs | 2022-07-21 | Paper |
| Popular Matchings: Good, Bad, and Mixed (Invited Talk) | 2022-07-21 | Paper |
Quasi-popular matchings, optimality, and extended formulations
Mathematics of Operations Research | 2022-05-17 | Paper |
Popular branchings and their dual certificates
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Understanding popular matchings via stable matchings
SIAM Journal on Discrete Mathematics | 2022-02-09 | Paper |
A Little Charity Guarantees Almost Envy-Freeness
SIAM Journal on Computing | 2021-09-10 | Paper |
Popularity, Mixed Matchings, and Self-Duality
Mathematics of Operations Research | 2021-07-15 | Paper |
Popular matchings in complete graphs
Algorithmica | 2021-04-19 | Paper |
Quasi-popular Matchings, Optimality, and Extended Formulations
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A Little Charity Guarantees Almost Envy-Freeness
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Popular matchings with multiple partners
(available as arXiv preprint) | 2020-11-25 | Paper |
Popular matchings and limits to tractability
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Upper neighbours of Čech closure operators
Arabian Journal of Mathematics | 2019-06-24 | Paper |
Two problems in max-size popular matchings
Algorithmica | 2019-05-21 | Paper |
| Popularity vs maximum cardinality in the stable marriage setting | 2019-05-10 | Paper |
| Efficient algorithms for maximum weight matchings in general graphs with small edge weights | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7008829 (Why is no real title available?) | 2019-01-31 | Paper |
| Popular matchings of desired size | 2018-11-22 | Paper |
Popular edges and dominant matchings
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Distributed construction of purely additive spanners
Lecture Notes in Computer Science | 2018-08-16 | Paper |
Popularity, mixed matchings, and self-duality
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Distributed construction of purely additive spanners
Distributed Computing | 2018-06-01 | Paper |
Lattice of generalized closure operators
Journal of Advanced Studies in Topology | 2018-03-01 | Paper |
New pairwise spanners
Theory of Computing Systems | 2018-02-01 | Paper |
| Popular Half-Integral Matchings. | 2017-12-19 | Paper |
Popular matchings with two-sided preferences and one-sided ties
SIAM Journal on Discrete Mathematics | 2017-10-24 | Paper |
New algorithms for maximum weight matching and a decomposition theorem
Mathematics of Operations Research | 2017-06-02 | Paper |
| Fair matchings and related problems | 2017-02-21 | Paper |
On Pairwise Spanners
(available as arXiv preprint) | 2017-01-30 | Paper |
| New pairwise spanners | 2017-01-24 | Paper |
Group of closure isomorphisms of Čech closure spaces
Journal of Advanced Studies in Topology | 2017-01-19 | Paper |
Popular edges and dominant matchings
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Fair matchings and related problems
Algorithmica | 2016-04-06 | Paper |
Improved approximation algorithms for two variants of the stable marriage problem with ties
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Small stretch pairwise spanners and approximate D-preservers
SIAM Journal on Discrete Mathematics | 2015-11-18 | Paper |
Maintaining Near-Popular Matchings
Automata, Languages, and Programming | 2015-11-04 | Paper |
Popular matchings with two-sided preferences and one-sided ties
Automata, Languages, and Programming | 2015-10-27 | Paper |
Rank-maximal matchings
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6469133 (Why is no real title available?) | 2015-08-03 | Paper |
Dynamic matrix rank with partial lookahead
Theory of Computing Systems | 2015-02-05 | Paper |
| Efficient algorithms for computing all low s-t edge connectivities and related problems | 2014-12-18 | Paper |
| Popular matchings | 2014-10-13 | Paper |
| New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners | 2014-10-13 | Paper |
Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review | 2014-10-07 | Paper |
Additive spanners and \(({\alpha}, {\beta})\)-spanners
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Incremental cycle detection, topological ordering, and strong component maintenance
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Popularity at minimum cost
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
A Size-Popularity Tradeoff in the Stable Marriage Problem
SIAM Journal on Computing | 2014-06-04 | Paper |
An improved approximation algorithm for the stable marriage problem with one-sided ties
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
An improved heuristic for computing short integral cycle bases
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Small Stretch Pairwise Spanners
Automata, Languages, and Programming | 2013-08-06 | Paper |
Near-popular matchings in the roommates problem
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Popular matchings in the stable marriage problem
Information and Computation | 2013-06-06 | Paper |
| Dynamic matrix rank with partial lookahead | 2012-10-19 | Paper |
Max-coloring paths: tight bounds and extensions
Journal of Combinatorial Optimization | 2012-10-01 | Paper |
Faster algorithms for all-pairs small stretch distances in weighted graphs
Algorithmica | 2012-04-26 | Paper |
Properties of Gomory-Hu co-cycle bases
Theoretical Computer Science | 2012-03-13 | Paper |
Bounded unpopularity matchings
Algorithmica | 2011-11-07 | Paper |
Near-popular matchings in the roommates problem
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Popular matchings in the stable marriage problem
Automata, Languages and Programming | 2011-07-06 | Paper |
Popular mixed matchings
Theoretical Computer Science | 2011-06-07 | Paper |
Voting paths
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Faster algorithms for all-pairs approximate shortest paths in undirected graphs
SIAM Journal on Computing | 2011-04-04 | Paper |
New approximation algorithms for minimum cycle bases of graphs
Algorithmica | 2011-03-30 | Paper |
Isoperimetric inequalities and the width parameters of graphs
Lecture Notes in Computer Science | 2011-03-18 | 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 |
Assigning papers to referees
Algorithmica | 2010-10-07 | Paper |
| scientific article; zbMATH DE number 5764893 (Why is no real title available?) | 2010-08-06 | Paper |
Optimal popular matchings
Discrete Applied Mathematics | 2010-04-28 | Paper |
Max-coloring paths: tight bounds and extensions
Algorithms and Computation | 2009-12-17 | Paper |
Popular matchings with variable job capacities
Algorithms and Computation | 2009-12-17 | Paper |
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
SIAM Journal on Computing | 2009-08-20 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Popular Mixed Matchings
Automata, Languages and Programming | 2009-07-14 | Paper |
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
Algorithmica | 2009-03-24 | Paper |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
