Saket Saurabh

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 440

Top Venues

CoRR

Algorithmica

SODA

ACM Trans. Algorithms

Publications

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA (2024)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Math. Program. 204 (1) (2024)
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
-free Graphs in Polynomial Time. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. SWAT (2024)
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR (2024)
Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. SWAT (2024)
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR (2024)
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
Balanced Substructures in Bicolored Graphs. CoRR (2024)
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Kernelization of Counting Problems. ITCS (2024)
Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. 71 (2) (2024)
Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica 86 (5) (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. CoRR (2024)
Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh
Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) (2024)
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
Cuts in Graphs with Matroid Constraints. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. CoRR (2024)
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Conflict and Fairness in Resource Allocation. CoRR (2024)
Rune D. Kjærsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line H. Clemmensen
Fair Soft Clustering. AISTATS (2024)
Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh
Exponential-Time Approximation Schemes via Compression. ITCS (2024)
Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. CoRR (2024)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20 (3) (2024)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) (2024)
Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. LATIN (1) (2024)
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma
-free Graphs in Quasi-polynomial Time. SODA (2024)
Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
On the Parameterized Complexity of Minus Domination. SOFSEM (2024)
Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. 983 (2024)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms‡. SODA (2024)
Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma
Parameterized Complexity of Paired Domination. IWOCA (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG (2024)
Fahad Panolan, Saket Saurabh, Meirav Zehavi
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20 (2) (2024)
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. SODA (2023)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67 (6) (2023)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78 (2023)
Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
On the Complexity of the Eigenvalue Deletion Problem. CoRR (2023)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19 (2) (2023)
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. CoRR (2023)
Ajaykrishnan E. S, Soumen Maity, Abhishek Sahu, Saket Saurabh
An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS (2023)
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37 (4) (2023)
Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. SoCG (2023)
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198 (1) (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG (2023)
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
Balanced Substructures in Bicolored Graphs. SOFSEM (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR (2023)
Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA (2023)
Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma
Burn and Win. IWOCA (2023)
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102 (4) (2023)
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS (2023)
Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
Breaking the All Subsets Barrier for Min k-Cut. ICALP (2023)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms. CoRR (2023)
Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC (2023)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. 137 (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS (2023)
Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC (2023)
Sushmita Gupta, Pallavi Jain, Saket Saurabh
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. CoRR (2023)
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942 (2023)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
Detours in directed graphs. J. Comput. Syst. Sci. 137 (2023)
Abhishek Sahu, Saket Saurabh
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory Comput. Syst. 67 (2) (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR (2023)
Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85 (7) (2023)
Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR (2023)
Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
On the Complexity of the Eigenvalue Deletion Problem. ISAAC (2023)
Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. ESA (2023)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI (2023)
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85 (12) (2023)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR (2023)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
-Weight SAT and Max Coverage. SODA (2023)
Saket Saurabh, Meirav Zehavi
Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. 131 (2023)
Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Kernelization of Counting Problems. CoRR (2023)
Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
Gehrlein Stable Committee with Multi-modal Preferences. SAGT (2022)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG (2022)
Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR (2022)
Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. 51 (6) (2022)
M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS (2022)
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36 (1) (2022)
Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh
Output Sensitive Fault Tolerant Maximum Matching. CSR (2022)
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. CoRR (2022)
C. Aiswarya, Vikraman Arvind, Saket Saurabh
Theory research in India: 2019-2022. Commun. ACM 65 (11) (2022)
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2022)
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR (2022)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR (2022)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915 (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA (2022)
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG (2022)

Saket Saurabh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Saket Saurabh