Saurabh, Saket

13 publications

IJCAI 2025 More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana

AISTATS 2024 Fair Soft Clustering Rune D. Kjærsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line Clemmensen

PGM 2024 Time–Approximation Trade-Offs for Learning Bayesian Networks Madhumita Kundu, Pekka Parviainen, Saket Saurabh

AAAI 2023 Clustering What Matters: Optimal Approximation for Clustering with Outliers Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue

JAIR 2023 Clustering What Matters: Optimal Approximation for Clustering with Outliers Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue

IJCAI 2021 Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon

IJCAI 2020 Well-Structured Committees Sushmita Gupta, Pallavi Jain, Saket Saurabh

IJCAI 2019 On Succinct Encodings for the Tournament Fixing Problem Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi

IJCAI 2018 When Rigging a Tournament, Let Greediness Blind You Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

IJCAI 2018 Winning a Tournament by Any Means Necessary Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

AAAI 2012 Don't Be Strict in Local Search! Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider

AAAI 2010 Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

IJCAI 2009 Local Search: Is Brute-Force Avoidable? Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger