Follow
Govind S. Sankar
Govind S. Sankar
Verified email at duke.edu
Title
Cited by
Cited by
Year
Matchings with group fairness constraints: Online and offline algorithms
GS Sankar, A Louis, M Nasre, P Nimbhorkar
arXiv preprint arXiv:2105.09522, 2021
192021
Degrees and gaps: Tight complexity results of general factor problems parameterized by treewidth and cutwidth
D Marx, GS Sankar, P Schepper
arXiv preprint arXiv:2105.08980, 2021
172021
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
J Focke, D Marx, FM Inerney, D Neuen, GS Sankar, P Schepper, ...
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
122023
Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)
D Marx, GS Sankar, P Schepper
arXiv preprint arXiv:2110.09369, 2021
82021
Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas.
KA Santhini, GS Sankar, M Nasre
AAMAS, 696-704, 2022
62022
Online algorithms for matchings with proportional fairness constraints and diversity constraints
A Louis, M Nasre, P Nimbhorkar, GS Sankar
ECAI 2023, 1601-1608, 2023
32023
Individual Fairness in Graph Decomposition
K Munagala, GS Sankar
arXiv preprint arXiv:2406.00213, 2024
2024
Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization
A Santhini K, K Munagala, M Nasre, GS Sankar
arXiv e-prints, arXiv: 2403.15623, 2024
2024
Data Exchange Markets via Utility Balancing
A Bhaskara, S Gollapudi, S Im, K Kollias, K Munagala, GS Sankar
arXiv preprint arXiv:2401.13053, 2024
2024
Probabilistic Metric Embedding via Metric Labeling
K Munagala, GS Sankar, E Taylor
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2023
2023
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
J Focke, D Marx, FM Inerney, D Neuen, GS Sankar, P Schepper, ...
arXiv preprint arXiv:2211.04278, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–11