Browse by Fellow

Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket (2020) Approximation Schemes for Low-Rank Binary Matrix Approximation Problems ACM Transactions on Algorithms, 16 (1). pp. 1-39. ISSN 1549-6325

Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav (2020) Quadratic Vertex Kernel for Rainbow Matching Algorithmica, 82 (4). pp. 881-897. ISSN 0178-4617

Fomin, Fedor V. ; Lokshtanov, Daniel ; Kolay, Sudeshna ; Panolan, Fahad ; Saurabh, Saket (2020) Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems ACM Transactions on Algorithms, 16 (2). pp. 1-37. ISSN 1549-6325

Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav (2019) Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring ACM Transactions on Algorithms, 15 (1). pp. 1-27. ISSN 1549-6325

Fomin, Fedor V. ; Golovach, Petr ; Panolan, Fahad ; Saurabh, Saket (2019) Editing to Connected F-Degree Graph SIAM Journal on Discrete Mathematics, 33 (2). pp. 795-836. ISSN 0895-4801

Fomin, Fedor V. ; Gaspers, Serge ; Lokshtanov, Daniel ; Saurabh, Saket (2019) Exact Algorithms via Monotone Local Search Journal of the ACM, 66 (2). pp. 1-23. ISSN 0004-5411

Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav (2019) Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Discrete & Computational Geometry, 62 (4). pp. 879-911. ISSN 0179-5376

Agarwal, Akanksha ; Saurabh, Saket ; Tale, Prafullkumar (2019) On the Parameterized Complexity of Contraction to Generalization of Trees Theory of Computing Systems, 63 (3). pp. 587-614. ISSN 1432-4350

Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav (2019) Parameterized Algorithms and Kernels for Rainbow Matching Algorithmica, 81 (4). pp. 1684-1698. ISSN 0178-4617

Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav (2019) Parameterized Algorithms for List K-Cycle Algorithmica, 81 (3). pp. 1267-1287. ISSN 0178-4617

Misra, Neeldhara ; Panolan, Fahad ; Rai, Ashutosh ; Raman, Venkatesh ; Saurabh, Saket (2019) Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs Algorithmica, 81 (1). pp. 26-46. ISSN 0178-4617

Meesum, Syed M. ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav (2019) Rank Vertex Cover as a Natural Problem for Algebraic Compression SIAM Journal on Discrete Mathematics, 33 (3). pp. 1277-1296. ISSN 0895-4801

Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket (2019) Spanning Circuits in Regular Matroids ACM Transactions on Algorithms, 15 (4). pp. 1-38. ISSN 1549-6325

Fomin, Fedor V. ; Le, Tien-Nam ; Lokshtanov, Daniel ; Saurabh, Saket ; Thomassé, Stéphan ; Zehavi, Meirav (2019) Subquadratic Kernels for Implicit 3-H itting S et and 3-S et P acking Problems ACM Transactions on Algorithms, 15 (1). pp. 1-44. ISSN 1549-6325

Bang-Jensen, J. ; Knudsen, Kristine V.K. ; Saurabh, Saket ; Zehavi, Meirav (2019) The parameterized complexity landscape of finding 2-partitions of digraphs Theoretical Computer Science, 795 . pp. 108-114. ISSN 0304-3975

Lokshtanov, Daniel ; Pilipczuk, Michał ; Saurabh, Saket (2018) Below All Subsets for Minimal Connected Dominating Set SIAM Journal on Discrete Mathematics, 32 (3). pp. 2332-2345. ISSN 0895-4801

Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket (2018) Covering Vectors by Spaces: Regular Matroids SIAM Journal on Discrete Mathematics, 32 (4). pp. 2512-2565. ISSN 0895-4801

Lokshtanov, Daniel ; Misra, Pranabendu ; Panolan, Fahad ; Saurabh, Saket (2018) Deterministic Truncation of Linear Matroids ACM Transactions on Algorithms, 14 (2). pp. 1-20. ISSN 1549-6325

Ashok, Pradeesha ; Fomin, Fedor V. ; Kolay, Sudeshna ; Saurabh, Saket ; Zehavi, Meirav (2018) Exact Algorithms for Terrain Guarding ACM Transactions on Algorithms, 14 (2). pp. 1-20. ISSN 1549-6325

Ashok, Pradeesha ; Dudeja, Aditi ; Kolay, Sudeshna ; Saurabh, Saket (2018) Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs SIAM Journal on Discrete Mathematics, 32 (2). pp. 1189-1208. ISSN 0895-4801

Fomin, Fedorr V. ; Lokshtanov, Daniel ; Saurabh, Saket (2018) Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes Journal of the ACM, 65 (2). pp. 1-44. ISSN 0004-5411

Goyal, Prachi ; Misra, Pranabendu ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, Saket (2018) Finding even subgraphs even faster Journal of Computer and System Sciences, 97 . pp. 1-13. ISSN 0022-0000

Philip, Geevarghese ; Rai, Ashutosh ; Saurabh, Saket (2018) Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel SIAM Journal on Discrete Mathematics, 32 (2). pp. 882-901. ISSN 0895-4801

Agrawal, Akanksha ; Lokshtanov, Daniel ; Majumdar, Diptapriyo ; Mouawad, Amer E. ; Saurabh, Saket (2018) Kernelization of Cycle Packing with Relaxed Disjointness Constraints SIAM Journal on Discrete Mathematics, 32 (3). pp. 1619-1643. ISSN 0895-4801

Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios M. (2018) Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors ACM Transactions on Algorithms, 14 (1). pp. 1-31. ISSN 1549-6325

Agrawal, Akanksha ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav (2018) Kernels for deletion to classes of acyclic digraphs Journal of Computer and System Sciences, 92 . pp. 9-21. ISSN 0022-0000

Lokshtanov, Daniel ; Marx, Dániel ; Saurabh, Saket (2018) Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal ACM Transactions on Algorithms, 14 (2). pp. 1-30. ISSN 1549-6325

Lokshtanov, Daniel ; Ramanujan, M. S. ; Saurabh, Saket (2018) Linear Time Parameterized Algorithms for Subset Feedback Vertex Set ACM Transactions on Algorithms, 14 (1). pp. 1-37. ISSN 1549-6325

Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav (2018) Long directed (s,t)-path: FPT algorithm Information Processing Letters, 140 . pp. 8-12. ISSN 0020-0190

Basavaraju, Manu ; Panolan, Fahad ; Rai, Ashutosh ; Ramanujan, M.S. ; Saurabh, Saket (2018) On the kernelization complexity of string problems Theoretical Computer Science, 730 . pp. 21-31. ISSN 0304-3975

Adil, Deeksha ; Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav (2018) Parameterized algorithms for stable matching with ties and incomplete lists Theoretical Computer Science, 723 . pp. 1-10. ISSN 0304-3975

Majumdar, Diptapriyo ; Raman, Venkatesh ; Saurabh, Saket (2018) Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators Theory of Computing Systems, 62 (8). pp. 1910-1951. ISSN 1432-4350

Lokshtanov, Daniel ; Mouawad, Amer E. ; Panolan, Fahad ; Ramanujan, M.S. ; Saurabh, Saket (2018) Reconfiguration on sparse graphs Journal of Computer and System Sciences, 95 . pp. 122-131. ISSN 0022-0000

Agrawal, Akanksha ; Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket (2018) Simultaneous Feedback Vertex Set: A Parameterized Perspective ACM Transactions on Computation Theory, 10 (4). pp. 1-25. ISSN 1942-3454

Gupta, Sushmita ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav (2018) Stability in Barter Exchange Markets In: AAMAS 2018, July 10-15, 2018, Stockholm, Sweden.

Saurabh, Saket ; Zehavi, Meirav (2018) (k,n-k) - Max-Cut: An O^∗(2^p)-Time Algorithm and a Polynomial Kernel Algorithmica, 80 (12). pp. 3844-3860. ISSN 0178-4617

Lokshtanov, Daniel ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav (2017) Balanced Judicious Partition is Fixed-Parameter Tractable SIAM Journal on Discrete Mathematics, 33 (4). pp. 1878-1911. ISSN 0895-4801

Kolay, Sudeshna ; Panolan, Fahad ; Saurabh, Saket (2017) Communication Complexity of Pairs of Graph Families with Applications In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017).

Chitnis, Rajesh ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Misra, Pranabendu ; Ramanujan, M.S. ; Saurabh, Saket (2017) Faster exact algorithms for some terminal set problems Journal of Computer and System Sciences, 88 . pp. 195-207. ISSN 0022-0000

Agrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket ; Zehavi, Meirav (2017) Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion In: Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 16-19, 2017, Rhode Island, USA.

Lokshtanov, Daniel ; Misra, Pranabendu ; Ramanujan, M. S. ; Saurabh, Saket (2017) Hitting Selected (Odd) Cycles SIAM Journal on Discrete Mathematics, 31 (3). pp. 1581-1615. ISSN 0895-4801

Adler, Isolde ; Kolliopoulos, Stavros G. ; Krause, Philipp Klaus ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios M. (2017) Irrelevant vertices for the planar Disjoint Paths Problem Journal of Combinatorial Theory, Series B, 122 . pp. 815-843. ISSN 0095-8956

Ramanujan, M. S. ; Saurabh, Saket (2017) Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts ACM Transactions on Algorithms, 13 (4). pp. 1-25. ISSN 1549-6325

Ashok, Pradeesha ; Kolay, Sudeshna ; Saurabh, Saket (2017) Multivariate Complexity Analysis of Geometric Red Blue Set Cover Algorithmica, 79 (3). pp. 667-697. ISSN 0178-4617

Mishra, Sounaka ; Rajakrishnan, Shijin ; Saurabh, Saket (2017) On approximability of optimization problems related to Red/Blue-split graphs Theoretical Computer Science, 690 . pp. 104-113. ISSN 0304-3975

Panolan, Fahad ; Philip, Geevarghese ; Saurabh, Saket (2017) On the parameterized complexity of b-chromatic number Journal of Computer and System Sciences, 84 . pp. 120-131. ISSN 0022-0000

Bliznets, Ivan ; Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S. ; Saurabh, Saket (2017) Parameterized Complexity of Superstring Problems Algorithmica, 79 (3). pp. 798-813. ISSN 0178-4617

Ashok, Pradeesha ; Kolay, Sudeshna ; Meesum, S.M. ; Saurabh, Saket (2017) Parameterized complexity of Strip Packing and Minimum Volume Packing Theoretical Computer Science, 661 . pp. 56-64. ISSN 0304-3975

Kolay, Sudeshna ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket (2017) Quick but Odd Growth of Cacti Algorithmica, 79 (1). pp. 271-290. ISSN 0178-4617

Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket (2017) Representative Families of Product Families ACM Transactions on Algorithms, 13 (3). pp. 1-29. ISSN 1549-6325

Agrawal, Akanksha ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav (2017) Split Contraction: The Untold Story In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Dagstuhl, Germany.

Giannopoulou, Archontia C. ; Jansen, Bart M. P. ; Lokshtanov, Daniel ; Saurabh, Saket (2017) Uniform Kernelization Complexity of Hitting Forbidden Minors ACM Transactions on Algorithms, 13 (3). pp. 1-35. ISSN 1549-6325

Bang-Jensen, Jørgen ; Maddaloni, Alessandro ; Saurabh, Saket (2016) Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments Algorithmica, 76 (2). pp. 320-343. ISSN 0178-4617

Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket (2016) Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms Journal of the ACM, 63 (4). pp. 1-60. ISSN 0004-5411

Fomin, Fedor V. ; Lokshtanov, Daniel ; Misra, Neeldhara ; Philip, Geevarghese ; Saurabh, Saket (2016) Hitting Forbidden Minors: Approximation and Kernelization SIAM Journal on Discrete Mathematics, 30 (1). pp. 383-410. ISSN 0895-4801

Fomin, F. ; Lokshtanov, D. ; Meesum, S. M. ; Saurabh, Saket ; Zehavi, M. (2016) Matrix Rigidity : Matrix Theory from the Viewpoint of Parameterized Complexity In: 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017)., March 8-11, 2017, Hannover, Germany.

Bodlaender, Hans L. ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Penninkx, Eelko ; Saurabh, Saket ; Thilikos, Dimitrios M. (2016) (Meta) Kernelization Journal of the ACM, 63 (5). pp. 1-69. ISSN 0004-5411

Cygan, Marek ; Dell, Holger ; Lokshtanov, Daniel ; Marx, Dániel ; Nederlof, Jesper ; Okamoto, Yoshio ; Paturi, Ramamohan ; Saurabh, Saket ; Wahlström, Magnus (2016) On Problems as Hard as CNF-SAT ACM Transactions on Algorithms, 12 (3). pp. 1-24. ISSN 1549-6325

Bang-Jensen, Jørgen ; Saurabh, Saket ; Simonsen, Sven (2016) Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs Algorithmica, 76 (1). pp. 279-296. ISSN 0178-4617

Basavaraju, Manu ; Francis, Mathew C. ; Ramanujan, M. S. ; Saurabh, Saket (2016) Partially Polynomial Kernels for Set Cover and Test Cover SIAM Journal on Discrete Mathematics, 30 (3). pp. 1401-1423. ISSN 0895-4801

Meesum, Syed Mohammad ; Saurabh, Saket (2016) Rank Reduction of Directed Graphs by Vertex and Edge Deletions In: 12th Latin American Symposium, April 11-15, 2016, Ensenada, Mexico.

Meesum, S.M. ; Misra, Pranabendu ; Saurabh, Saket (2016) Reducing rank of the adjacency matrix by graph modification Theoretical Computer Science, 654 . pp. 70-79. ISSN 0304-3975

Rai, Ashutosh ; Saurabh, Saket (2015) Bivariate Complexity Analysis of Almost Forest Deletion In: 21st International Conference, COCOON 2015, August 4-6, 2015, Beijing, China.

Fomin, Fedor V. ; Lokshtanov, Daniel ; Pilipczuk, Michał ; Saurabh, Saket ; Wrochna, Marcin (2015) Fully polynomial-time parameterized computations for graphs and matrices of low treewidth Association for Computing Machinery.

Fomin, Fedor V. ; Kaski, Petteri ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket (2015) Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree Lecture Notes in Computer Science, 9134 . pp. 494-505. ISSN 0302-9743

Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket (2014) Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width SIAM Journal on Computing, 43 (5). pp. 1541-1563. ISSN 0097-5397

Kumar, Mrinal ; Mishra, Sounaka ; Safina Devi, N. ; Saurabh, Saket (2014) Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization Theoretical Computer Science, 526 . pp. 90-96. ISSN 0304-3975

Lokshtanov, Daniel ; Narayanaswamy, N. S. ; Raman, Venkatesh ; Ramanujan, M. S. ; Saurabh, Saket (2014) Faster Parameterized Algorithms Using Linear Programming ACM Transactions on Algorithms, 11 (2). pp. 1-31. ISSN 1549-6325

Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michal ; Saurabh, Saket (2014) Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth In: IEEE 55th Annual Symposium on Foundations of Computer Science, 18-21 Oct. 2014, Philadelphia, PA, USA.

Misra, Neeldhara ; Philip, Geevarghese ; Raman, Venkatesh ; Saurabh, Saket (2014) The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles Algorithmica, 68 (2). pp. 504-530. ISSN 0178-4617

Cygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2014) Minimum bisection is fixed parameter tractable In: STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing, May 2014, NY, United States.

Cygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2014) On Cutwidth Parameterized by Vertex Cover Algorithmica, 68 (4). pp. 940-953. ISSN 0178-4617

Gaspers, Serge ; Ordyniak, Sebastian ; Ramanujan, M. S. ; Saurabh, Saket ; Szeider, Stefan (2013) Backdoors to q-Horn In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013).

Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket (2013) Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs Information and Computation, 233 . pp. 60-70. ISSN 0890-5401

Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios M. (2013) Bidimensionality and Kernels In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 10-17, 2020, Austin, Texas.

Fomin, Fedor V. ; Grandoni, Fabrizio ; Kratsch, Dieter ; Lokshtanov, Daniel ; Saurabh, Saket (2013) Computing Optimal Steiner Trees in Polynomial Space Algorithmica, 65 (3). pp. 584-604. ISSN 0178-4617

Raman, Venkatesh ; Saurabh, Saket ; Suchý, Ondřej (2013) An FPT Algorithm for Tree Deletion Set Lecture Notes in Computer Science, 7748 . pp. 286-297. ISSN 0302-9743

Heggernes, Pinar ; Kratsch, Dieter ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket (2013) Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization Information and Computation, 231 . pp. 109-116. ISSN 0890-5401

Lokshtanov, Daniel ; Misra, Neeldhara ; Saurabh, Saket (2013) Imbalance is fixed parameter tractable Information Processing Letters, 113 (19-21). pp. 714-718. ISSN 0020-0190

Misra, Neeldhara ; Moser, Hannes ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2013) The Parameterized Complexity of Unique Coverage and Its Variants Algorithmica, 65 (3). pp. 517-544. ISSN 0178-4617

Fomin, Fedor V. ; Saurabh, Saket ; Villanger, Yngve (2013) A Polynomial Kernel for Proper Interval Vertex Deletion SIAM Journal on Discrete Mathematics, 27 (4). pp. 1964-1976. ISSN 0895-4801

Fomin, Fedor V. ; Lokshtanov, Daniel ; Misra, Neeldhara ; Philip, Geevarghese ; Saurabh, Saket (2013) Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles Journal of Graph Theory, 74 (4). pp. 417-424. ISSN 0364-9024

Lokshtanov, Daniel ; Marx, Daniel ; Saurabh, Saket (2013) Slightly Superexponential Parameterized Problems In: ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan -23-25, 2011, California, USA.

Misra, Neeldhara ; Panolan, Fahad ; Saurabh, Saket (2013) Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? In: Mathematical Foundations of Computer Science 2013, August 26-30, 2013, Klosterneuburg, Austria.

Giannopoulou, Archontia C. ; Lokshtanov, Daniel ; Saurabh, Saket ; Suchy, Ondrej (2013) Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) Approximation) Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.

Mnich, Matthias ; Philip, Geevarghese ; Saurabh, Saket ; Suchy, Ondrej (2012) Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012).

Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket ; Rao, B.V. Raghavendra (2012) Faster algorithms for finding and counting subgraphs Journal of Computer and System Sciences, 78 (3). pp. 698-706. ISSN 0022-0000

Crowston, Robert ; Gutin, Gregory ; Jones, Mark ; Raman, Venkatesh ; Saurabh, Saket ; Yeo, Anders (2012) Fixed-Parameter Tractability of Satisfying beyond the Number of Variables Lecture Notes in Computer Science, 7317 . pp. 355-368. ISSN 0302-9743

Binkele-Raible, Daniel ; Fernau, Henning ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Villanger, Yngve (2012) Kernel(s) for problems with no kernel ACM Transactions on Algorithms, 8 (4). pp. 1-19. ISSN 1549-6325

Fellows, Michael R. ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Rosamond, Frances ; Saurabh, Saket ; Villanger, Yngve (2012) Local search: Is brute-force avoidable? Journal of Computer and System Sciences, 78 (3). pp. 707-719. ISSN 0022-0000

Gupta, Sushmita ; Raman, Venkatesh ; Saurabh, Saket (2012) Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds SIAM Journal on Discrete Mathematics, 26 (4). pp. 1758-1780. ISSN 0895-4801

Misra, Neeldhara ; Philip, Geevarghese ; Raman, Venkatesh ; Saurabh, Saket (2012) On Parameterized Independent Feedback Vertex Set Theoretical Computer Science, 461 . pp. 65-75. ISSN 0304-3975

Cygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2012) On the Hardness of Losing Width Lecture Notes in Computer Science, 7112 . pp. 159-168. ISSN 0302-9743

Amini, Omid ; Peleg, David ; Pérennes, Stéphane ; Sau, Ignasi ; Saurabh, Saket (2012) On the approximability of some degree-constrained subgraph problems Discrete Applied Mathematics, 160 (12). pp. 1661-1679. ISSN 0166-218X

Jones, Mark ; Lokshtanov, Daniel ; Ramanujan, M. S. ; Saurabh, Saket ; Suchý, Ondřej (2012) Parameterized Complexity of Directed Steiner Tree on Sparse Graphs In: Proceedings of the 21st European Symposium on Algorithms, ESA 2013, September 2-4, 2013, Sophia Antipolis, France.

Amini, Omid ; Sau, Ignasi ; Saurabh, Saket (2012) Parameterized complexity of finding small degree-constrained subgraphs Journal of Discrete Algorithms, 10 . pp. 70-83. ISSN 1570-8667

Mishra, Sounaka ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath ; Subramanian, C. R. (2011) The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover Algorithmica, 61 (4). pp. 857-881. ISSN 0178-4617

Joret, Gwenaël ; Paul, Christophe ; Sau, Ignasi ; Saurabh, Saket ; Thomassé, Stéphan (2011) Hitting and Harvesting Pumpkins Lecture Notes in Computer Science, 6942 . pp. 394-407. ISSN 0302-9743

Amini, Omid ; Fomin, Fedor V. ; Saurabh, Saket (2011) Implicit branching and parameterized partial cover problems Journal of Computer and System Sciences, 77 (6). pp. 1159-1171. ISSN 0022-0000

Bessy, Stéphane ; Fomin, Fedor V. ; Gaspers, Serge ; Paul, Christophe ; Perez, Anthony ; Saurabh, Saket ; Thomassé, Stéphan (2011) Kernels for feedback arc set in tournaments Journal of Computer and System Sciences, 77 (6). pp. 1071-1078. ISSN 0022-0000

Lokshtanov, Daniel ; Mnich, Matthias ; Saurabh, Saket (2011) A Linear Kernel for Planar Connected Dominating Set Theoretical Computer Science, 412 (23). pp. 2536-2543. ISSN 0304-3975

Cygan, Marek ; Fomin, Fedor V. ; Kowalik, Łukasz ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2011) Lower bounds based on the Exponential Time Hypothesis EATCS Bulletin, 105 . pp. 41-71.

Misra, Neeldhara ; Raman, Venkatesh ; Saurabh, Saket (2011) Lower bounds on kernelization Discrete Optimization, 8 (1). pp. 110-128. ISSN 1572-5286

Fellows, Michael R. ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Rosamond, Frances ; Saurabh, Saket ; Szeider, Stefan ; Thomassen, Carsten (2011) On the complexity of some colorful problems parameterized by treewidth Information and Computation, 209 (2). pp. 143-153. ISSN 0890-5401

Crowston, Robert ; Gutin, Gregory ; Jones, Mark ; Raman, Venkatesh ; Saurabh, Saket (2011) Parameterized Complexity of MaxSat Above Average Springer Fachmedien Wiesbaden GmbH.

Misra, Pranabendu ; Raman, Venkatesh ; Ramanujan, M. S. ; Saurabh, Saket (2011) A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments Lecture Notes in Computer Science, 7074 . pp. 333-343. ISSN 0302-9743

Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket (2011) Subexponential algorithms for partial cover problems Information Processing Letters, 111 (16). pp. 814-818. ISSN 0020-0190

Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket (2011) An exact algorithm for minimum distortion embedding Theoretical Computer Science, 412 (29). pp. 3530-3536. ISSN 0304-3975

Cohen, Nathann ; Fomin, Fedor V. ; Gutin, Gregory ; Kim, Eun Jung ; Saurabh, Saket ; Yeo, Anders (2010) Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem Journal of Computer and System Sciences, 76 (7). pp. 650-662. ISSN 0022-0000

Fernau, Henning ; Fomin, Fedor V. ; Philip, Geevarghese ; Saurabh, Saket (2010) The Curse of Connectivity: t-Total Vertex (Edge) Cover In: 16th Annual International Conference, COCOON 2010, July 19-21, 2010, Nha Trang, Vietnam.

Misra, Neeldhara ; Philip, Geevarghese ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2010) FPT Algorithms for Connected Feedback Vertex Set Lecture Notes in Computer Science, 5942 . pp. 269-280. ISSN 0302-9743

Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket (2010) Intractability of Clique-Width Parameterizations SIAM Journal on Computing, 39 (5). pp. 1941-1956. ISSN 0097-5397

Fomin, Fedor V. ; Gaspers, Serge ; Golovach, Petr A. ; Kratsch, Dieter ; Saurabh, Saket (2010) Parameterized algorithm for eternal vertex cover Information Processing Letters, 110 (16). pp. 702-706. ISSN 0020-0190

Fomin, Fedor V. ; Lokshtanov, Daniel ; Grandoni, Fabrizio ; Saurabh, Saket (2010) Sharp Separation and Applications to Exact and Parameterized Algorithms Lecture Notes in Computer Science, 6034 . pp. 72-83. ISSN 0302-9743

Golovach, Petr ; Heggernes, Pinar ; Kratsch, Dieter ; Lokshtanov, Daniel ; Meister, Daniel ; Saurabh, Saket (2009) Bandwidth on AT-Free Graphs Lecture Notes in Computer Science, 5878 . pp. 573-582. ISSN 0302-9743

Fellows, Michael ; Lokshtanov, Daniel ; Misra, Neeldhara ; Mnich, Matthias ; Rosamond, Frances ; Saurabh, Saket (2009) The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number Theory of Computing Systems, 45 (4). pp. 822-848. ISSN 1432-4350

Amini, Omid ; Fomin, Fedor V. ; Saurabh, Saket (2009) Counting Subgraphs via Homomorphisms Lecture Notes in Computer Science, 5555 . pp. 71-82. ISSN 0302-9743

Fellows, Michael R. ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Losievskaja, Elena ; Rosamond, Frances A. ; Saurabh, Saket (2009) Distortion Is Fixed Parameter Tractable Lecture Notes in Computer Science, 5555 . pp. 463-474. ISSN 0302-9743

Dom, Michael ; Lokshtanov, Daniel ; Saurabh, Saket (2009) Incompressibility through Colors and IDs Lecture Notes in Computer Science, 5555 . pp. 378-389. ISSN 0302-9743

Fomin, Fedor V. ; Gaspers, Serge ; Saurabh, Saket ; Thomassé, Stéphan (2009) A Linear Vertex Kernel for Maximum Internal Spanning Tree Lecture Notes in Computer Science, 5878 . pp. 275-282. ISSN 0302-9743

Fomin, Fedor V. ; Gaspers, Serge ; Saurabh, Saket ; Stepanov, Alexey A. (2009) On Two Techniques of Combining Branching and Treewidth Algorithmica, 54 (2). pp. 181-207. ISSN 0178-4617

Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2009) On the Directed Degree-Preserving Spanning Tree Problem Lecture Notes in Computer Science, 5917 . pp. 276-287. ISSN 0302-9743

Alon, Noga ; Fomin, Fedor V. ; Gutin, Gregory ; Krivelevich, Michael ; Saurabh, Saket (2009) Spanning Directed Trees with Many Leaves SIAM Journal on Discrete Mathematics, 23 (1). pp. 466-476. ISSN 0895-4801

Fomin, Fedor ; Saurabh, Saket ; Thilikos, Dimitrios (2008) Improving the gap of Erdös-Pósa property for minor-closed graph classes. In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 13, 2008, Gargnano - Lago di Garda.

Fomin, Fedor V. ; Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu ; Saurabh, Saket (2008) Iterative Compression and Exact Algorithms Lecture Notes in Computer Science, 5162 . pp. 335-346. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket (2008) Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles Algorithmica, 52 (2). pp. 203-225. ISSN 0178-4617

Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2007) Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques Theory of Computing Systems, 41 (3). pp. 563-587. ISSN 1432-4350

Raman, Venkatesh ; Saurabh, Saket (2007) Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG Information Processing Letters, 104 (2). pp. 65-72. ISSN 0020-0190

Fomin, Fedor V. ; Gaspers, Serge ; Saurabh, Saket (2006) Branching and Treewidth Based Exact Algorithms Lecture Notes in Computer Science, 4288 . pp. 16-25. ISSN 0302-9743

Gupta, Sushmita ; Raman, Venkatesh ; Saurabh, Saket (2006) Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems Lecture Notes in Computer Science, 4337 . pp. 139-151. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket ; Subramanian, C. R. (2006) Faster fixed parameter tractable algorithms for finding feedback vertex sets ACM Transactions on Algorithms, 2 (3). pp. 403-415. ISSN 1549-6325

Raman, Venkatesh ; Saurabh, Saket (2006) Parameterized algorithms for feedback set problems and their duals in tournaments Theoretical Computer Science, 351 (3). pp. 446-458. ISSN 0304-3975

Raman, Venkatesh ; Saurabh, Saket (2006) Triangles, 4-Cycles and Parameterized (In-)Tractability Lecture Notes in Computer Science, 4059 . pp. 304-315. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket ; Subramanian, C.R. (2005) Faster algorithms for feedback vertex set Electronic Notes in Discrete Mathematics, 19 . pp. 273-279. ISSN 1571-0653

Raman, Venkatesh ; Saurabh, Saket ; Sikdar, Somnath (2005) Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems Lecture Notes in Computer Science, 3701 . pp. 375-389. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket (2004) Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments Lecture Notes in Computer Science, 3162 . pp. 260-270. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket (2003) Parameterized Complexity of Directed Feedback Set Problems in Tournaments Lecture Notes in Computer Science, 2748 . pp. 484-492. ISSN 0302-9743

Raman, Venkatesh ; Saurabh, Saket ; Subramanian, C. R. (2002) Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set Lecture Notes in Computer Science, 2518 . pp. 241-248. ISSN 0302-9743