Govind S. Sankar

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 17

Top Topics

Tight Complexity Bounds

Monadic Datalog

Bounded Treewidth

Top Venues

Publications

Santhini K. A., Kamesh Munagala, Meghana Nasre, Govind S. Sankar
Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization. CoRR (2024)
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar
Data Exchange Markets via Utility Balancing. CoRR (2024)
Kamesh Munagala, Govind S. Sankar
Individual Fairness in Graph Decomposition. CoRR (2024)
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar
Data Exchange Markets via Utility Balancing. WWW (2024)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA (2023)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR (2023)
Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. ECAI (2023)
Kamesh Munagala, Govind S. Sankar, Erin Taylor
Probabilistic Metric Embedding via Metric Labeling. APPROX/RANDOM (2023)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings Under Diversity Constraints. CoRR (2022)
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. CoRR (2022)
Santhini K. A., Govind S. Sankar, Meghana Nasre
Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas. AAMAS (2022)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC (2022)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. ICALP (2021)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. IJCAI (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. CoRR (2021)
Dániel Marx, Govind S. Sankar, Philipp Schepper
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). CoRR (2021)
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
Matchings with Group Fairness Constraints: Online and Offline Algorithms. CoRR (2021)