Research Interests :
Graph theory, Algorithms, Matching with preferences.Publications : (Last Five, while at IITM)DBLP | View All
- Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms.
Authors :
Prem Krishnaa J,
Girija Limaye,
Meghana Nasre,
Prajakta NimbhorkarAppeared in
Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16-18, 2020, Proceedings (SAGT 2020) ,Lecture Notes in Computer Science, Vol 12283, pp.193-208, Sep 2020
- Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties.
Authors :
Kavitha Gopal,
Meghana Nasre,
Prajakta Nimbhorkar,
T. Pradeep ReddyAppeared in
Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings (COCOON 2019) ,Lecture Notes in Computer Science, Vol 11653, pp.193-205, Jul 2019
- Student Course Allocation with Constraints.
Authors :
Akshay Utture,
Vedant Somani,
Prem Krishnaa J,
Meghana NasreAppeared in
Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers, Lecture Notes in Computer Science, Vol 11544, pp.51-68, Jun 2019
- Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.
Authors :
Meghana Nasre,
Prajakta Nimbhorkar,
Nada PulathAppeared in
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Nria, Spain, June 19-21, 2019, Revised Papers (WG 2019) ,Lecture Notes in Computer Science, Vol 11789, pp.244-257, Jun 2019
- Rank-maximal matchings - structure and algorithms.
| Apr 2021 - May 2021 | : | - Introduction to Programming (CS1100) |
| Jan 2020 - May 2020 | : | - Discrete Mathematics for Computer Science (CS1200) |
| Jul 2019 - Nov 2019 | : | - Advanced Graph Algorithms (CS6130) |
| Jul 2019 - Nov 2019 | : | - Advanced Programming Lab (CS6140) |
| Jan 2019 - May 2019 | : | - Design and Analysis of Algorithms (CS2800) |
