Research Publications -@ CSE-IITM

Publications by the members of CSE Department :

Page: 1 of 1 » 1 page : items per page :

Filters Type : Member : Area : Lab:

Popular critical matchings in the many-to-many setting.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
Appeared in Theor. Comput. Sci., Vol 982, pp.114281, 2024.

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.

Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar
Appeared in ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Krakw, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023) (PAIS 2023), Frontiers in Artificial Intelligence and Applications, Vol 372, pp.1601-1608, Oct 2023.

Matchings under One-Sided Preferences with Soft Quotas.

Santhini K. A., Raghu Raman Ravi, Meghana Nasre
Appeared in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China (IJCAI 2023), pp.2774-2782, Aug 2023.

Critical Relaxed Stable Matchings with Two-Sided Ties.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
Appeared in Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers (WG 2023), Lecture Notes in Computer Science, Vol 14093, pp.447-461, Jun 2023.

Optimal Cost-Based Allocations Under Two-Sided Preferences.

Girija Limaye, Meghana Nasre
Appeared in Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings (IWOCA 2023), Lecture Notes in Computer Science, Vol 13889, pp.259-270, Jun 2023.

Matchings under One-Sided Preferences with Soft Quotas

Santhini K A, Meghana Nasre, R Raghu Raman
Appeared in 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023, Macao. (), May 2023.

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs.

Manas Jyoti Kashyop, N.S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
Appeared in Algorithmica, Vol 85, pp.854-878, 2023.

Envy-freeness and relaxed stability: hardness and approximation algorithms.

Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
Appeared in J. Comb. Optim., Vol 45, pp.41, 2023.

Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas.

Govind S. Sankar, Santhini K A, Meghana Nasre
Appeared in 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022 (AAMAS 2022), pp.696-704, May 2022.

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
Appeared in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. (FSTTCS 2021), LIPIcs, Vol 213, pp.30:1-30:21, Dec 2021.

Matchings with Group Fairness Constraints: Online and Offline Algorithms.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Appeared in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021. (IJCAI 2021), pp.377-383, Aug 2021.

Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms.

Prem Krishnaa J, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
Appeared 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.

Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy
Appeared 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.

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.

Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath
Appeared 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.

Student Course Allocation with Constraints.

Akshay Utture, Vedant Somani, Prem Krishnaa J, Meghana Nasre
Appeared 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.

Rank-maximal matchings - structure and algorithms.

Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
Appeared in Theor. Comput. Sci., Vol 767, pp.73-82, 2019.

How Good Are Popular Matchings?.

Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat
Appeared in 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy (SEA 2018), LIPIcs, Vol 103, pp.9:1-9:14, Jun 2018.

Facility Location on Planar Graphs with Unreliable Links.

N.S. Narayanaswamy, Meghana Nasre, Vijayaragunathan
Appeared in Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings (CSR 2018), Lecture Notes in Computer Science, Vol 10846, pp.269-281, Jun 2018.

Popular Matchings with Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar
Appeared in 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India (FSTTCS 2017), LIPIcs, Vol 93, pp.44:1-44:15, Dec 2017.

Popularity in the Generalized Hospital Residents Setting.

Meghana Nasre, Amit Rawat
Appeared in Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings (CSR 2017), Lecture Notes in Computer Science, Vol 10304, pp.245-259, Jun 2017.

List Coloring of Planar Graphs with Forbidden Cycles.

Sreekanth Gorla, Meghana Nasre
Appeared in Electronic Notes in Discrete Mathematics, Vol 55, pp.117-121, 2016.

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality.

Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Appeared in Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (ISAAC 2014), Lecture Notes in Computer Science, Vol 8889, pp.766-778, Dec 2014.

Rank-Maximal Matchings - Structure and Algorithms.

Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar
Appeared in Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (ISAAC 2014), Lecture Notes in Computer Science, Vol 8889, pp.593-605, Dec 2014.

Betweenness Centrality - Incremental and Faster.

Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Appeared in Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (MFCS 2014), Lecture Notes in Computer Science, Vol 8635, pp.577-588, Aug 2014.

Popular Matchings: Structure and Strategic Issues.

Meghana Nasre
Appeared in SIAM J. Discrete Math., Vol 28, pp.1423-1448, 2014.

Popularity at minimum cost.

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Appeared in J. Comb. Optim., Vol 27, pp.574-596, 2014.

Page: 1 of 1 » 1 page : items per page :

Department of Computer Science & Engineering