Scholar
Govind S. Sankar
Google Scholar ID: WZpHNbAAAAAJ
Duke University
Citations & Impact
Citations
124
H-index
6
i10-index
4
Publications
16
Co-authors
5
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Publications:
- - Balanced Spanning Tree Distributions Have Separation Fairness, SODA 2026
- - Group Fairness and Multi-criteria Optimization in School Assignment, FORC 2025 (Best student paper)
- - Individual Fairness in Graph Decomposition, ICML 2024 (Spotlight paper, 3.5% acceptance rate)
- - Data exchange markets via utility balancing, WWW 2024
- - Probabilistic Metric Embedding via Metric Labeling, APPROX 2023
- - Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs, SODA 2023
- - Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas, AAMAS 2022
- - Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard), IPEC 2022
- - Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth, ICALP 2021
- - Matchings with Group Fairness Constraints: Online and Offline Algorithms, IJCAI 2021
Research Experience
- Work Experience and Research Projects: Currently pursuing doctoral research focused on algorithms for fairness.
Education
- Degree: Dual Degree (Bachelor + Master of Technology); Institution: Indian Institute of Technology Madras; Advisor: Kamesh Munagala; Time: Not specified; Major: Electrical Engineering.
Background
- Research Interests: Algorithms for problems modeling various notions of fairness; Field: Computer Science; Brief Introduction: Fourth-year PhD candidate in the Computer Science Department at Duke University.
