Govind S. Sankar

Orcid: 0000-0002-7443-9599

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Data Exchange Markets via Utility Balancing.
Proceedings of the ACM on Web Conference 2024, 2024

Individual Fairness in Graph Decomposition.
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.
CoRR, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.
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.
Proceedings of the Approximation, 2023

2022
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results.
CoRR, 2022

Matchings Under Diversity Constraints.
CoRR, 2022

Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard).
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms.
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.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021


  Loading...