Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. - Dániel Marx; Govind S. Sankar; Philipp Schepper (ICALP, 2021)

Matchings with Group Fairness Constraints: Online and Offline Algorithms. - Govind S. Sankar; Anand Louis; Meghana Nasre; Prajakta Nimbhorkar (IJCAI, 2021)

Matchings Under Diversity Constraints. - Govind S. Sankar; Anand Louis; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2022)

Probabilistic Metric Embedding via Metric Labeling. - Kamesh Munagala; Govind S. Sankar; Erin Taylor 002 (APPROX/RANDOM, 2023)

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. - Anand Louis; Meghana Nasre; Prajakta Nimbhorkar; Govind S. Sankar (ECAI, 2023)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (SODA, 2023)

Individual Fairness in Graph Decomposition. - Kamesh Munagala; Govind S. Sankar (ICML, 2024)

Data Exchange Markets via Utility Balancing. - Aditya Bhaskara; Sreenivas Gollapudi; Sungjin Im; Kostas Kollias; Kamesh Munagala; Govind S. Sankar (WWW, 2024)

Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization. - Santhini K. A.; Kamesh Munagala; Meghana Nasre; Govind S. Sankar (CoRR, 2024)

Group Fairness and Multi-Criteria Optimization in School Assignment. - Santhini K. A.; Kamesh Munagala; Meghana Nasre; Govind S. Sankar (FORC, 2025)

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). - Dániel Marx; Govind S. Sankar; Philipp Schepper (Algorithmica, 2025)

Optimal matchings with one-sided preferences: fixed and cost-based quotas. - Santhini K. A.; Govind S. Sankar; Meghana Nasre (Auton. Agents Multi Agent Syst., 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Comput. Theory, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Algorithms, 2025)