| Annotating and searching web tables using entities, types and relationships G Limaye, S Sarawagi, S Chakrabarti Proceedings of the VLDB Endowment 3 (1-2), 1338-1347, 2010 | 544 | 2010 |
| Envy-freeness and relaxed stability: Hardness and approximation algorithms P Krishnaa, G Limaye, M Nasre, P Nimbhorkar Journal of Combinatorial Optimization 45 (1), 41, 2023 | 19 | 2023 |
| Stable Matchings with Flexible Quotas G Limaye, M Nasre arXiv preprint arXiv:2101.04425, 2021 | 4 | 2021 |
| Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective G Limaye Discrete Applied Mathematics 337, 288-302, 2023 | 2 | 2023 |
| Optimal Cost-Based Allocations Under Two-Sided Preferences G Limaye, M Nasre International Workshop on Combinatorial Algorithms, 259-270, 2023 | 1 | 2023 |
| Envy-freeness and Relaxed Stability under lower quotas P Krishnaa, G Limaye, M Nasre, P Nimbhorkar arXiv preprint arXiv:1910.07159, 2019 | 1 | 2019 |
| Envy-free matchings with cost-controlled quotas G Limaye, M Nasre arXiv preprint arXiv:2101.04425, 2021 | | 2021 |
| Envy-freeness and relaxed stability: Hardness and approximation algorithms P Krishnaa, G Limaye, M Nasre, P Nimbhorkar International Symposium on Algorithmic Game Theory, 193-208, 2020 | | 2020 |
| Maximum-Size Envy-free Matchings. P Krishnaa, G Limaye, M Nasre, P Nimbhorkar arXiv preprint arXiv:1910.07159, 2019 | | 2019 |
| Measurements on a Network-Studies and Techniques G Limaye Indian Institute of Technology, Bombay Mumbai, 2008 | | 2008 |
Sunita SarawagiIndian Institute of Technology Bombay, Mumbai, India.在 iitb.ac.in 的电子邮件经过验证
