| No. |
Title |
Author |
Year |
| 1 |
Fairly Popular Matchings and Optimality |
Kavitha, Telikepalli |
2022 |
| 2 |
Stable Matchings with One-Sided Ties and Approximate Popularity |
Kavitha, Telikepalli |
2022 |
| 3 |
Matchings, Critical Nodes, and Popular Solutions |
Kavitha, Telikepalli |
2021 |
| 4 |
Maximum Matchings and Popularity |
Kavitha, Telikepalli |
2021 |
| 5 |
Min-Cost Popular Matchings |
Kavitha, Telikepalli |
2020 |
| 6 |
Popular Matchings with One-Sided Bias |
Kavitha, Telikepalli |
2020 |
| 7 |
Popular Matchings: Good, Bad, and Mixed (Invited Talk) |
Kavitha, Telikepalli |
2019 |
| 8 |
Popular Roommates in Simply Exponential Time |
Kavitha, Telikepalli |
2019 |
| 9 |
Popular Matchings in Complete Graphs |
Cseh, Ágnes et al. |
2018 |
| 10 |
Popular Matchings with Multiple Partners |
Brandl, Florian et al. |
2018 |
| 11 |
Popular Half-Integral Matchings |
Kavitha, Telikepalli |
2016 |
| 12 |
New Pairwise Spanners |
Kavitha, Telikepalli |
2015 |
| 13 |
Fair Matchings and Related Problems |
Huang, Chien-Chung et al. |
2013 |
| 14 |
LIPIcs, Volume 18, FSTTCS'12, Complete Volume |
D'Souza, Deepak et al. |
2013 |
| 15 |
On Pairwise Spanners |
Cygan, Marek et al. |
2013 |
| 16 |
Dynamic matrix rank with partial lookahead |
Kavitha, Telikepalli |
2008 |
