Saket Saurabh
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
277
Venues
31
Active years
2002–2026
Best venue rank
A*
Where they publish
- A*SODA44 papers
- A*ICALP26 papers
- BMFCS23 papers
- ASTACS20 papers
- AESA17 papers
- BISAAC16 papers
- NationalCOCOON16 papers
- BLATIN15 papers
- CIWOCA11 papers
- A*STOC10 papers
- BWG9 papers
- NationalCSR9 papers
- BSOFSEM8 papers
- BWADS8 papers
- A*IJCAI7 papers
- A*FOCS7 papers
- CCIAC6 papers
- BWALCOM4 papers
- A*AAAI3 papers
- BSAGT3 papers
- BFCT2 papers
- AGECCO2 papers
- CTAMC2 papers
- CCOCOA2 papers
- AAISTATS1 paper
- AECAI1 paper
- NationalISAIM1 paper
- BCPM1 paper
- NationalFAW1 paper
- ASAT1 paper
- BWAOA1 paper
Papers
277 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Computational Boundaries for Escaping Rectangles. | Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia |
| 2026 | ESA | Covering Points with Rectangular Boundaries. | Madhumita Kundu, Daniel Lokshtanov, Soumi Nandi, Saket Saurabh, Kushal Singanporia |
| 2026 | IWOCA | Dominating Set with Quotas: Balancing Coverage and Constraints. | Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman, Anannya Upasana |
| 2026 | MFCS | The Parameterized Complexity of Maximum Span on Natural Matroid Classes. | Madhumita Kundu, Ashutosh Rai, Sahiba, Saket Saurabh |
| 2026 | MFCS | Bi-Criteria Approximations for Vertex Deletion Problems and d-Hitting Set. | Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2026 | SODA | Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2026 | STOC | Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks. | Ishan Chakraborty, Tanmay Inamdar, Ariel Kulik, Madhumita Kundu, Saket Saurabh |
| 2026 | STOC | Fine-Grained Bounds for Courcelle's Theorem. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2026 | SOFSEM | Parameterized Algorithms for Locally Minimal Defensive Alliance. | Ajinkya Gaikwad, Soumen Maity, Saket Saurabh |
| 2026 | WG | Polynomial Kernels for Spanning Tree with Diversity Requirements. | Petr A. Golovach, Diptapriyo Majumdar, Saket Saurabh |
| 2025 | CIAC | Parameterized Complexity of Disconnected Matchings. | Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh |
| 2025 | CIAC | Nonpartisan Feedback Vertex Set. | Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | FCT | On the Parameterized Complexity of Connected Cluster Vertex Deletion. | Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh |
| 2025 | FCT | On the Parameterized Complexity of Cosecure Domination. | D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi |
| 2025 | ICALP | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | IJCAI | More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. | Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | ISAAC | Parameterized Reunion with Achromatic Number. | Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | IWOCA | Parameterized Algorithms for Power Edge Set and Zero Forcing Set. | Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh |
| 2025 | IWOCA | Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. | Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh |
| 2025 | MFCS | Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components. | Sriram Bhyravarapu, Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, Saket Saurabh |
| 2025 | MFCS | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. | Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2025 | SODA | PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. | Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | SODA | Fixed-Parameter Tractability of Hedge Cut. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh |
| 2025 | SODA | Crossing Number in Slightly Superexponential Time (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi |
| 2025 | SODA | Parameterized Approximation for Capacitated | Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2025 | STOC | Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STOC | Subexponential Parameterized Algorithms for Hitting Subgraphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STACS | Parameterized Saga of First-Fit and Last-Fit Coloring. | Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2025 | STACS | Multivariate Exploration of Metric Dilation. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2025 | STACS | MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. | Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma |
| 2025 | SOFSEM | Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. | Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh |
| 2025 | SOFSEM | Parameterized Complexity of Generalizations of Edge Dominating Set. | Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | SOFSEM | On the Structural Parameterized Complexity of Defective Coloring. | Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh |
| 2025 | SOFSEM | On the Complexity of Minimum Membership Dominating Set. | D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman |
| 2025 | WG | Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT. | Sriram Bhyravarapu, Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy, Saket Saurabh |
| 2025 | WG | Chromatic Index Under Parameterized Settings. | Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh, Shaily Verma |
| 2024 | AISTATS | Fair Soft Clustering. | Rune D. Kjrsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line H. Clemmensen |
| 2024 | ECAI | Discovering Bayesian Networks when Few Variables Matter. | Madhumita Kundu, Pekka Parviainen, Saket Saurabh |
| 2024 | ESA | Cuts in Graphs with Matroid Constraints. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2024 | FOCS | Efficient Approximation of Fractional Hypertree Width. | Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2024 | ICALP | Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. | Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | IWOCA | Parameterized Complexity of Paired Domination. | Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma |
| 2024 | LATIN | Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. | Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman |
| 2024 | LATIN | Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | LATIN | Parameterized Approximation Algorithms for Weighted Vertex Cover. | Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh |
| 2024 | MFCS | Breaking a Graph into Connected Components with Small Dominating Sets. | Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh |
| 2024 | SODA | Odd Cycle Transversal on | Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma |
| 2024 | SODA | Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2024 | SODA | Meta-theorems for Parameterized Streaming Algorithms‡. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2024 | SOFSEM | On the Parameterized Complexity of Minus Domination. | Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh |
| 2024 | WG | Roman Cycle Hitting Set. | Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia |
| 2023 | AAAI | Clustering What Matters: Optimal Approximation for Clustering with Outliers. | Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue |
| 2023 | CIAC | Partitioning Subclasses of Chordal Graphs with Few Deletions. | Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2023 | ESA | Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). | Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | ESA | A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. | Jrgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh |
| 2023 | ESA | Kernelization for Spreading Points. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2023 | ESA | Lossy Kernelization for (Implicit) Hitting Set Problems. | Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2023 | ICALP | Breaking the All Subsets Barrier for Min k-Cut. | Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2023 | ISAAC | On the Complexity of the Eigenvalue Deletion Problem. | Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar |
| 2023 | IWOCA | Burn and Win. | Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma |
| 2023 | IWOCA | Parameterized Algorithms for Eccentricity Shortest Path Problem. | Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma |
| 2023 | MFCS | Fixed-Parameter Algorithms for Fair Hitting Set Problems. | Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh |
| 2023 | MFCS | Parameterized Approximation Scheme for Feedback Vertex Set. | Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2023 | SODA | Parameterized Approximation Scheme for Biclique-free Max | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2023 | SODA | A Framework for Approximation Schemes on Disk Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2023 | SOFSEM | Balanced Substructures in Bicolored Graphs. | P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma |
| 2023 | WADS | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2022 | CSR | Parameterized Algorithms for Finding Highly Connected Solution. | Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh |
| 2022 | CSR | Output Sensitive Fault Tolerant Maximum Matching. | Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh |
| 2022 | CSR | Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. | Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh |
| 2022 | ISAIM | Parameterized Analysis for the Group Activity Selection Problem on Graphs. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2022 | LATIN | List Homomorphism: Beyond the Known Boundaries. | Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2022 | MFCS | Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. | Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh |
| 2022 | MFCS | An Exact Algorithm for Knot-Free Vertex Deletion. | M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2022 | SODA | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | SODA | Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue |
| 2022 | SODA | Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2022 | STOC | Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2022 | STACS | Detours in Directed Graphs. | Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh |
| 2022 | STACS | Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. | Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh |
| 2022 | SAGT | Gehrlein Stable Committee with Multi-modal Preferences. | Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh |
| 2021 | CIAC | Circumventing Connectivity for Kernelization. | Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma |
| 2021 | ESA | k-Distinct Branchings Admits a Polynomial Kernel. | Jrgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh |
| 2021 | GECCO | A divide and conquer approach for web services location allocation problem. | Harshal Tupsamudre, Saket Saurabh, Arun Ramamurthy, Mangesh S. Gharote, Sachin Lodha |
| 2021 | IJCAI | Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. | Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon |
| 2021 | SODA | Strong Connectivity Augmentation is FPT. | Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh |
| 2021 | SODA | A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. | Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri |
| 2021 | SODA | FPT-approximation for FPT Problems. | Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2021 | SODA | Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). | Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | STACS | An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. | Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2021 | STACS | Diverse Collections in Matroids and Graphs. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | STACS | Exploiting Dense Structures in Parameterized Complexity. | William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | SAGT | Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. | Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh |
| 2021 | WG | Odd Cycle Transversal in Mixed Graphs. | Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh |
| 2020 | COCOON | Parameterized Complexity of Maximum Edge Colorable Subgraph. | Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale |
| 2020 | COCOON | Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh |
| 2020 | CSR | Parameterized Complexity of Fair Feedback Vertex Set Problem. | Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh |
| 2020 | CSR | Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. | Abhishek Sahu, Saket Saurabh |
| 2020 | FOCS | A Parameterized Approximation Scheme for Min $k$-Cut. | Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan |
| 2020 | ICALP | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. | Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi |
| 2020 | ICALP | A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | IJCAI | Well-Structured Committees. | Sushmita Gupta, Pallavi Jain, Saket Saurabh |
| 2020 | ISAAC | Improved FPT Algorithms for Deletion to Forest-Like Structures. | Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh |
| 2020 | IWOCA | On the Complexity of Singly Connected Vertex Deletion. | Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh |
| 2020 | LATIN | Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. | Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2020 | MFCS | Approximation in (Poly-) Logarithmic Space. | Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2020 | MFCS | Quick Separation in Chordal and Split Graphs. | Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma |
| 2020 | MFCS | On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. | Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma |
| 2020 | SODA | Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | SODA | 2-Approximating Feedback Vertex Set in Tournaments. | Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | SODA | Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | Hitting topological minors is FPT. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | An exponential time parameterized algorithm for planar disjoint paths. | Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi |
| 2019 | CIAC | Subset Feedback Vertex Set in Chordal and Split Graphs. | Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale |
| 2019 | COCOON | Fully Dynamic Arboricity Maintenance. | Niranka Banerjee, Venkatesh Raman, Saket Saurabh |
| 2019 | COCOON | An Erdős-Psa Theorem on Neighborhoods and Domination Number. | Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh |
| 2019 | CSR | On the Complexity of Mixed Dominating Set. | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh |
| 2019 | CSR | On the Parameterized Complexity of Edge-Linked Paths. | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2019 | ESA | Going Far From Degeneracy. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Path Contraction Faster Than 2 | Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale |
| 2019 | ICALP | Approximate Counting of k-Paths: Deterministic and in Polynomial Space. | Andreas Bjrklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Decomposition of Map Graphs with Applications. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | IJCAI | On Succinct Encodings for the Tournament Fixing Problem. | Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi |
| 2019 | ISAAC | Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. | Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh |
| 2019 | IWOCA | Solving Group Interval Scheduling Efficiently. | Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2019 | MFCS | Parameterized Complexity of Conflict-Free Matchings and Paths. | Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh |
| 2019 | MFCS | Packing Arc-Disjoint Cycles in Tournaments. | Stphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi |
| 2019 | SODA | Interval Vertex Deletion Admits a Polynomial Kernel. | Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | SODA | Popular Matching in Roommates Setting is NP-hard. | Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2019 | SODA | Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | WADS | Balanced Stable Marriage: How Close Is Close Enough? | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2019 | WADS | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2019 | WALCOM | Parameterized Computational Geometry via Decomposition Theorems. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2018 | COCOON | Hitting and Covering Partially. | Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh |
| 2018 | CSR | Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. | Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi |
| 2018 | ESA | On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2018 | GECCO | A parameterized runtime analysis of randomized local search and evolutionary algorithm for max | Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh |
| 2018 | ICALP | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ICALP | Reducing CMSO Model Checking to Highly Connected Graphs. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | IJCAI | When Rigging a Tournament, Let Greediness Blind You. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2018 | IJCAI | Winning a Tournament by Any Means Necessary. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2018 | ISAAC | Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh |
| 2018 | LATIN | The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. | R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2018 | LATIN | A Polynomial Sized Kernel for Tracking Paths Problem. | Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2018 | MFCS | Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. | Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh |
| 2018 | SODA | Parameterized Algorithms for Survivable Network Design with Uniform Demands. | Jrgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. | Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2018 | SODA | Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. | Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2018 | SODA | Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | SODA | When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2018 | STACS | Erds-Psa Property of Obstructions to Interval Graphs. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | CIAC | Paths to Trees and Cacti. | Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale |
| 2017 | COCOON | Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. | Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | ESA | A Linear-Time Parameterized Algorithm for Node Unique Label Cover. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2017 | ICALP | Covering Vectors by Spaces: Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | ICALP | Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2017 | ICALP | Packing Cycles Faster Than Erdos-Posa. | Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi |
| 2017 | MFCS | Parameterized Algorithms and Kernels for Rainbow Matching. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2017 | MFCS | Communication Complexity of Pairs of Graph Families with Applications. | Sudeshna Kolay, Fahad Panolan, Saket Saurabh |
| 2017 | SODA | Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | SODA | Spanning Circuits in Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | SODA | Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. | Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna |
| 2017 | STOC | Lossy kernelization. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | STACS | Split Contraction: The Untold Story. | Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2017 | STACS | Matrix Rigidity from the Viewpoint of Parameterized Complexity. | Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi |
| 2017 | SAGT | Group Activity Selection on Graphs: Parameterized Analysis. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2017 | SOFSEM | Parameterized and Exact Algorithms for Class Domination Coloring. | R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale |
| 2017 | WADS | Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. | Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2017 | WADS | Parameterized Complexity of Geometric Covering Problems Having Conflicts. | Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh |
| 2016 | FOCS | Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. | Fedor V. Fomin, Daniel Lokshtanov, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2016 | ICALP | Kernelization of Cycle Packing with Relaxed Disjointness Constraints. | Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh |
| 2016 | ISAAC | Simultaneous Feedback Edge Set: A Parameterized Perspective. | Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2016 | ISAAC | Kernels for Deletion to Classes of Acyclic Digraphs. | Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2016 | LATIN | A Parameterized Algorithm for Mixed-Cut. | Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2016 | LATIN | A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. | Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh |
| 2016 | LATIN | Parameterized Complexity of Red Blue Set Cover for Lines. | Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh |
| 2016 | LATIN | Rank Reduction of Directed Graphs by Vertex and Edge Deletions. | Syed Mohammad Meesum, Saket Saurabh |
| 2016 | LATIN | (k, n-k)-Max-Cut: An 𝒪 | Saket Saurabh, Meirav Zehavi |
| 2016 | MFCS | Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. | Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh |
| 2016 | STOC | Exact algorithms via monotone local search. | Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh |
| 2016 | STACS | Simultaneous Feedback Vertex Set: A Parameterized Perspective. | Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh |
| 2016 | STACS | Kernelization and Sparseness: the Case of Dominating Set. | Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2016 | STACS | Editing to Connected f-Degree Graph. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh |
| 2015 | COCOON | Unique Covering Problems with Geometric Sets. | Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh |
| 2015 | COCOON | Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. | Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh |
| 2015 | COCOON | Reducing Rank of the Adjacency Matrix by Graph Modification. | Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh |
| 2015 | COCOON | Bivariate Complexity Analysis of Almost Forest Deletion. | Ashutosh Rai, Saket Saurabh |
| 2015 | CPM | Parameterized Complexity of Superstring Problems. | Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh |
| 2015 | FAW | Graph Modification Problems: A Modern Perspective. | Fedor V. Fomin, Saket Saurabh, Neeldhara Misra |
| 2015 | FOCS | FO Model Checking on Posets of Bounded Width. | Jakub Gajarsk, Petr Hlinen, Daniel Lokshtanov, Jan Obdrzlek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh |
| 2015 | ICALP | Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. | Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2015 | ICALP | Uniform Kernelization Complexity of Hitting Forbidden Minors. | Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh |
| 2015 | ICALP | Deterministic Truncation of Linear Matroids. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2015 | ICALP | Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2015 | MFCS | Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. | Geevarghese Philip, Ashutosh Rai, Saket Saurabh |
| 2015 | SODA | Solving | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh |
| 2015 | WADS | Reconfiguration on Sparse Graphs. | Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2015 | WADS | On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. | Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2014 | COCOON | On the Kernelization Complexity of String Problems. | Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2014 | ESA | Representative Sets of Product Families. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2014 | ESA | Solving Multicut Faster Than 2 n. | Daniel Lokshtanov, Saket Saurabh, Ondrej Such |
| 2014 | FOCS | Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2014 | ICALP | Parameterized Algorithms to Preserve Connectivity. | Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | MFCS | Parameterized Approximations via d-Skew-Symmetric Multicut. | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | SODA | Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2014 | SODA | A Near-Optimal Planarization Algorithm. | Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh |
| 2014 | SODA | Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. | M. S. Ramanujan, Saket Saurabh |
| 2014 | STOC | Minimum bisection is fixed parameter tractable. | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2013 | ESA | Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. | Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Such |
| 2013 | MFCS | Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2013 | STACS | Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2013 | STACS | Backdoors to q-Horn. | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
| 2013 | WALCOM | An FPT Algorithm for Tree Deletion Set. | Venkatesh Raman, Saket Saurabh, Ondrej Such |
| 2013 | WG | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2012 | AAAI | Don't Be Strict in Local Search! | Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider |
| 2012 | ESA | A Polynomial Kernel for Proper Interval Vertex Deletion. | Fedor V. Fomin, Saket Saurabh, Yngve Villanger |
| 2012 | FOCS | Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2012 | LATIN | Parameterized Complexity of MaxSat above Average. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh |
| 2012 | LATIN | New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. | Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh |
| 2012 | MFCS | Parameterized Study of the Test Cover Problem. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo |
| 2012 | SODA | Bidimensionality and geometric graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2012 | SODA | Linear kernels for (connected) dominating set on | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2012 | STACS | LP can be a cure for Parameterized Problems. | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2012 | SAT | Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. | Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo |
| 2012 | WG | Parameterized Algorithms for Even Cycle Transversal. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | COCOON | On Parameterized Independent Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
| 2011 | ESA | Hitting and Harvesting Pumpkins. | Gwenal Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stphan Thomass |
| 2011 | ESA | Paths, Flowers and Vertex Cover. | Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | ICALP | Tight Bounds for Linkages in Planar Graphs. | Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2011 | ISAAC | A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
| 2011 | IWOCA | Algorithmic Aspects of Dominator Colorings in Graphs. | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | SODA | Bidimensionality and EPTAS. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2011 | SODA | Slightly Superexponential Parameterized Problems. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |
| 2011 | SODA | Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. | Daniel Lokshtanov, Dniel Marx, Saket Saurabh |
| 2011 | STACS | Hitting forbidden minors: Approximation and Kernelization. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | WALCOM | Approximation Algorithms for Minimum Chain Vertex Deletion. | Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh |
| 2011 | WG | Planar k-Path in Subexponential Time and Polynomial Space. | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
| 2010 | AAAI | Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | COCOON | The Curse of Connectivity: | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
| 2010 | COCOON | Imbalance Is Fixed Parameter Tractable. | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2010 | ISAAC | Parameterized Algorithms for Boxicity. | Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh |
| 2010 | IWOCA | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | LATIN | Sharp Separation and Applications to Exact and Parameterized Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh |
| 2010 | SODA | Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2010 | SODA | Bidimensionality and Kernels. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2010 | STACS | Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | WALCOM | FPT Algorithms for Connected Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2009 | COCOON | Algorithm for Finding | Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo |
| 2009 | CSR | The Budgeted Unique Coverage Problem and Color-Coding. | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2009 | FOCS | (Meta) Kernelization. | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
| 2009 | ICALP | Fast FAST. | Noga Alon, Daniel Lokshtanov, Saket Saurabh |
| 2009 | ICALP | Counting Subgraphs via Homomorphisms. | Omid Amini, Fedor V. Fomin, Saket Saurabh |
| 2009 | ICALP | Incompressibility through Colors and IDs. | Michael Dom, Daniel Lokshtanov, Saket Saurabh |
| 2009 | ICALP | Distortion Is Fixed Parameter Tractable. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
| 2009 | IJCAI | Local Search: Is Brute-Force Avoidable? | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
| 2009 | ISAAC | A Linear Vertex Kernel for Maximum Internal Spanning Tree. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stphan Thomass |
| 2009 | ISAAC | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | IWOCA | Simpler Parameterized Algorithm for OCT. | Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
| 2009 | SODA | Clique-width: on the price of generality. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2009 | STACS | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
| 2009 | TAMC | Linear Kernel for Planar Connected Dominating Set. | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
| 2009 | WG | An Exact Algorithm for Minimum Distortion Embedding. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2008 | COCOA | Parameterized Algorithms for Generalized Domination. | Venkatesh Raman, Saket Saurabh, Sriganesh Srihari |
| 2008 | ISAAC | Graph Layout Problems Parameterized by Vertex Cover. | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
| 2008 | ISAAC | Knig Deletion Sets and Vertex Covers above the Matching Size. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2008 | MFCS | Iterative Compression and Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
| 2008 | TAMC | A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. | Serge Gaspers, Saket Saurabh, Alexey A. Stepanov |
| 2008 | WAOA | Degree-Constrained Subgraph Problems: Hardness and Approximation Results. | Omid Amini, David Peleg, Stphane Prennes, Ignasi Sau, Saket Saurabh |
| 2007 | COCOA | On the Complexity of Some Colorful Problems Parameterized by Treewidth. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
| 2007 | COCOON | Improved Exact Algorithms for Counting 3- and 4-Colorings. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
| 2007 | ICALP | Parameterized Algorithms for Directed Maximum Leaf Problems. | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh |
| 2007 | ISAAC | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
| 2006 | ISAAC | Branching and Treewidth Based Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
| 2003 | WADS | Parameterized Complexity of Directed Feedback Set Problems in Tournaments. | Venkatesh Raman, Saket Saurabh |
| 2002 | ISAAC | Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. | Venkatesh Raman, Saket Saurabh, C. R. Subramanian |