Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaket Saurabh 0001
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Other persons with the same name
- Saket Saurabh 0002 — University of Wisconsin-Madison, USA
- Saket Saurabh 0003 — Tata Consultancy Services, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j195]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): 2065-2086 (2023)- [j194]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85(12): 3717-3740 (2023) - [j193]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78: 143-166 (2023) - [j192]Saket Saurabh, Meirav Zehavi:
Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. 131: 64-85 (2023) - [j191]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: 50-65 (2023) - [j190]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov:
Detours in directed graphs. J. Comput. Syst. Sci. 137: 66-86 (2023) - [j189]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): 702-727 (2023) - [j188]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198(1): 561-593 (2023) - [j187]Abhishek Sahu, Saket Saurabh:
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory Comput. Syst. 67(2): 221-233 (2023) - [j186]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19(2): 11:1-11:68 (2023) - [j185]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942: 47-56 (2023) - [c299]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023: 6666-6674 - [c298]Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - [c297]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - [c296]Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG 2023: 12:1-12:14 - [c295]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: 13:1-13:15 - [c294]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - [c293]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - [c292]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA 2023: 63:1-63:17 - [c291]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Breaking the All Subsets Barrier for Min k-Cut. ICALP 2023: 90:1-90:19 - [c290]Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. ISAAC 2023: 53:1-53:17 - [c289]Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma:
Burn and Win. IWOCA 2023: 36-48 - [c288]Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [c287]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023: 55:1-55:14 - [c286]Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15 - [c285]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. SODA 2023: 2228-2241 - [c284]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - [c283]P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. SOFSEM 2023: 177-191 - [c282]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [i146]Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR abs/2303.07923 (2023) - [i145]Ajaykrishnan E. S, Soumen Maity, Abhishek Sahu, Saket Saurabh:
An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR abs/2303.10866 (2023) - [i144]Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - [i143]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR abs/2304.13695 (2023) - [i142]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. CoRR abs/2305.03985 (2023) - [i141]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR abs/2307.08854 (2023) - [i140]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i139]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. CoRR abs/2308.02188 (2023) - [i138]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023) - [i137]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. CoRR abs/2308.07099 (2023) - [i136]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR abs/2308.10657 (2023) - [i135]Sushmita Gupta, Pallavi Jain, Saket Saurabh:
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR abs/2309.04995 (2023) - [i134]Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. CoRR abs/2310.00600 (2023) - [i133]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 abs/2310.03469 (2023) - 2022
- [j184]Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica 84(2): 405-435 (2022) - [j183]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [j182]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84(9): 2622-2641 (2022) - [j181]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022) - [j180]Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84(11): 3246-3275 (2022) - [j179]C. Aiswarya, Vikraman Arvind, Saket Saurabh:
Theory research in India: 2019-2022. Commun. ACM 65(11): 88-93 (2022) - [j178]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. 129: 22-38 (2022) - [j177]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022) - [j176]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): 1866-1930 (2022) - [j175]Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36(1): 596-681 (2022) - [j174]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): 911-921 (2022) - [j173]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915: 74-89 (2022) - [j172]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934: 47-64 (2022) - [c281]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG 2022: 11:1-11:16 - [c280]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG 2022: 52:1-52:14 - [c279]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Algorithms for Finding Highly Connected Solution. CSR 2022: 1-16 - [c278]Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh:
Output Sensitive Fault Tolerant Maximum Matching. CSR 2022: 115-132 - [c277]Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh:
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR 2022: 152-169 - [c276]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM 2022 - [c275]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC 2022: 1:1-1:16 - [c274]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. IPEC 2022: 13:1-13:14 - [c273]Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma:
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - [c272]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh:
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS 2022: 6:1-6:15 - [c271]M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma:
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS 2022: 78:1-78:15 - [c270]Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - [c269]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c268]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA 2022: 2005-2031 - [c267]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA 2022: 2063-2084 - [c266]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - [c265]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS 2022: 39:1-39:20 - [c264]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC 2022: 914-923 - [i132]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - [i131]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Complexity of Graph Partitioning into Connected Clusters. CoRR abs/2202.12042 (2022) - [i130]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR abs/2203.08193 (2022) - [i129]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR abs/2203.09106 (2022) - [i128]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi:
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR abs/2208.01953 (2022) - [i127]Ajinkya Gaikwad, Soumen Maity, Saket Saurabh:
Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR abs/2208.03491 (2022) - [i126]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. CoRR abs/2208.06847 (2022) - [i125]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR abs/2210.03932 (2022) - [i124]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR abs/2210.14629 (2022) - [i123]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR abs/2210.14638 (2022) - [i122]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A Framework for Approximation Schemes on Disk Graphs. CoRR abs/2211.02717 (2022) - [i121]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. CoRR abs/2211.09603 (2022) - [i120]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR abs/2212.00696 (2022) - 2021
- [j171]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83(2): 753-774 (2021) - [j170]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j169]Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Approximation in (Poly-) Logarithmic Space. Algorithmica 83(7): 2303-2331 (2021) - [j168]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291: 286-299 (2021) - [j167]Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12(2): 126-148 (2021) - [j166]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström:
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17(1): 6:1-6:30 (2021) - [j165]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [j164]Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17(3): 26:1-26:44 (2021) - [j163]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale:
Paths to trees and cacti. Theor. Comput. Sci. 860: 98-116 (2021) - [j162]Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh:
Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. 867: 1-12 (2021) - [j161]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883: 19-43 (2021) - [j160]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021) - [j159]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13(2): 10:1-10:25 (2021) - [j158]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021) - [j157]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13(4): 27:1-27:40 (2021) - [c263]Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma:
Circumventing Connectivity for Kernelization. CIAC 2021: 300-313 - [c262]Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh:
k-Distinct Branchings Admits a Polynomial Kernel. ESA 2021: 11:1-11:15 - [c261]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS 2021: 21:1-21:16 - [c260]Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS 2021: 28:1-28:9 - [c259]Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI 2021: 217-223 - [c258]Akanksha Agrawal, Aditya Anand, Saket Saurabh:
A Polynomial Kernel for Deletion to Ptolemaic Graphs. IPEC 2021: 1:1-1:15 - [c257]Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18 - [c256]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [c255]Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA 2021: 179-198 - [c254]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. SODA 2021: 199-218 - [c253]Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh:
Strong Connectivity Augmentation is FPT. SODA 2021: 219-234 - [c252]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA 2021: 822-839 - [c251]