| Publication | Date of Publication | Type |
|---|
| Popular edges with critical nodes | 2024-09-11 | 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 |
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 |
Disjoint stable matchings in linear time
(available as arXiv preprint) | 2022-06-08 | 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 |
| scientific article; zbMATH DE number 7204408 (Why is no real title available?) | 2020-05-26 | 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 |
Dynamic rank-maximal and popular matchings
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Rank-maximal matchings -- structure and algorithms
Theoretical Computer Science | 2019-03-26 | Paper |
Expanding Generating Sets for Solvable Permutation Groups
SIAM Journal on Discrete Mathematics | 2018-07-20 | Paper |
Dynamic rank-maximal matchings
(available as arXiv preprint) | 2017-10-23 | Paper |
Rank-maximal matchings -- structure and algorithms
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Popularity at minimum cost
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Pseudorandom generators for group products
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Longest paths in planar DAGs in unambiguous log-space
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Log-space algorithms for paths and matchings in \(k\)-trees
Theory of Computing Systems | 2013-12-02 | Paper |
| Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space | 2012-10-24 | Paper |
| 3-connected Planar Graph Isomorphism is in Log-space | 2012-10-19 | Paper |
Near-optimal expanding generator sets for solvable permutation groups
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
The planar \(k\)-means problem is NP-hard
Theoretical Computer Science | 2012-08-08 | Paper |
Erdős-Rényi sequences and deterministic construction of expanding Cayley graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
| Log-space algorithms for paths and matchings in \(k\)-trees | 2012-01-23 | Paper |
Popularity at minimum cost
Lecture Notes in Computer Science | 2010-12-09 | Paper |
The Planar k-Means Problem is NP-Hard
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
