Saket Saurabh - RankMe

769 papers A* 97A 51B 101C 19Misc 27Journal 401Unranked 68

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality. CoRR Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2026	J	`jnl`	Balanced substructures in bicolored graphs. Theor. Comput. Sci. P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
2026	A	`conf`	FPT Approximations for Connected Maximum Coverage. ITCS Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	FPT Approximations for Connected Maximum Coverage. CoRR Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	On the structural parameterized complexity of defective coloring. J. Comput. Syst. Sci. Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh
2026	J	`jnl`	Packing Short Cycles. ACM Trans. Algorithms Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2026	B	`conf`	Parameterized Algorithms for Locally Minimal Defensive Alliance. SOFSEM Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
2026	J	`jnl`	Parameterized Approximation Schemes for Biclique-Free Max ACM Trans. Algorithms Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2026	—	`conf`	The Sparsification Lemma via Measure and Conquer. SOSA Daniel Lokshtanov, Saket Saurabh, Jie Xue
2026	J	`jnl`	The parameterized complexity landscape of two-sets cut-uncut. Theor. Comput. Sci. Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2026	A*	`conf`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. SODA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. J. Comb. Theory B Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. CoRR Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2025	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. SIAM J. Comput. Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2025	C	`conf`	Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. IWOCA Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh
2025	J	`jnl`	Burn and win. Theor. Comput. Sci. Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma
2025	B	`conf`	Chromatic Index Under Parameterized Settings. WG Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh, Shaily Verma
2025	A*	`conf`	Crossing Number in Slightly Superexponential Time (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi
2025	A*	`conf`	Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	J	`jnl`	Exact and Approximate Digraph Bandwidth. Theory Comput. Syst. Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
2025	A	`conf`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. ITCS Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	J	`jnl`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. CoRR Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	A*	`conf`	Fixed-Parameter Tractability of Hedge Cut. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
2025	J	`jnl`	Fixed-parameter algorithms for Fair Hitting Set problems. Inf. Comput. Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2025	J	`jnl`	Further parameterized results on weak Grundy coloring. Theor. Comput. Sci. D. Karthika, R. Muthucumaraswamy, Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	—	`conf`	Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants. FSTTCS Satyabrata Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh
2025	B	`conf`	Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components. MFCS Sriram Bhyravarapu, Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, Saket Saurabh
2025	J	`jnl`	Max-SAT with cardinality constraint parameterized by the number of clauses. Theor. Comput. Sci. Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2025	J	`jnl`	MaxMin Separation Problems: FPT Algorithms for CoRR Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma
2025	A	`conf`	MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. STACS Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma
2025	A*	`conf`	More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. IJCAI Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	J	`jnl`	More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. CoRR Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	A	`conf`	Multivariate Exploration of Metric Dilation. STACS Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	Multivariate Exploration of Metric Dilation. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	—	`conf`	Nonpartisan Feedback Vertex Set. CIAC (2) Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	J	`jnl`	Odd Cycle Transversal on ACM Trans. Algorithms Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2025	—	`conf`	On the Complexity of Minimum Membership Dominating Set. SOFSEM (1) D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman
2025	B	`conf`	On the Parameterized Complexity of Connected Cluster Vertex Deletion. FCT Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh
2025	B	`conf`	On the Parameterized Complexity of Cosecure Domination. FCT D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi
2025	—	`conf`	On the Structural Parameterized Complexity of Defective Coloring. SOFSEM (1) Sriram Bhyravarapu, Pankaj Kumar, Saket Saurabh
2025	A*	`conf`	PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. SODA Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025	A*	`conf`	Packing Short Cycles. SODA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	C	`conf`	Parameterized Algorithms for Power Edge Set and Zero Forcing Set. IWOCA Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2025	A*	`conf`	Parameterized Approximation for Capacitated SODA Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2025	—	`conf`	Parameterized Complexity of Disconnected Matchings. CIAC (2) Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh
2025	—	`conf`	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. SOFSEM (1) Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh
2025	—	`conf`	Parameterized Complexity of Generalizations of Edge Dominating Set. SOFSEM (1) Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	A	`conf`	Parameterized Geometric Graph Modification with Disk Scaling. ITCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	B	`conf`	Parameterized Reunion with Achromatic Number. ISAAC Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	A	`conf`	Parameterized Saga of First-Fit and Last-Fit Coloring. STACS Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2025	J	`jnl`	Path Contraction Faster than 2 CoRR Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2025	B	`conf`	Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. MFCS Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2025	A*	`conf`	Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. ICALP Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025	A*	`conf`	Subexponential Parameterized Algorithms for Hitting Subgraphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	B	`conf`	Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT. WG Sriram Bhyravarapu, Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy, Saket Saurabh
2025	J	`jnl`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	J	`jnl`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. ACM Trans. Comput. Theory Daniel Lokshtanov, Ramanujan Maadapuzhi Sridharan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2025	A*	`conf`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. SoCG Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2024	J	`jnl`	(Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	A*	`conf`	A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	A Parameterized Approximation Scheme for Min $k$-Cut. SIAM J. Comput. Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2024	J	`jnl`	Balanced Substructures in Bicolored Graphs. CoRR P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
2024	A	`conf`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	B	`conf`	Breaking a Graph into Connected Components with Small Dominating Sets. MFCS Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
2024	J	`jnl`	Conflict and Fairness in Resource Allocation. CoRR Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2024	J	`jnl`	Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms Fahad Panolan, Saket Saurabh, Meirav Zehavi
2024	A	`conf`	Cuts in Graphs with Matroid Constraints. ESA Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	J	`jnl`	Cuts in Graphs with Matroid Constraints. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	A	`conf`	Discovering Bayesian Networks when Few Variables Matter. ECAI Madhumita Kundu, Pekka Parviainen, Saket Saurabh
2024	J	`jnl`	Diverse collections in matroids and graphs. Math. Program. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2024	A*	`conf`	Efficient Approximation of Fractional Hypertree Width. FOCS Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024	J	`jnl`	Efficient Approximation of Fractional Hypertree Width. CoRR Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024	—	`conf`	Eliminating Crossings in Ordered Graphs. SWAT Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024	J	`jnl`	Eliminating Crossings in Ordered Graphs. CoRR Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024	A*	`conf`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	A	`conf`	Exponential-Time Approximation Schemes via Compression. ITCS Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh
2024	A	`conf`	Fair Soft Clustering. AISTATS Rune D. Kjærsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line H. Clemmensen
2024	J	`jnl`	Fixed-Parameter Tractability of Hedge Cut. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
2024	A	`conf`	Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
2024	A	`conf`	Kernelization of Counting Problems. ITCS Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2024	—	`conf`	Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	J	`jnl`	Maximum Partial List H-Coloring on P CoRR Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2024	A*	`conf`	Meta-theorems for Parameterized Streaming Algorithms‡. SODA Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Roohani Sharma, Madhumita Kundu
2024	A*	`conf`	Odd Cycle Transversal on SODA Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma
2024	J	`jnl`	Odd Cycle Transversal on P CoRR Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2024	J	`jnl`	On the Parameterized Complexity of Deletion to $\boldsymbol{\mathcal{H}}$-Free Strong Components. SIAM J. Discret. Math. Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2024	B	`conf`	On the Parameterized Complexity of Minus Domination. SOFSEM Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
2024	J	`jnl`	Packing Short Cycles. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024	—	`conf`	Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh
2024	J	`jnl`	Parameterized Approximation for Capacitated CoRR Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024	C	`conf`	Parameterized Complexity of Paired Domination. IWOCA Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma
2024	J	`jnl`	Parameterized Geometric Graph Modification with Disk Scaling. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Parameterized Saga of First-Fit and Last-Fit Coloring. CoRR Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2024	J	`jnl`	Parameterized approximation algorithms for weighted vertex cover. Theor. Comput. Sci. Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh
2024	J	`jnl`	Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
2024	—	`conf`	Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. LATIN (1) Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
2024	J	`jnl`	Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. CoRR Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
2024	J	`jnl`	Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	B	`conf`	Roman Cycle Hitting Set. WG Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia
2024	A*	`conf`	Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	J	`jnl`	Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	—	`conf`	Stability in Graphs with Matroid Constraints. SWAT Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
2024	J	`jnl`	Stability in Graphs with Matroid Constraints. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
2024	J	`jnl`	Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	B	`conf`	Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh
2024	B	`conf`	The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. IPEC Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2024	J	`jnl`	The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2024	J	`jnl`	The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2024	—	`conf`	Time-Approximation Trade-Offs for Learning Bayesian Networks. PGM Madhumita Kundu, Pekka Parviainen, Saket Saurabh
2024	J	`jnl`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	—	`conf`	When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. FSTTCS Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024	J	`jnl`	When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2023	A*	`conf`	A Framework for Approximation Schemes on Disk Graphs. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	A	`conf`	A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
2023	J	`jnl`	Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2023	B	`conf`	An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	An Improved Exact Algorithm for Knot-Free Vertex Deletion. CoRR Ajaykrishnan E. S., Soumen Maity, Abhishek Sahu, Saket Saurabh
2023	B	`conf`	Balanced Substructures in Bicolored Graphs. SOFSEM P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
2023	A*	`conf`	Breaking the All Subsets Barrier for Min k-Cut. ICALP Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	C	`conf`	Burn and Win. IWOCA Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma
2023	A*	`conf`	Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023	J	`jnl`	Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023	J	`jnl`	Detours in directed graphs. J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
2023	B	`conf`	Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma
2023	J	`jnl`	Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023	J	`jnl`	Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
2023	—	`conf`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	J	`jnl`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	A*	`conf`	FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG Sayan Bandyapadhyay, William Lochet, Saket Saurabh
2023	J	`jnl`	FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR Sayan Bandyapadhyay, William Lochet, Saket Saurabh
2023	B	`conf`	Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023	J	`jnl`	Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023	J	`jnl`	Further Exploiting SIAM J. Discret. Math. Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
2023	J	`jnl`	Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	J	`jnl`	How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR Sushmita Gupta, Pallavi Jain, Saket Saurabh
2023	A	`conf`	Kernelization for Spreading Points. ESA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Kernelization for Spreading Points. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. Theory Comput. Syst. Abhishek Sahu, Saket Saurabh
2023	J	`jnl`	Kernelization of Counting Problems. CoRR Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	A	`conf`	Lossy Kernelization for (Implicit) Hitting Set Problems. ESA Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Meta-theorems for Parameterized Streaming Algorithms. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2023	A*	`conf`	Minimum-Membership Geometric Set Cover, Revisited. SoCG Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023	J	`jnl`	Minimum-Membership Geometric Set Cover, Revisited. CoRR Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023	B	`conf`	On the Complexity of the Eigenvalue Deletion Problem. ISAAC Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
2023	J	`jnl`	On the Complexity of the Eigenvalue Deletion Problem. CoRR Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar
2023	J	`jnl`	On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2023	C	`conf`	Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
2023	A*	`conf`	Parameterized Approximation Scheme for Biclique-free Max SODA Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2023	B	`conf`	Parameterized Approximation Scheme for Feedback Vertex Set. MFCS Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh
2023	A	`conf`	Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	J	`jnl`	Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	J	`jnl`	Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
2023	J	`jnl`	Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
2023	J	`jnl`	Parameterized complexity of multi-node hubs. J. Comput. Syst. Sci. Saket Saurabh, Meirav Zehavi
2023	C	`conf`	Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
2023	J	`jnl`	Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2023	J	`jnl`	Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2022	J	`jnl`	(Re)packing Equal Disks into Rectangle. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2022	B	`conf`	A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2022	J	`jnl`	A Framework for Approximation Schemes on Disk Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	J	`jnl`	A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
2022	B	`conf`	An Exact Algorithm for Knot-Free Vertex Deletion. MFCS M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma
2022	J	`jnl`	Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2022	A*	`conf`	Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2022	A	`conf`	Detours in Directed Graphs. STACS Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	J	`jnl`	Detours in Directed Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	B	`conf`	Exact Exponential Algorithms for Clustering Problems. IPEC Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	Exact Exponential Algorithms for Clustering Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2022	J	`jnl`	Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2022	J	`jnl`	Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A*	`conf`	Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A	`conf`	Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
2022	B	`conf`	Gehrlein Stable Committee with Multi-modal Preferences. SAGT Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
2022	J	`jnl`	Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	B	`conf`	List Homomorphism: Beyond the Known Boundaries. LATIN Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma
2022	J	`jnl`	Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi
2022	J	`jnl`	On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. Sushmita Gupta, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica Saket Saurabh, Prafullkumar Tale
2022	J	`jnl`	On the complexity of singly connected vertex deletion. Theor. Comput. Sci. Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
2022	Misc	`conf`	Output Sensitive Fault Tolerant Maximum Matching. CSR Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh
2022	Misc	`conf`	Parameterized Algorithms for Finding Highly Connected Solution. CSR Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
2022	J	`jnl`	Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR Ajinkya Gaikwad, Soumen Maity, Saket Saurabh
2022	Misc	`conf`	Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Parameterized Complexity of Directed Spanner Problems. Algorithmica Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
2022	J	`jnl`	Parameterized Complexity of Graph Partitioning into Connected Clusters. CoRR Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
2022	J	`jnl`	Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2022	B	`conf`	Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
2022	Misc	`conf`	Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
2022	J	`jnl`	Parameterized and Exact Algorithms for Class Domination Coloring. CoRR R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2022	A*	`conf`	Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022	J	`jnl`	Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022	J	`jnl`	Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2022	A*	`conf`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2022	J	`jnl`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2022	A*	`conf`	Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	J	`jnl`	Theory research in India: 2019-2022. Commun. ACM C. Aiswarya, Vikraman Arvind, Saket Saurabh
2022	A*	`conf`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2021	J	`jnl`	2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	A*	`conf`	A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
2021	B	`conf`	A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
2021	B	`conf`	A Polynomial Kernel for Deletion to Ptolemaic Graphs. IPEC Akanksha Agrawal, Aditya Anand, Saket Saurabh
2021	—	`conf`	An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2021	J	`jnl`	An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2021	A	`conf`	An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	J	`jnl`	Approximate Counting of ACM Trans. Algorithms Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Approximation in (Poly-) Logarithmic Space. Algorithmica Arindam Biswas, Venkatesh Raman, Saket Saurabh
2021	J	`jnl`	Balanced stable marriage: How close is close enough? Theor. Comput. Sci. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2021	C	`conf`	Circumventing Connectivity for Kernelization. CIAC Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma
2021	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2021	A	`conf`	Diverse Collections in Matroids and Graphs. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	J	`jnl`	Diverse Collections in Matroids and Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	—	`conf`	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
2021	J	`jnl`	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
2021	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2021	A*	`conf`	Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). SODA Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Elimination Distance to Topological-minor-free Graphs is FPT. CoRR Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	A*	`conf`	Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
2021	A	`conf`	Exploiting Dense Structures in Parameterized Complexity. STACS William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2021	A*	`conf`	FPT-approximation for FPT Problems. SODA Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2021	B	`conf`	Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021	J	`jnl`	Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021	J	`jnl`	Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	B	`conf`	Odd Cycle Transversal in Mixed Graphs. WG Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
2021	J	`jnl`	On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2021	J	`jnl`	Packing Arc-Disjoint Cycles in Tournaments. Algorithmica Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
2021	J	`jnl`	Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2021	J	`jnl`	Parameterized complexity of fair feedback vertex set problem. Theor. Comput. Sci. Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
2021	J	`jnl`	Paths to trees and cacti. Theor. Comput. Sci. Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2021	J	`jnl`	Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
2021	J	`jnl`	Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Space-Efficient FPT Algorithms. CoRR Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh
2021	A*	`conf`	Strong Connectivity Augmentation is FPT. SODA Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
2021	J	`jnl`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2021	A	`conf`	k-Distinct Branchings Admits a Polynomial Kernel. ESA Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh
2021	J	`jnl`	α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale
2020	A*	`conf`	2-Approximating Feedback Vertex Set in Tournaments. SODA Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	A*	`conf`	A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	J	`jnl`	A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
2020	A*	`conf`	A Parameterized Approximation Scheme for Min $k$-Cut. FOCS Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2020	J	`jnl`	A Parameterized Approximation Scheme for Min k-Cut. CoRR Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2020	B	`conf`	A Polynomial Kernel for Paw-Free Editing. IPEC Eduard Eiben, William Lochet, Saket Saurabh
2020	J	`jnl`	A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	A characterization of König-Egerváry graphs with extendable vertex covers. Inf. Process. Lett. Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2020	A*	`conf`	An exponential time parameterized algorithm for planar disjoint paths. STOC Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	A*	`conf`	Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Approximation algorithms for geometric conflict free covering problems. Comput. Geom. Aritra Banik, Vibha Sahlot, Saket Saurabh
2020	B	`conf`	Approximation in (Poly-) Logarithmic Space. MFCS Arindam Biswas, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Approximation in (Poly-) Logarithmic Space. CoRR Arindam Biswas, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Bidimensionality and Kernels. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2020	A*	`conf`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	A*	`conf`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Treewidth, Kernels, and Algorithms Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. CoRR Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Faster Graph bipartization. J. Comput. Syst. Sci. Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2020	A	`conf`	Fault Tolerant Subgraphs with Applications in Kernelization. ITCS William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	Misc	`conf`	Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2020	J	`jnl`	Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory Comput. Syst. Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Fully dynamic arboricity maintenance. Theor. Comput. Sci. Niranka Banerjee, Venkatesh Raman, Saket Saurabh
2020	J	`jnl`	Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Going Far from Degeneracy. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Hitting topological minors is FPT. STOC Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Improved FPT Algorithms for Deletion to Forest-Like Structures. ISAAC Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
2020	J	`jnl`	Improved FPT Algorithms for Deletion to Forest-like Structures. CoRR Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
2020	Misc	`conf`	Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. CSR Abhishek Sahu, Saket Saurabh
2020	J	`jnl`	Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2020	—	`conf`	On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	On the (Parameterized) Complexity of Almost Stable Marriage. CoRR Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	On the Approximate Compressibility of Connected Vertex Cover. Algorithmica Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
2020	C	`conf`	On the Complexity of Singly Connected Vertex Deletion. IWOCA Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
2020	—	`conf`	On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	On the Parameterized Complexity Of Grid Contraction. CoRR Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
2020	J	`jnl`	On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2020	B	`conf`	On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2020	—	`conf`	On the Parameterized Complexity of Grid Contraction. SWAT Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
2020	B	`conf`	On the Parameterized Complexity of Maximum Degree Contraction Problem. IPEC Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem. CoRR Saket Saurabh, Prafullkumar Tale
2020	—	`conf`	Optimal Output Sensitive Fault Tolerant Cuts. FSTTCS Niranka Banerjee, Venkatesh Raman, Saket Saurabh
2020	A	`conf`	Parameterization Above a Multiplicative Guarantee. ITCS Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`ch.`	Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
2020	B	`conf`	Parameterized Complexity of Directed Spanner Problems. IPEC Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
2020	Misc	`conf`	Parameterized Complexity of Fair Feedback Vertex Set Problem. CSR Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
2020	—	`conf`	Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	J	`jnl`	Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2020	Misc	`conf`	Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	Path Contraction Faster than 2 SIAM J. Discret. Math. Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Popular Matching in Roommates Setting is NP-hard. Bull. EATCS Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Quadratic Vertex Kernel for Rainbow Matching. Algorithmica Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Quick Separation in Chordal and Split Graphs. MFCS Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma
2020	J	`jnl`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2020	J	`jnl`	Subexponential algorithm for J. Comput. Syst. Sci. Neeldhara Misra, Fahad Panolan, Saket Saurabh
2020	A*	`conf`	The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Well-Structured Committees. IJCAI Sushmita Gupta, Pallavi Jain, Saket Saurabh
2019	J	`jnl`	A Brief Note on Single Source Fault Tolerant Reachability. CoRR Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	A Polynomial Kernel for Paw-Free Editing. CoRR Eduard Eiben, William Lochet, Saket Saurabh
2019	Misc	`conf`	An Erdős-Pósa Theorem on Neighborhoods and Domination Number. COCOON Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh
2019	A*	`conf`	Approximate Counting of k-Paths: Deterministic and in Polynomial Space. ICALP Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2019	B	`conf`	Balanced Stable Marriage: How Close Is Close Enough? WADS Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Communication Complexity and Graph Families. ACM Trans. Comput. Theory Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2019	A*	`conf`	Connecting the Dots (with Minimum Crossings). SoCG Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Decomposition of Map Graphs with Applications. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Decomposition of Map Graphs with Applications. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Editing to Connected F-Degree Graph. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Exact Algorithms via Monotone Local Search. J. ACM Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2019	—	`conf`	Exact and Approximate Digraph Bandwidth. FSTTCS Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
2019	J	`jnl`	FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. CoRR Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh, Dolly Yadav
2019	J	`jnl`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2019	Misc	`conf`	Fully Dynamic Arboricity Maintenance. COCOON Niranka Banerjee, Venkatesh Raman, Saket Saurabh
2019	A	`conf`	Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	Going Far From Degeneracy. ESA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Going Far From Degeneracy. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Interval Vertex Deletion Admits a Polynomial Kernel. SODA Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2019	J	`jnl`	New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	On Succinct Encodings for the Tournament Fixing Problem. IJCAI Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi
2019	J	`jnl`	On the Approximate Compressibility of Connected Vertex Cover. CoRR Diptapriyo Majumdar, M. S. Ramanujan, Saket Saurabh
2019	Misc	`conf`	On the Complexity of Mixed Dominating Set. CSR Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh
2019	J	`jnl`	On the Parameterized Complexity of Contraction to Generalization of Trees. Theory Comput. Syst. Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2019	Misc	`conf`	On the Parameterized Complexity of Edge-Linked Paths. CSR Neeldhara Misra, Fahad Panolan, Saket Saurabh
2019	B	`conf`	Packing Arc-Disjoint Cycles in Tournaments. MFCS Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
2019	J	`jnl`	Packing Cycles Faster Than Erdos-Posa. SIAM J. Discret. Math. Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms for List K-Cycle. Algorithmica Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2019	B	`conf`	Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
2019	B	`conf`	Parameterized Complexity of Conflict-Free Matchings and Paths. MFCS Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
2019	B	`conf`	Parameterized Computational Geometry via Decomposition Theorems. WALCOM Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2019	—	`conf`	Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
2019	A*	`conf`	Path Contraction Faster Than 2 ICALP Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019	A*	`conf`	Popular Matching in Roommates Setting is NP-hard. SODA Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Slightly Superexponential Parameterized Problems. CoRR Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2019	C	`conf`	Solving Group Interval Scheduling Efficiently. IWOCA Arindam Biswas, Venkatesh Raman, Saket Saurabh
2019	J	`jnl`	Spanning Circuits in Regular Matroids. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2019	J	`jnl`	Split Contraction: The Untold Story. ACM Trans. Comput. Theory Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Stability in barter exchange markets. Auton. Agents Multi Agent Syst. Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2019	C	`conf`	Subset Feedback Vertex Set in Chordal and Split Graphs. CIAC Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
2019	J	`jnl`	Subset Feedback Vertex Set in Chordal and Split Graphs. Algorithmica Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
2019	J	`jnl`	Subset Feedback Vertex Set in Chordal and Split Graphs. CoRR Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
2019	J	`jnl`	The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. Algorithmica R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	The parameterized complexity landscape of finding 2-partitions of digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel. Algorithmica Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh
2018	B	`conf`	A Polynomial Sized Kernel for Tracking Paths Problem. LATIN Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2018	B	`conf`	A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. IPEC Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh
2018	—	`conf`	A parameterized runtime analysis of randomized local search and evolutionary algorithm for max GECCO (Companion) Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
2018	A*	`conf`	Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos
2018	J	`jnl`	Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2018	J	`jnl`	Below All Subsets for Minimal Connected Dominating Set. SIAM J. Discret. Math. Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh
2018	J	`jnl`	Bivariate complexity analysis of Almost Forest Deletion. Theor. Comput. Sci. Ashutosh Rai, Saket Saurabh
2018	A*	`conf`	Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2018	B	`conf`	Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
2018	A*	`conf`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2018	J	`jnl`	Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2018	J	`jnl`	Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang
2018	A	`conf`	Erdös-Pósa Property of Obstructions to Interval Graphs. STACS Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discret. Math. Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh
2018	J	`jnl`	Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2018	B	`conf`	Exploring the Kernelization Borders for Hitting Cycles. IPEC Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
2018	J	`jnl`	Finding even subgraphs even faster. J. Comput. Syst. Sci. Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2018	J	`jnl`	Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna
2018	J	`jnl`	Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. SIAM J. Discret. Math. Geevarghese Philip, Ashutosh Rai, Saket Saurabh
2018	Misc	`conf`	Hitting and Covering Partially. COCOON Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh
2018	J	`jnl`	Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2018	J	`jnl`	Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2018	J	`jnl`	Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2018	J	`jnl`	Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ACM Trans. Algorithms Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2018	J	`jnl`	Long directed ( Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2018	Misc	`conf`	Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. CSR Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2018	A	`conf`	On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	J	`jnl`	On the kernelization complexity of string problems. Theor. Comput. Sci. Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2018	J	`jnl`	Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	B	`conf`	Parameterized Complexity of Multi-Node Hubs. IPEC Saket Saurabh, Meirav Zehavi
2018	B	`conf`	Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2018	J	`jnl`	Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2018	J	`jnl`	Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	—	`conf`	Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. Theory Comput. Syst. Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
2018	J	`jnl`	Popular Matching in Roommates Setting is NP-hard. CoRR Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica Fedor V. Fomin, Saket Saurabh
2018	A	`conf`	Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Randomized contractions meet lean decompositions. CoRR Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh
2018	J	`jnl`	Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Algorithmica Syed Mohammad Meesum, Saket Saurabh
2018	J	`jnl`	Reconfiguration on sparse graphs. J. Comput. Syst. Sci. Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	A*	`conf`	Reducing CMSO Model Checking to Highly Connected Graphs. ICALP Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Reducing CMSO Model Checking to Highly Connected Graphs. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Simultaneous Feedback Vertex Set: A Parameterized Perspective. ACM Trans. Comput. Theory Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2018	J	`jnl`	Slightly Superexponential Parameterized Problems. SIAM J. Comput. Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2018	A	`conf`	Stability in Barter Exchange Markets. AAMAS Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	—	`conf`	Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	A*	`conf`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2018	B	`conf`	The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. LATIN R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments. CoRR R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. SODA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2018	A*	`conf`	When Rigging a Tournament, Let Greediness Blind You. IJCAI Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	Winning a Tournament by Any Means Necessary. IJCAI Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	A	`conf`	A Linear-Time Parameterized Algorithm for Node Unique Label Cover. ESA Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos
2017	—	`conf`	Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	J	`jnl`	Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	J	`jnl`	Balanced Stable Marriage: How Close is Close Enough? CoRR Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Communication Complexity of Pairs of Graph Families with Applications. MFCS Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2017	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	A*	`conf`	Covering Vectors by Spaces: Regular Matroids. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	J	`jnl`	Covering vectors by spaces: Regular matroids. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	A*	`conf`	Exact Algorithms for Terrain Guarding. SoCG Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2017	J	`jnl`	Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	A*	`conf`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	A*	`conf`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. SIAM J. Comput. Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2017	A*	`conf`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2017	B	`conf`	Group Activity Selection on Graphs: Parameterized Analysis. SAGT Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory B Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2017	Misc	`conf`	Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. ACM Trans. Algorithms M. S. Ramanujan, Saket Saurabh
2017	A*	`conf`	Lossy kernelization. STOC Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	A	`conf`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2017	J	`jnl`	On Treewidth and Stable Marriage. CoRR Sushmita Gupta, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	On approximability of optimization problems related to Red/Blue-split graphs. Theor. Comput. Sci. Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh
2017	J	`jnl`	On finding highly connected spanning subgraphs. CoRR Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	B	`conf`	On the Parameterized Complexity of Contraction to Generalization of Trees. IPEC Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2017	J	`jnl`	On the Parameterized Complexity of Contraction to Generalization of Trees. CoRR Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2017	J	`jnl`	On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. Fahad Panolan, Geevarghese Philip, Saket Saurabh
2017	A*	`conf`	Packing Cycles Faster Than Erdos-Posa. ICALP Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Packing Cycles Faster Than Erdős-Pósa. CoRR Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Parameterized Algorithms and Kernels for Rainbow Matching. MFCS Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2017	B	`conf`	Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2017	J	`jnl`	Parameterized Complexity of Superstring Problems. Algorithmica Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2017	B	`conf`	Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2017	J	`jnl`	Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
2017	C	`conf`	Paths to Trees and Cacti. CIAC Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2017	J	`jnl`	Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Quick but Odd Growth of Cacti. Algorithmica Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2017	J	`jnl`	Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Representative Families of Product Families. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2017	A*	`conf`	Spanning Circuits in Regular Matroids. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	A	`conf`	Split Contraction: The Untold Story. STACS Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	The Half-integral Erdös-Pósa Property for Non-null Cycles. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	(Meta) Kernelization. J. ACM Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2016	B	`conf`	(k, n-k)-Max-Cut: An 𝒪 LATIN Saket Saurabh, Meirav Zehavi
2016	—	`ed.`	36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Chennai, India, December 13-15, 2016 FSTTCS Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen
2016	B	`conf`	A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	A Linear Time Parameterized Algorithm for Node Unique Label Cover. CoRR Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2016	B	`conf`	A Parameterized Algorithm for Mixed-Cut. LATIN Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. Algorithmica Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh
2016	J	`jnl`	Backdoors to q-Horn. Algorithmica Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2016	J	`jnl`	Below all subsets for Minimal Connected Dominating Set. CoRR Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Bidimensionality and Kernels. CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2016	A	`conf`	Editing to Connected f-Degree Graph. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2016	J	`jnl`	Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A*	`conf`	Exact algorithms via monotone local search. STOC Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2016	B	`conf`	Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma
2016	A	`conf`	Kernelization and Sparseness: the Case of Dominating Set. STACS Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar
2016	A*	`conf`	Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2016	—	`conf`	Kernelizing Buttons and Scissors. CCCG Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma
2016	B	`conf`	Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2016	J	`jnl`	Lossy Kernelization. CoRR Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	—	`conf`	Lower Bounds for Approximation Schemes for Closest String. SWAT Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	—	`ch.`	Matroids in Parameterized Complexity and Exact Algorithms. Encyclopedia of Algorithms Fahad Panolan, Saket Saurabh
2016	J	`jnl`	On Problems as Hard as CNF-SAT. ACM Trans. Algorithms Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2016	J	`jnl`	Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. Algorithmica Jørgen Bang-Jensen, Saket Saurabh, Sven Simonsen
2016	B	`conf`	Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2016	B	`conf`	Parameterized Complexity of Red Blue Set Cover for Lines. LATIN Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2016	J	`jnl`	Partially Polynomial Kernels for Set Cover and Test Cover. SIAM J. Discret. Math. Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
2016	B	`conf`	Rank Reduction of Directed Graphs by Vertex and Edge Deletions. LATIN Syed Mohammad Meesum, Saket Saurabh
2016	J	`jnl`	Reducing rank of the adjacency matrix by graph modification. Theor. Comput. Sci. Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
2016	B	`conf`	Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016	J	`jnl`	Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016	A	`conf`	Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2016	J	`jnl`	Spanning Circuits in Regular Matroids. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2016	A*	`conf`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A*	`conf`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. CoRR Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	Tree Deletion Set Has a Polynomial Kernel but No OPT SIAM J. Discret. Math. Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2015	J	`jnl`	A Parameterized Algorithm for Mixed Cut. CoRR Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2015	B	`conf`	B-Chromatic Number: Beyond NP-Hardness. IPEC Fahad Panolan, Geevarghese Philip, Saket Saurabh
2015	Misc	`conf`	Bivariate Complexity Analysis of Almost Forest Deletion. COCOON Ashutosh Rai, Saket Saurabh
2015	—	`conf`	Deterministic Truncation of Linear Matroids. ICALP (1) Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2015	J	`jnl`	Exact Algorithms via Monotone Local Search. CoRR Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2015	A*	`conf`	FO Model Checking on Posets of Bounded Width. FOCS Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	FO Model Checking on Posets of Bounded Width. CoRR Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015	—	`conf`	Finding Even Subgraphs Even Faster. FSTTCS Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2015	J	`jnl`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2015	—	`conf`	Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. MFCS (2) Geevarghese Philip, Ashutosh Rai, Saket Saurabh
2015	Misc	`conf`	Graph Modification Problems: A Modern Perspective. FAW Fedor V. Fomin, Saket Saurabh, Neeldhara Misra
2015	B	`conf`	Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. IPEC Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
2015	—	`conf`	Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. ICALP (1) Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Lower bounds for approximation schemes for Closest String. CoRR Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	J	`jnl`	Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}. CoRR Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2015	B	`conf`	On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. WADS Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
2015	—	`book`	Parameterized Algorithms Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2015	J	`jnl`	Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2015	B	`conf`	Parameterized Complexity of Superstring Problems. CPM Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2015	J	`jnl`	Parameterized Complexity of Superstring Problems. CoRR Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2015	—	`conf`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	Quick but Odd Growth of Cacti. IPEC Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	Reconfiguration on Sparse Graphs. WADS Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Reconfiguration on sparse graphs. CoRR Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	Misc	`conf`	Reducing Rank of the Adjacency Matrix by Graph Modification. COCOON Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
2015	J	`jnl`	Simultaneous Feedback Vertex Set: A Parameterized Perspective. CoRR Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2015	A*	`conf`	Solving SODA Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
2015	Misc	`conf`	Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh
2015	—	`conf`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2015	Misc	`conf`	Unique Covering Problems with Geometric Sets. COCOON Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2014	A*	`conf`	A Near-Optimal Planarization Algorithm. SODA Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theor. Comput. Sci. Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
2014	J	`jnl`	Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2014	—	`conf`	Connecting Vertices by Independent Trees. FSTTCS Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh
2014	J	`jnl`	Deterministic Truncation of Linear Matroids. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2014	A*	`conf`	Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2014	J	`jnl`	Finding Even Subgraphs Even Faster. CoRR Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2014	J	`jnl`	Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2014	A*	`conf`	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. FOCS Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. CoRR Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2014	J	`jnl`	Kernelization Lower Bounds Through Colors and IDs. ACM Trans. Algorithms Michael Dom, Daniel Lokshtanov, Saket Saurabh
2014	—	`ch.`	Kernelization Methods for Fixed-Parameter Tractability. Tractability Fedor V. Fomin, Saket Saurabh
2014	J	`jnl`	Kernelization and Sparseness: the case of Dominating Set. CoRR Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar
2014	A*	`conf`	Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts. SODA M. S. Ramanujan, Saket Saurabh
2014	A*	`conf`	Minimum bisection is fixed parameter tractable. STOC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	On Cutwidth Parameterized by Vertex Cover. Algorithmica Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	J	`jnl`	On the Hardness of Losing Width. Theory Comput. Syst. Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2014	Misc	`conf`	On the Kernelization Complexity of String Problems. COCOON Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2014	—	`conf`	Parameterized Algorithms to Preserve Connectivity. ICALP (1) Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2014	—	`conf`	Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2014	A	`conf`	Representative Sets of Product Families. ESA Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Representative Sets of Product Families. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	A	`conf`	Solving Multicut Faster Than 2 n. ESA Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2014	J	`jnl`	The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2014	—	`conf`	Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2013	J	`jnl`	A Polynomial Kernel for Proper Interval Vertex Deletion. SIAM J. Discret. Math. Fedor V. Fomin, Saket Saurabh, Yngve Villanger
2013	J	`jnl`	A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2013	B	`conf`	An FPT Algorithm for Tree Deletion Set. WALCOM Venkatesh Raman, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl. Venkatesh Raman, Saket Saurabh, Ondrej Suchý
2013	A	`conf`	Backdoors to q-Horn. STACS Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2013	J	`jnl`	Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Computing Optimal Steiner Trees in Polynomial Space. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh
2013	J	`jnl`	Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2013	J	`jnl`	Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2013	B	`conf`	Faster Exact Algorithms for Some Terminal Set Problems. IPEC Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2013	J	`jnl`	Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Inf. Comput. Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. Algorithmica Venkatesh Raman, Saket Saurabh
2013	B	`conf`	Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
2013	J	`jnl`	Imbalance is fixed parameter tractable. Inf. Process. Lett. Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2013	J	`jnl`	Irrelevant Vertices for the Planar Disjoint Paths Problem. CoRR Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	J	`jnl`	Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts CoRR M. S. Ramanujan, Saket Saurabh
2013	A	`conf`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013	J	`jnl`	Minimum Bisection is fixed parameter tractable. CoRR Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2013	B	`conf`	On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2013	B	`conf`	Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2013	A	`conf`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2013	J	`jnl`	Parameterized complexity of MaxSat Above Average. Theor. Comput. Sci. Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2013	—	`conf`	Partially Polynomial Kernels for Set Cover and Test Cover. FSTTCS Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
2013	—	`conf`	Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
2013	J	`jnl`	Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
2013	J	`jnl`	Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2013	B	`conf`	Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? MFCS Neeldhara Misra, Fahad Panolan, Saket Saurabh
2013	J	`jnl`	The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2013	J	`jnl`	Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2012	A	`conf`	A Polynomial Kernel for Proper Interval Vertex Deletion. ESA Fedor V. Fomin, Saket Saurabh, Yngve Villanger
2012	J	`jnl`	A Polynomial kernel for Proper Interval Vertex Deletion CoRR Fedor V. Fomin, Saket Saurabh, Yngve Villanger
2012	—	`conf`	Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2012	J	`jnl`	Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound CoRR Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2012	A*	`conf`	Bidimensionality and geometric graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2012	J	`jnl`	Counting Subgraphs via Homomorphisms. SIAM J. Discret. Math. Omid Amini, Fedor V. Fomin, Saket Saurabh
2012	J	`jnl`	Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). Dagstuhl Reports Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh
2012	A*	`conf`	Don't Be Strict in Local Search! AAAI Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012	J	`jnl`	Don't Be Strict in Local Search! CoRR Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012	J	`jnl`	FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2012	J	`jnl`	Faster Parameterized Algorithms using Linear Programming CoRR Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao
2012	A	`conf`	Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Fixed-parameter tractability of satisfying beyond the number of variables CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. Algorithmica Venkatesh Raman, Saket Saurabh
2012	J	`jnl`	Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2012	—	`conf`	Kernelization - Preprocessing with a Guarantee. The Multivariate Algorithmic Revolution and Beyond Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	A	`conf`	LP can be a cure for Parameterized Problems. STACS N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	A*	`conf`	Linear kernels for (connected) dominating set on SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Local search: Is brute-force avoidable? J. Comput. Syst. Sci. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
2012	J	`jnl`	Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. SIAM J. Discret. Math. Sushmita Gupta, Venkatesh Raman, Saket Saurabh
2012	B	`conf`	New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh
2012	J	`jnl`	On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2012	A	`conf`	On Problems as Hard as CNF-SAT. CCC Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2012	J	`jnl`	On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2012	B	`conf`	Parameterized Algorithms for Even Cycle Transversal. WG Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	J	`jnl`	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs CoRR Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
2012	B	`conf`	Parameterized Complexity of MaxSat above Average. LATIN Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2012	J	`jnl`	Parameterized Study of the Test Cover Problem CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
2012	B	`conf`	Parameterized Study of the Test Cover Problem. MFCS Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms Omid Amini, Ignasi Sau, Saket Saurabh
2012	J	`jnl`	Planar F-Deletion: Approximation and Optimal FPT Algorithms CoRR Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	A*	`conf`	Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	J	`jnl`	Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh
2012	—	`conf`	Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. FSTTCS Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström
2011	B	`conf`	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011	J	`jnl`	A linear kernel for planar connected dominating set. Theor. Comput. Sci. Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2011	C	`conf`	Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2011	J	`jnl`	An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2011	B	`conf`	Approximation Algorithms for Minimum Chain Vertex Deletion. WALCOM Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
2011	J	`jnl`	Bandwidth on AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2011	A*	`conf`	Bidimensionality and EPTAS. SODA Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Bidimensionality and Geometric Graphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2011	J	`jnl`	Hitting and Harvesting Pumpkins CoRR Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	A	`conf`	Hitting and Harvesting Pumpkins. ESA Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	A	`conf`	Hitting forbidden minors: Approximation and Kernelization. STACS Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2011	J	`jnl`	Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. Omid Amini, Fedor V. Fomin, Saket Saurabh
2011	J	`jnl`	Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2011	A*	`conf`	Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. SODA Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Lower bounds based on the Exponential Time Hypothesis. Bull. EATCS Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Lower bounds on kernelization. Discret. Optim. Neeldhara Misra, Venkatesh Raman, Saket Saurabh
2011	B	`conf`	On Cutwidth Parameterized by Vertex Cover. IPEC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2011	Misc	`conf`	On Parameterized Independent Feedback Vertex Set. COCOON Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	On Problems as Hard as CNFSAT CoRR Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2011	B	`conf`	On the Hardness of Losing Width. IPEC Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2011	J	`jnl`	On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011	J	`jnl`	On the directed Full Degree Spanning Tree problem. Discret. Optim. Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2011	J	`jnl`	Parameterized Complexity of MaxSat Above Average CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh
2011	A	`conf`	Paths, Flowers and Vertex Cover. ESA Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011	B	`conf`	Planar k-Path in Subexponential Time and Polynomial Space. WG Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2011	A*	`conf`	Slightly Superexponential Parameterized Problems. SODA Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2011	J	`jnl`	Strengthening Erdös-Pósa property for minor-closed graph classes. J. Graph Theory Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos
2011	J	`jnl`	Subexponential algorithms for partial cover problems. Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. Algorithmica Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2011	—	`conf`	Tight Bounds for Linkages in Planar Graphs. ICALP (1) Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	J	`jnl`	Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2010	A*	`conf`	Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	J	`jnl`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs CoRR Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A	`conf`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Bidimensionality and EPTAS CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A*	`conf`	Bidimensionality and Kernels. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	—	`conf`	Determining the Winner of a Dodgson Election is Hard. FSTTCS Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh
2010	B	`conf`	FPT Algorithms for Connected Feedback Vertex Set. WALCOM Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2010	A*	`conf`	Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	—	`conf`	Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. SWAT Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Hitting forbidden minors: Approximation and Kernelization CoRR Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2010	Misc	`conf`	Imbalance Is Fixed Parameter Tractable. COCOON Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2010	J	`jnl`	Intractability of Clique-Width Parameterizations. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	J	`jnl`	Iterative compression and exact algorithms. Theor. Comput. Sci. Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010	J	`jnl`	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal CoRR Daniel Lokshtanov, Dániel Marx, Saket Saurabh
2010	—	`conf`	Parameterized Algorithms for Boxicity. ISAAC (1) Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh
2010	J	`jnl`	Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh
2010	B	`ed.`	Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings IPEC Venkatesh Raman, Saket Saurabh
2010	C	`conf`	Ranking and Drawing in Subexponential Time. IWOCA Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
2010	B	`conf`	Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh
2010	Misc	`conf`	The Curse of Connectivity: COCOON Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
2010	—	`conf`	The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
2009	J	`jnl`	(Meta) Kernelization CoRR Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	A*	`conf`	(Meta) Kernelization. FOCS Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	J	`jnl`	A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	B	`conf`	A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	Misc	`conf`	Algorithm for Finding COCOON Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	B	`conf`	An Exact Algorithm for Minimum Distortion Embedding. WG Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2009	B	`conf`	Bandwidth on AT-Free Graphs. ISAAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2009	A*	`conf`	Clique-width: on the price of generality. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2009	—	`conf`	Counting Subgraphs via Homomorphisms. ICALP (1) Omid Amini, Fedor V. Fomin, Saket Saurabh
2009	—	`conf`	Distortion Is Fixed Parameter Tractable. ICALP (1) Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2009	—	`conf`	Even Faster Algorithm for Set Splitting! IWPEC Daniel Lokshtanov, Saket Saurabh
2009	J	`jnl`	FPT Algorithms for Connected Feedback Vertex Set CoRR Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009	—	`conf`	Fast FAST. ICALP (1) Noga Alon, Daniel Lokshtanov, Saket Saurabh
2009	J	`jnl`	Faster Algorithms for Finding and Counting Subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh
2009	—	`conf`	Incompressibility through Colors and IDs. ICALP (1) Michael Dom, Daniel Lokshtanov, Saket Saurabh
2009	A	`conf`	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2009	J	`jnl`	Kernels for Feedback Arc Set In Tournaments CoRR Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	—	`conf`	Kernels for Feedback Arc Set In Tournaments. FSTTCS Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	C	`conf`	Linear Kernel for Planar Connected Dominating Set. TAMC Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2009	A*	`conf`	Local Search: Is Brute-Force Avoidable? IJCAI Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2009	J	`jnl`	On Two Techniques of Combining Branching and Treewidth. Algorithmica Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
2009	—	`conf`	On the Directed Degree-Preserving Spanning Tree Problem. IWPEC Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009	C	`conf`	Simpler Parameterized Algorithm for OCT. IWOCA Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar
2009	J	`jnl`	Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2009	—	`conf`	Subexponential Algorithms for Partial Cover Problems. FSTTCS Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2009	Misc	`conf`	The Budgeted Unique Coverage Problem and Color-Coding. CSR Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009	J	`jnl`	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
2008	C	`conf`	A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
2008	—	`conf`	Capacitated Domination and Covering: A Parameterized Perspective. IWPEC Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2008	B	`conf`	Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2008	B	`conf`	Graph Layout Problems Parameterized by Vertex Cover. ISAAC Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
2008	—	`conf`	Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS Omid Amini, Fedor V. Fomin, Saket Saurabh
2008	C	`conf`	Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos
2008	B	`conf`	Iterative Compression and Exact Algorithms. MFCS Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2008	J	`jnl`	Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2008	B	`conf`	König Deletion Sets and Vertex Covers above the Matching Size. ISAAC Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2008	C	`conf`	Parameterized Algorithms for Generalized Domination. COCOA Venkatesh Raman, Saket Saurabh, Sriganesh Srihari
2008	J	`jnl`	Parameterized Algorithms for Partial Cover Problems CoRR Omid Amini, Fedor V. Fomin, Saket Saurabh
2008	—	`conf`	Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC Omid Amini, Ignasi Sau, Saket Saurabh
2008	J	`jnl`	Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2008	J	`jnl`	Short Cycles Make Algorithmica Venkatesh Raman, Saket Saurabh
2008	J	`jnl`	Spanning directed trees with many leaves CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	J	`jnl`	Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	—	`conf`	Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	J	`jnl`	Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2007	Misc	`conf`	Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2007	J	`jnl`	Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Inf. Process. Lett. Venkatesh Raman, Saket Saurabh
2007	C	`conf`	On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2007	J	`jnl`	Parameterized Algorithms for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	A*	`conf`	Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	B	`conf`	The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. ISAAC Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2006	B	`conf`	Branching and Treewidth Based Exact Algorithms. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2006	—	`conf`	Fast Exponential Algorithms for Maximum FSTTCS Sushmita Gupta, Venkatesh Raman, Saket Saurabh
2006	J	`jnl`	Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2006	J	`jnl`	Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. Venkatesh Raman, Saket Saurabh
2006	—	`conf`	Triangles, 4-Cycles and Parameterized (In-)Tractability. SWAT Venkatesh Raman, Saket Saurabh
2005	J	`jnl`	Faster algorithms for feedback vertex set. Electron. Notes Discret. Math. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
2005	—	`conf`	Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2004	—	`conf`	Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. IWPEC Venkatesh Raman, Saket Saurabh
2003	B	`conf`	Parameterized Complexity of Directed Feedback Set Problems in Tournaments. WADS Venkatesh Raman, Saket Saurabh
2002	B	`conf`	Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC Venkatesh Raman, Saket Saurabh, C. R. Subramanian