Envy-freeness and relaxed stability: hardness and approximation algorithms von Krishnaa, Prem, Limaye, Girija, Nasre, Meghana, Nimbhorkar, Prajakta

Volltext

Popular critical matchings in the many-to-many setting von Nasre, Meghana, Nimbhorkar, Prajakta, Ranjan, Keshav, Sarkar, Ankita

Volltext

The Planar k-Means Problem is NP-Hard von Mahajan, Meena, Nimbhorkar, Prajakta, Varadarajan, Kasturi

Volltext

Dynamic rank-maximal and popular matchings von Nimbhorkar, Prajakta, Rameshwar, V. Arvind

Volltext

Expanding Generating Sets for Solvable Permutation Groups von Arvind, V., Mukhopadhyay, Partha, Nimbhorkar, Prajakta, Vasudev, Yadu

Volltext

Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties von Gopal, Kavitha, Nasre, Meghana, Nimbhorkar, Prajakta, Reddy, T. Pradeep

Volltext

Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms von Krishnaa, Prem, Limaye, Girija, Nasre, Meghana, Nimbhorkar, Prajakta

Volltext

Rank-Maximal Matchings – Structure and Algorithms von Ghosal, Pratik, Nasre, Meghana, Nimbhorkar, Prajakta

Volltext

Planar Graph Isomorphism is in Log-Space von Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.

Volltext

Critical Relaxed Stable Matchings with Two-Sided Ties von Nasre, Meghana, Nimbhorkar, Prajakta, Ranjan, Keshav

Volltext bestellen

EFX Exists for Three Types of Agents von V, Vishwa Prakash H, Ghosal, Pratik, Nimbhorkar, Prajakta, Varma, Nithin

Volltext bestellen

EFX Exists for Four Agents with Three Types of Valuations von Ghosal, Pratik, V, Vishwa Prakash H, Nimbhorkar, Prajakta, Varma, Nithin

Volltext bestellen

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints von Louis, Anand, Nasre, Meghana, Nimbhorkar, Prajakta, Sankar, Govind S

Volltext bestellen

Popular Matching with Lower Quotas von Nasre, Meghana, Nimbhorkar, Prajakta

Volltext bestellen

Dynamic Rank Maximal Matchings von Nimbhorkar, Prajakta, RameshwarV, Arvind

Volltext bestellen

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All von Panda, Atasi, Anand, Louis, Nimbhorkar, Prajakta

Volltext

Matchings with Group Fairness Constraints: Online and Offline Algorithms von Sankar, Govind S, Louis, Anand, Nasre, Meghana, Nimbhorkar, Prajakta

Volltext bestellen

Critical Relaxed Stable Matchings with Two-Sided Ties von Nasre, Meghana, Nimbhorkar, Prajakta, Ranjan, Keshav

Volltext

EFX Exists for Three Types of Agents von Vishwa, Prakash H, Ghosal, Pratik, Nimbhorkar, Prajakta, Varma, Nithin

Volltext

Envy-freeness and Relaxed Stability under lower quotas von Krishnaa, Prem, Limaye, Girija, Nasre, Meghana, Nimbhorkar, Prajakta

Volltext bestellen