Member Profile :
|
Meghana NasreAssociate ProfessorEmail : meghana@cse.iitm.ac.in Personal Webpage |
Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
| Graph theory, Algorithms, Matching with preferences. |
Current Students
See here for former students
- Girija Limaye (Ph.D.)
- Santhini K A (Ph.D.)
- Vasuki Nadapana (Ph.D.)
- Vijayaraghunathan Ramamoorthi (Ph.D.)
- Keshav Ranjan (M.S.)
Teaching Actvities (while with the theory group - since Jan 2011)
- Programming and Data Structures - Jul-Nov, 2022
- Advanced Graph Algorithms - Jan-Apr, 2022
- Programming and Data Structures - Aug-Nov, 2021
- Advanced Graph Algorithms - Aug-Dec, 2020
- Discrete Mathematics for Computer Science - Jan-May, 2020
- Advanced Graph Algorithms - Jul-Nov, 2019
- Design and Analysis of Algorithms - Jan-May, 2019
- Topics in Design and Analysis of Algorithms - Jan-Apr, 2018
- Advanced Data Structures & Algorithms (Section 1) - Jul-Nov, 2017
- Advanced Programming Lab - Jul-Nov, 2017
- Topics in Design and Analysis of Algorithms - Jan-Apr, 2017
- Discrete Mathematics for Computer Science - Jan-Apr, 2016
- Computer Programming Lab - Aug-Nov, 2015
- Discrete Mathematics for Computer Science - Aug-Nov, 2015
- Topics in Design and Analysis of Algorithms - Aug-Nov, 2015
- Advanced Algorithms - Jan-May, 2015
- Recent Developments in Theoretical Computer Science - Jan-May, 2015
- Advanced Data Structures and Algorithms - Jul-Nov, 2014
- Advanced Algorithms - Jan-May, 2014
Publications (while with the group, last 10)
See here for all publications while at IITM
- Optimal Matchings with One-sided Preferences : Fixed and Cost Based Quotas
Authors: Santhini K A, Govind S. Sankar, Meghana Nasre
Proc. of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022),, To Appear, Jan 2022 - Popular Matchings in the Hospital-Residents Problem with Two-sided Lower Quotas
Authors: Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2021 - Matchings with Group Fairness Constraints: Online and Offline Algorithms
Authors: Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
30th International Joint Conference on Artificial Intelligence (IJCAI 2021), Aug 2021 - Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms
Authors: Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
13th International Symposium Algorithmic Game Theory (SAGT 2020), Sep 2020 - Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness
Authors: Meghana Nasre, Prajakta Nimbhorkar, Nada Abdul Majeed Pulath
45th International Workshop on Graph-Theoretic Concepts in Computer Science, May 2019 - How good are popular matchings?
Authors: Krishnapriya A M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat
17th International Symposium on Experimental Algorithms (SEA 2018), Jun 2018 - Facility location on planar graphs with unreliable links
Authors: Narayanaswamy N S, Meghana Nasre, Vijayaraghunathan Ramamoorthi
The 13th International Computer Science Symposium in Russia, Jun 2018 - Popular Matchings with Lower Quotas
Authors: Meghana Nasre, Prajakta Nimbhorkar
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017), Dec 2017 - Popularity in the generalized Hospital Residents setting
Authors: Meghana Nasre, Amit Rawat
The 12th International Computer Science Symposium in Russia (CSR 2017), Jun 2017 - Rank Maximal Matchings -- Structure and Algorithms.
Authors: Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar
Accepted for publication at the 25th International Symposium on Algorithms and Computation, Dec 2014