| Matchings with Group Fairness Constraints - Online and Offline Algorithms. | 0 | 0.34 | 2021 |
| Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. | 0 | 0.34 | 2021 |
| Disjoint Stable Matchings in Linear Time. | 0 | 0.34 | 2021 |
| Envy-Freeness and Relaxed Stability - Hardness and Approximation Algorithms. | 0 | 0.34 | 2020 |
| Classified Rank-Maximal Matchings And Popular Matchings - Algorithms And Hardness | 0 | 0.34 | 2019 |
| Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. | 0 | 0.34 | 2019 |
| Dynamic rank-maximal and popular matchings. | 0 | 0.34 | 2019 |
| Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. | 0 | 0.34 | 2018 |
| How Good Are Popular Matchings?. | 0 | 0.34 | 2018 |
| Shortest path length with bounded-alternation (min, +) formulas. | 0 | 0.34 | 2018 |
| Computing the Maximum using (min, +) Formulas. | 0 | 0.34 | 2018 |
| Dynamic Rank-Maximal Matchings. | 0 | 0.34 | 2017 |
| Dynamic Rank Maximal Matchings. | 0 | 0.34 | 2017 |
| Popular Matching with Lower Quotas. | 1 | 0.38 | 2017 |
| Rank-Maximal Matchings - Structure and Algorithms. | 1 | 0.37 | 2014 |
| Popularity at minimum cost | 3 | 0.45 | 2014 |
| Near-Optimal expanding generator sets for solvable permutation groups | 0 | 0.34 | 2012 |
| Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs | 2 | 0.51 | 2011 |
| Pseudorandom generators for group products: extended abstract | 18 | 0.66 | 2011 |
| EXPANDING GENERATING SETS FOR SOLVABLE PERMUTATION GROUPS | 0 | 0.34 | 2011 |
| Graph Isomorphism for K{3, 3}-free and K5-free graphs is in Log-space. | 0 | 0.34 | 2010 |
| Log-Space Algorithms for Paths and Matchings in k-Trees | 10 | 0.65 | 2010 |
| Pseudorandom Generators for Group Products | 6 | 0.46 | 2010 |
| Longest paths in planar DAGs in unambiguous logspace | 6 | 0.53 | 2009 |
| The planar k-means problem is NP-hard | 109 | 3.95 | 2009 |
| Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space | 9 | 0.51 | 2009 |
| Planar Graph Isomorphism is in Log-space. | 0 | 0.34 | 2009 |
| A Log-space Algorithm for Canonization of Planar Graphs | 3 | 0.43 | 2008 |
| 3-connected Planar Graph Isomorphism is in Log-space | 2 | 0.40 | 2008 |
