Govind S. Sankar

According to our database, Govind S. Sankar authored at least 13 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., June, 2025

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard).

Dániel Marx, Govind S. Sankar, Philipp Schepper

Algorithmica, January, 2025

2024

Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization.

Santhini K. A., Kamesh Munagala, Meghana Nasre, Govind S. Sankar

CoRR, 2024

Data Exchange Markets via Utility Balancing.

Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar

Proceedings of the ACM on Web Conference 2024, 2024

Individual Fairness in Graph Decomposition.

Kamesh Munagala, Govind S. Sankar

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

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

CoRR, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

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

Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Probabilistic Metric Embedding via Metric Labeling.

Kamesh Munagala, Govind S. Sankar, Erin Taylor

Proceedings of the Approximation, 2023

2022

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

CoRR, 2022

Matchings Under Diversity Constraints.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2022

2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth.

Dániel Marx, Govind S. Sankar, Philipp Schepper

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021