Saket Saurabh
Stilling
Professor
Tilhørighet
Publikasjoner
Vitenskapelig artikkel
- P. S. Ardra; R. Krithika; Saket Saurabh et al. (2026). Balanced substructures in bicolored graphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; M. S. Ramanujan et al. (2026). Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality. (ekstern lenke)
- Tanmay Inamdar; Lawqueen Kanesh; R. Krithika et al. (2026). Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs. (ekstern lenke)
- Tanmay Inamdar; Satyabrata Jana; Madhumita Kundu et al. (2026). FPT Approximations for Connected Maximum Coverage. (ekstern lenke)
- Sriram Bhyravarapu; Pankaj Kumar; Saket Saurabh (2026). On the structural parameterized complexity of defective coloring. (ekstern lenke)
- Daniel Lokshtanov; M. S. Ramanujan; Saket Saurabh (2026). When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. (ekstern lenke)
- Satyabrata Jana; Souvik Saha; Saket Saurabh et al. (2025). Parameterized Reunion with Achromatic Number. (ekstern lenke)
- Satyabrata Jana; Soumen Mandal; Ashutosh Rai et al. (2025). Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants. (ekstern lenke)
- Matthias Bentert; Fedor Fomin; Fanny Hauser et al. (2025). The parameterized complexity landscape of two-sets cut-uncut. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2025). Fixed-Parameter Tractability of Hedge Cut. (ekstern lenke)
- Aritra Banik; Fedor Fomin; Petr Golovach et al. (2025). Multivariate Exploration of Metric Dilation. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Nitin Inamdar et al. (2025). Parameterized Geometric Graph Modification with Disk Scaling. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2025). Hybrid k-Clustering: Blending k-Median and k-Center. (ekstern lenke)
- Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2025). When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. (ekstern lenke)
- Michael Dom; Daniel Lokshtanov; Saket Saurabh et al. (2008). Capacitated Domination and Covering: A Parameterized Perspective. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Dieter Kratsch et al. (2008). Iterative Compression and Exact Algorithms. (ekstern lenke)
- Archontia Giannopoulou; Bart Maarten Paul Jansen; Daniel Lokshtanov et al. (2015). Uniform kernelization complexity of hitting forbidden minors. (ekstern lenke)
- Daniel Lokshtanov; Marcin Pilipczuk; Michal Pawel Pilipczuk et al. (2017). Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2017). Representative families of product families. (ekstern lenke)
- Fedor Fomin; Petteri Kaski; Daniel Lokshtanov et al. (2019). Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. (ekstern lenke)
- Marek Cygan; Holger Dell; Daniel Lokshtanov et al. (2016). On problems as hard as CNF-SAT. (ekstern lenke)
- Serge Gaspers; Saket Saurabh; Alexey Stepanov (2008). A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Neeldhara Misra et al. (2012). Planar F-deletion: Approximation, kernelization and optimal FPT algorithms (extended abstract). (ekstern lenke)
- Fedor Fomin; Fabrizio Grandoni; Dieter Kratsch et al. (2013). Computing optimal Steiner trees in polynomial space. (ekstern lenke)
- Daniel Lokshtanov; Daniel Marx; Saket Saurabh (2018). Slightly superexponential parameterized problems. (ekstern lenke)
- Jayakrishnan Madathil; Pranabendu Misra; Saket Saurabh (2019). An Erdős–Pósa Theorem on Neighborhoods and Domination Number. (ekstern lenke)
- Ivan Bliznets; Fedor Fomin; Petr Golovach et al. (2015). Parameterized complexity of superstring problems. (ekstern lenke)
- Akanksha Agrawal; Pallavi Jain; Lawqueen Kanesh et al. (2018). Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. (ekstern lenke)
- Omid Amini; Fedor Fomin; Saket Saurabh (2008). Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Syed Mohammad Meesum et al. (2017). Matrix rigidity from the viewpoint of parameterized complexity. (ekstern lenke)
- Sudeshna Kolay; Daniel Lokshtanov; Fahad Panolan et al. (2017). Quick but Odd Growth of Cacti. (ekstern lenke)
- Venkatesh Raman; Saket Saurabh; Sriganesh Srihari (2008). Parameterized Algorithms for Generalized Domination. (ekstern lenke)
- Omid Amini; David Peleg; Stéphane Pérennes et al. (2008). Degree-Constrained Subgraph Problems: Hardness and Approximation Results. (ekstern lenke)
- Venkatesh Raman; Saket Saurabh (2008). Short Cycles Make W -hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Nitin Inamdar et al. (2023). Kernelization for Spreading Points. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2021). Diverse Collections in Matroids and Graphs. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Saket Saurabh et al. (2009). A Linear Vertex Kernel for Maximum Internal Spanning Tree. (ekstern lenke)
- Sudeshna Kolay; Fahad Panolan; Saket Saurabh (2019). Communication complexity and graph families. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Dániel Marx et al. (2022). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (ekstern lenke)
- Omid Amini; Ignasi Sau; Saket Saurabh (2008). Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. (ekstern lenke)
- Sounaka Mishra; Venkatesh Raman; Saket Saurabh et al. (2008). König Deletion Sets and Vertex Covers above the Matching Size. (ekstern lenke)
- Syed Mohammad Meesum; Saket Saurabh (2017). Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. (ekstern lenke)
- Akanksha Agrawal; Pranabendu Misra; Fahad Panolan et al. (2017). Fast exact algorithms for survivable network design with uniform requirements. (ekstern lenke)
- Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh (2010). Imbalance is fixed parameter tractable. (ekstern lenke)
- Saket Saurabh; Prafullkumar Tale (2022). On the Parameterized Complexity of Maximum Degree Contraction Problem. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Saket Saurabh et al. (2009). On two techniques of combining branching and treewidth. (ekstern lenke)
- Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan et al. (2017). Lossy kernelization. (ekstern lenke)
- Fahad Panolan; Saket Saurabh; Meirav Zehavi (2024). Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Dániel Marx et al. (2016). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (ekstern lenke)
- Daniel Lokshtanov; Saket Saurabh; Roohani Sharma et al. (2018). Balanced judicious bipartition is fixed-paramater tractable. (ekstern lenke)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2014). On cutwidth parameterized by vertex cover. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2016). Editing to connected f-degree graph. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2018). Winning a tournament by any means necessary. (ekstern lenke)
- Daniel Lokshtanov; Neeldhara Misra; Saket Saurabh (2013). Imbalance is fixed parameter tractable. (ekstern lenke)
- Fedor Fomin; Saket Saurabh; Dimitrios M. Thilikos (2011). Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. (ekstern lenke)
- Noga Alon; Fedor Fomin; Gregory Gutin et al. (2007). Better Algorithms and Bounds for Directed Maximum Leaf Problems. (ekstern lenke)
- Noga Alon; Fedor Fomin; Gregory Gutin et al. (2007). Parameterized Algorithms for Directed Maximum Leaf Problems. (ekstern lenke)
- Michael Dom; Daniel Lokshtanov; Saket Saurabh (2014). Kernelization lower bounds through colors and IDs. (ekstern lenke)
- Jayakrishnan Madathil; Fahad Panolan; Abhishek Sahu et al. (2019). On the complexity of mixed dominating SET. (ekstern lenke)
- Rajesh Chitnis; Fedor Fomin; Daniel Lokshtanov et al. (2017). Faster exact algorithms for some terminal set problems. (ekstern lenke)
- Rune D. Kjærsgaard; Pekka Parviainen; Saket Saurabh et al. (2024). Fair Soft Clustering. (ekstern lenke)
- Madhumita Kundu; Pekka Parviainen; Saket Saurabh (2024). Time–Approximation Trade-Offs for Learning Bayesian Networks. (ekstern lenke)
- Madhumita Kundu; Pekka Parviainen; Saket Saurabh (2024). Discovering Bayesian Networks when Few Variables Matter. (ekstern lenke)
- Pradeesha Ashok; Sudeshna Kolay; Syed Mohammad Meesum et al. (2017). Parameterized complexity of strip packing and minimum volume packing. (ekstern lenke)
- Ramaswamy Krithika; Ashutosh Rai; Saket Saurabh et al. (2017). Parameterized and exact algorithms for class domination coloring. (ekstern lenke)
- Akanksha Agrawal; Pallavi Jain; Lawqueen Kanesh et al. (2019). Exploring the kernelization borders for hitting cycles. (ekstern lenke)
- Sushmita Gupta; Pallavi Jain; Sanjukta Roy et al. (2019). Gehrlein stability in committee selection: Parameterized hardness and algorithms. (ekstern lenke)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2022). Detours in Directed Graphs. (ekstern lenke)
- Daniel Lokshtanov; Saket Saurabh; Roohani Sharma et al. (2019). Balanced judicious bipartition is fixed-parameter tractable. (ekstern lenke)
- Akanksha Agrawal; Saket Saurabh; Roohani Sharma et al. (2018). Kernels for deletion to classes of acyclic digraphs. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2017). Finding, hitting and packing cycles in subexponential time on unit disk graphs. (ekstern lenke)
- Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2025). Packing Short Cycles. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Syed Mohammad Meesum et al. (2018). Matrix rigidity from the viewpoint of parameterized complexity. (ekstern lenke)
- Fedor Fomin; Petteri Kaski; Daniel Lokshtanov et al. (2015). Parameterized single-exponential time polynomial space algorithm for steiner tree. (ekstern lenke)
- Syed Mohammad Meesum; Saket Saurabh (2016). Rank reduction of directed graphs by vertex and edge deletions. (ekstern lenke)
- Saket Saurabh; Meirav Zehavi (2019). Parameterized complexity of multi-node hubs. (ekstern lenke)
- Daniel Lokshtanov; Mateus De Oliveira Oliveira; Saket Saurabh (2019). A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Amer E. Mouawad et al. (2018). Simultaneous feedback vertex set: A parameterized perspective. (ekstern lenke)
- Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov et al. (2013). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. (ekstern lenke)
- Timothy Carpenter; Fedor Fomin; Daniel Lokshtanov et al. (2018). Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. (ekstern lenke)
- Fedor Fomin; Saket Saurabh; Yngve Villanger (2013). A polynomial kernel for proper interval vertex deletion. (ekstern lenke)
- Saket Saurabh; Akanksha Agrawal; Daniel Lokshtanov et al. (2019). Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. (ekstern lenke)
- Spoorthy Gunda; Pallavi Jain; Daniel Lokshtanov et al. (2021). On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. (ekstern lenke)
- Henning Fernau; Fedor Fomin; Daniel Lokshtanov et al. (2014). Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2018). Kernels for (Connected) dominating set on graphs with excluded topological minors. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2019). Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. (ekstern lenke)
- Aritra Banik; Pratibha Choudhary; Daniel Lokshtanov et al. (2018). A polynomial sized kernel for tracking paths problem. (ekstern lenke)
- Jayakrishnan Madathil; Saket Saurabh; Meirav Zehavi (2018). Max-cut above spanning tree is fixed-parameter tractable. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Amer Abdo Mouawad et al. (2016). SIMULTANEOUS Feedback Vertex set: A parameterized perspective. (ekstern lenke)
- Akanksha Agrawal; Madhumita Kundu; Abhishek Sahu et al. (2022). Parameterized Complexity of Maximum Edge Colorable Subgraph. (ekstern lenke)
- Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh et al. (2019). Packing cycles faster than Erdos-Posa. (ekstern lenke)
- Fedor Fomin; Fahad Panolan; M.S. Ramanujan et al. (2022). On the optimality of pseudo-polynomial algorithms for integer programming. (ekstern lenke)
- Akanksha Agrawal; Lawqueen Kanesh; Saket Saurabh et al. (2021). Paths to trees and cacti. (ekstern lenke)
- R. Krithika; Ashutosh Rai; Saket Saurabh et al. (2021). Parameterized and exact algorithms for class domination coloring. (ekstern lenke)
- Akanksha Agrawal; Saket Saurabh; Prafullkumar Tale (2018). On the Parameterized Complexity of Contraction to generalization of trees. (ekstern lenke)
- Fedor Fomin; Fahad Panolan; MS Ramanujan et al. (2018). On the optimality of pseudo-polynomial algorithms for integer programming. (ekstern lenke)
- Manu Basavaraju; Fahad Panolan; Ashutosh Rai et al. (2018). On the kernelization complexity of string problems. (ekstern lenke)
- Tanmay Inamdar; Madhumita Kundu; Pekka Parviainen et al. (2024). Exponential-Time Approximation Schemes via Compression. (ekstern lenke)
- Akanksha Agrawal; Grzegorz Guspiel; Jayakrishnan Madathil et al. (2019). Connecting the Dots (with Minimum Crossings). (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Nitin Inamdar et al. (2021). ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2020). Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2021). ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Saket Saurabh (2007). Improved Exact Algorithms for Counting 3- and 4-Colorings. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2018). Polylogarithmic approximation algorithms for weighted-F-Deletion problems. (ekstern lenke)
- Pranabendu Misra; Fahad Panolan; Ashutosh Rai et al. (2020). Quick separation in chordal and split graphs. (ekstern lenke)
- Rian Neogi; M.S. Ramanujan; Saket Saurabh et al. (2020). On the parameterized complexity of deletion to H-free strong components. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2010). Intractability of clique-width parameterizations. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2019). Spanning circuits in regular matroids. (ekstern lenke)
- Lawqueen Kanesh; Soumen Maity; Komal Muluk et al. (2021). Parameterized complexity of fair feedback vertex set problem. (ekstern lenke)
- Sudeshna Kolay; Daniel Lokshtanov; Fahad Panolan et al. (2015). Quick but odd growth of cacti. (ekstern lenke)
- Arindam Biswas; Venkatesh Raman; Saket Saurabh (2021). Approximation in (Poly-) Logarithmic Space. (ekstern lenke)
- Fahad Panolan; Geevarghese Philip; Saket Saurabh (2015). B-chromatic number: Beyond NP-hardness. (ekstern lenke)
- Mark Jones; Daniel Lokshtanov; Ramanujan Maadapuzhi Shridharan et al. (2017). Parameterized complexity of directed Steiner tree on sparse graphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2021). Parameterized Complexity of Directed Spanner Problems. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan et al. (2015). Deterministic truncation of linear matroids. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Daniel Lokshtanov et al. (2016). Exact algorithms via monotone local search. (ekstern lenke)
- Michael Fellows; Daniel Lokshtanov; Neeldhara Misra et al. (2008). Graph Layout problems Parameterized by Vertex Cover. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2018). Covering Vectors by Spaces: Regular Matroids. (ekstern lenke)
- Prachi Goyal; Pranabendu Misra; Fahad Panolan et al. (2015). Finding even subgraphs even faster. (ekstern lenke)
- Pallavi Jain; Lawqueen Kanesh; William Alexandre Lochet et al. (2025). Exact and Approximate Digraph Bandwidth. (ekstern lenke)
- Akanksha Agrawal; Édouard Bonnet; Radu Curticapean et al. (2019). Parameterized streaming algorithms for min-ones d-SAT. (ekstern lenke)
- Neeldhara Misra; Fahad Panolan; Saket Saurabh (2019). On the parameterized complexity of edge-linked paths. (ekstern lenke)
- Akanksha Agrawal; Sudeshna Kolay; Jayakrishnan Madathil et al. (2019). Parameterized complexity classification of deletion to list matrix-partition for low-order matrices. (ekstern lenke)
- Aritra Banik; Fahad Panolan; Venkatesh Raman et al. (2017). Parameterized complexity of geometric covering problems having conflicts. (ekstern lenke)
- Pradeesha Ashok; Sudeshna Kolay; Saket Saurabh (2016). Parameterized complexity of red blue set cover for lines. (ekstern lenke)
- Ivan Bliznets; Fedor Fomin; Petr Golovach et al. (2016). Parameterized Complexity of Superstring Problems. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2016). Efficient computation of representative families with applications in parameterized and exact algorithms. (ekstern lenke)
- Frederic Dorn; Fedor Fomin; Daniel Lokshtanov et al. (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh (2011). An exact algorithm for minimum distortion embedding. (ekstern lenke)
- Saket Saurabh; Meirav Zehavi (2016). (k,n−k) -Max-Cut: An O∗(2p) - time algorithm and a polynomial kernel. (ekstern lenke)
- Eduard Eiben; William Lochet; Saket Saurabh (2020). A Polynomial Kernel for Paw-Free Editing. (ekstern lenke)
- Akanksha Agrawal; Madhumita Kundu; Abhishek Sahu et al. (2020). Parameterized Complexity of Maximum Edge Colorable Subgraph. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Nitin Inamdar et al. (2022). Exact Exponential Algorithms for Clustering Problems. (ekstern lenke)
- Sushmita Gupta; Fahad Panolan; Saket Saurabh et al. (2019). Stability in barter exchange markets. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2018). Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. (ekstern lenke)
- Akanksha Agrawal; Kristine Vitting Klinkby Knudsen; Daniel Lokshtanov et al. (2023). The Parameterized Complexity of Guarding Almost Convex Polygons. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan et al. (2018). Quasipolynomial representation of transversal matroids with applications in parameterized complexity. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2020). ETH-tight algorithms for long path and cycle on unit disk graphs. (ekstern lenke)
- Fedor Fomin; Saket Saurabh; Yngve Villanger (2012). A Polynomial Kernel for Proper Interval Vertex Deletion. (ekstern lenke)
- Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy et al. (2023). Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Daniel Lokshtanov et al. (2019). Exact algorithms via monotone local search. (ekstern lenke)
- Henning Fernau; Fedor Fomin; Geevarghese Philip et al. (2015). On the parameterized complexity of vertex cover and edge cover with connectivity constraints. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2019). Editing to connected F-degree graph. (ekstern lenke)
- Daniel Lokshtanov; Ramanujan Maadapuzhi Shridharan; Saket Saurabh (2015). Linear time parameterized algorithms for subset feedback vertex set. (ekstern lenke)
- Fedor Fomin; Saket Saurabh; Neeldhara Misra (2015). Graph modification problems: A modern perspective. (ekstern lenke)
- Archontia Giannopoulou; Bart M.P. Jansen; Daniel Lokshtanov et al. (2017). Uniform kernelization complexity of hitting forbidden minors. (ekstern lenke)
- Akanksha Agrawal; Pallavi Jain; Lawqueen Kanesh et al. (2019). Parameterized complexity of conflict-free matchings and paths. (ekstern lenke)
- Stephane Bessy; Marin Bougeret; R Krithika et al. (2019). Packing arc-disjoint cycles in tournaments. (ekstern lenke)
- Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil et al. (2022). On the complexity of singly connected vertex deletion. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2014). Representative sets of product families. (ekstern lenke)
- Satyabrata Jana; Souvik Saha; Abhishek Sahu et al. (2024). Partitioning subclasses of chordal graphs with few deletions. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2018). Erdos-Posa property of obstructions to interval graphs. (ekstern lenke)
- Nathann Cohen; Fedor Fomin; Gregory Gutin et al. (2010). Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. (ekstern lenke)
- Akanksha Agrawal; Pranabendu Misra; Saket Saurabh et al. (2019). Interval vertex deletion admits a polynomial kernel. (ekstern lenke)
- Fedor Fomin; Petr Golovach; William Alexandre Lochet et al. (2023). Detours in directed graphs. (ekstern lenke)
- Fahad Panolan; Ramanujan Maadapuzhi Shridharan; Saket Saurabh (2015). On the parameterized complexity of GIRTH and CONNECTIVITY problems on linear matroids. (ekstern lenke)
- Akanksha Agrawal; Fahad Panolan; Saket Saurabh et al. (2016). Simultaneous feedback edge set: A parameterized perspective. (ekstern lenke)
- Aritra Banik; Fahad Panolan; Venkatesh Raman et al. (2019). Parameterized Complexity of Geometric Covering Problems Having Conflicts. (ekstern lenke)
- Fedor Fomin; Fabrizio Grandoni; Daniel Lokshtanov et al. (2012). Sharp separation and applications to exact and parameterized algorithms. (ekstern lenke)
- Akanksha Agrawal; Saket Saurabh; Prafullkumar Tale (2018). On the Parameterized Complexity of Contraction to Generalization of Trees. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2021). Balanced stable marriage: How close is close enough?. (ekstern lenke)
- Daniel Lokshtanov; Matthias Mnich; Saket Saurabh (2011). A linear kernel for a planar connected dominating set. (ekstern lenke)
- Isolde Marianne Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause et al. (2017). Irrelevant vertices for the planar Disjoint Paths Problem. (ekstern lenke)
- Akanksha Agrawal; Paloma T. Lima; Daniel Lokshtanov et al. (2025). Odd Cycle Transversal on P5-free Graphs in Polynomial Time. (ekstern lenke)
- Geevarghese Philip; Ashutosh Rai; Saket Saurabh (2018). Generalized pseudoforest deletion: Algorithms and uniform kernel. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2019). Going Far From Degeneracy. (ekstern lenke)
- Stephane Bessy; Fedor Fomin; Serge Gaspers et al. (2011). Kernels for feedback arc set in tournaments. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Neeldhara Misra et al. (2013). Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Saket Saurabh et al. (2019). Split contraction: The untold story. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Venkatesh Raman et al. (2011). Subexponential algorithms for partial cover problems. (ekstern lenke)
- Sushmita Gupta; Saket Saurabh; Ramanujan Sridharan et al. (2019). On succinct encodings for the tournament fixing problem. (ekstern lenke)
- Fahad Panolan; Geevarghese Philip; Saket Saurabh (2017). On the parameterized complexity of b-CHROMATIC NUMBER. (ekstern lenke)
- Michael R. Fellows; Fedor Fomin; Daniel Lokshtanov et al. (2011). On the complexity of some colorful problems parameterized by treewidth. (ekstern lenke)
- Daniel Lokshtanov; MS Ramanujan; Saket Saurabh et al. (2018). Reducing CMSO model checking to highly connected graphs. (ekstern lenke)
- Neeldhara Misra; Fahad Panolan; Saket Saurabh (2020). Subexponential algorithm for d-cluster edge deletion: Exception or rule?. (ekstern lenke)
- Petr Golovach; R. Krithika; Abhishek Sahu et al. (2020). Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. (ekstern lenke)
- Fedor Fomin; Petr Golovach; William Lochet et al. (2020). Parameterized Complexity of Directed Spanner Problems. (ekstern lenke)
- Abhishek Sahu; Saket Saurabh (2023). Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2014). Almost optimal lower bounds for problems parameterized by clique-width. (ekstern lenke)
- Syed Mohammad Meesum; Pranabendu Misra; Saket Saurabh (2015). Reducing rank of the adjacency matrix by graph modification. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Dieter Kratsch et al. (2010). Iterative compression and exact algorithms. (ekstern lenke)
- Fahad Panolan; Saket Saurabh; Meirav Zehavi (2018). Parameterized Algorithms for List K-Cycle. (ekstern lenke)
- Michael Fellows; Daniel Lokshtanov; Neeldhara Misra et al. (2009). The complexity ecology of parameters: An illustration using bounded max leaf number. (ekstern lenke)
- Syed Mohammad Meesum; Pranabendu Misra; Saket Saurabh (2016). Reducing rank of the adjacency matrix by graph modification. (ekstern lenke)
- Ramaswamy Krithika; Abhishek Sahu; Saket Saurabh et al. (2018). The parameterized complexity of cycle packing: Indifference is not an issue. (ekstern lenke)
- Petr Golovach; Daniel Lokshtanov; Saket Saurabh et al. (2018). Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; Michal Pawel Pilipczuk et al. (2025). AN EXPONENTIAL TIME PARAMETERIZED ALGORITHM FOR PLANAR DISJOINT PATHS. (ekstern lenke)
- Spoorthy Gunda; Pallavi Jain; Daniel Lokshtanov et al. (2020). On the parameterized approximability of contraction to classes of chordal graphs. (ekstern lenke)
- Hans L. Bodlaender; Fedor Fomin; Daniel Lokshtanov et al. (2016). (Meta) Kernelization. (ekstern lenke)
- Pradeesha Ashok; Fedor Fomin; Sudeshna Kolay et al. (2017). Exact algorithms for terrain guarding. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2019). Quadratic Vertex Kernel for Rainbow Matching. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan et al. (2020). A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. (ekstern lenke)
- Sushmita Gupta; Pallavi Jain; Saket Saurabh et al. (2023). Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. (ekstern lenke)
- Omid Amini; Fedor Fomin; Saket Saurabh (2009). Counting Subgraphs via Homomorphisms. (ekstern lenke)
- Sudeshna Kolay; Pranabendu Misra; M.S. Ramanujan et al. (2020). Faster Graph bipartization. (ekstern lenke)
- Saket Saurabh; Meirav Zehavi (2018). (k,n−k) -max-cut: an O∗(2p)-time algorithm and a polynomial kernel. (ekstern lenke)
- Neeraj Kumar; Daniel Lokshtanov; Saket Saurabh et al. (2021). A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. (ekstern lenke)
- Daniel Lokshtanov; Maadapuzhi-Sridharan Ramanujan; Saket Saurabh et al. (2025). Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2020). Hitting Topological Minors Is FPT. (ekstern lenke)
- Akanksha Agrawal; Kristine Vitting Klinkby Knudsen; Daniel Lokshtanov et al. (2020). The Parameterized Complexity of Guarding Almost Convex Polygons. (ekstern lenke)
- Pål Grønås Drange; Markus Sortland Dregi; Fedor Fomin et al. (2016). Kernelization and sparseness: The case of dominating set. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2022). Resolute control: Forbidding candidates from winning an election is hard. (ekstern lenke)
- Pranabendu Misra; Fahad Panolan; M. S. Ramanujan et al. (2017). Linear representation of transversal matroids and gammoids parameterized by rank. (ekstern lenke)
- Matthias Bentert; Michael Ralph Fellows; Petr Golovach et al. (2024). Breaking a Graph into Connected Components with Small Dominating Sets. (ekstern lenke)
- Daniel Lokshtanov; Daniel Marx; Saket Saurabh (2018). Known algorithms on graphs of bounded treewidth are probably optimal. (ekstern lenke)
- Daniel Lokshtanov; M.S. Ramanujan; Saket Saurabh et al. (2020). Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; M.S. Ramanujan et al. (2021). FPT-approximation for FPT Problems. (ekstern lenke)
- Daniel Lokshtanov; Saket Saurabh; Meirav Zehavi (2021). Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). (ekstern lenke)
- Sushmita Gupta; Pallavi Jain; Sanjukta Roy et al. (2020). Gehrlein stability in committee selection: parameterized hardness and algorithms. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2019). Balanced Stable Marriage: How Close Is Close Enough?. (ekstern lenke)
- Akanksha Agrawal; Fedor Fomin; Daniel Lokshtanov et al. (2019). Path Contraction Faster Than 2n. (ekstern lenke)
- Kristine Vitting Klinkby Knudsen; Pranabendu Misra; Saket Saurabh (2021). Strong Connectivity Augmentation is FPT. (ekstern lenke)
- Akanksha Agrawal; Fedor Fomin; Daniel Lokshtanov et al. (2020). Path contraction faster than $2^n$. (ekstern lenke)
- Daniel Lokshtanov; N.S. Narayanaswamy; Venkatesh Raman et al. (2014). Faster parameterized algorithms using linear programming. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2020). Bidimensionality and Kernels. (ekstern lenke)
- Saket Saurabh; Uéverton dos Santos Souza; Prafullkumar Tale (2022). On the parameterized complexity of Grid Contraction. (ekstern lenke)
- Arindam Biswas; Venkatesh Raman; Saket Saurabh (2020). Approximation in (poly-) logarithmic space. (ekstern lenke)
- Akanksha Agrawal; Sushmita Gupta; Saket Saurabh et al. (2017). Improved algorithms and combinatorial bounds for independent Feedback Vertex Set. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2024). Stability in Graphs with Matroid Constraints. (ekstern lenke)
- Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan et al. (2015). Reconfiguration on sparse graphs. (ekstern lenke)
- Aritra Banik; Fedor Fomin; Petr Golovach et al. (2024). Cuts in Graphs with Matroid Constraints. (ekstern lenke)
- Daniel Lokshtanov; Amer E. Mouawad; Fahad Panolan et al. (2018). Reconfiguration on sparse graphs. (ekstern lenke)
- Tanmay Inamdar; Lawqueen Kanesh; Madhumita Kundu et al. (2025). Fixed-parameter algorithms for Fair Hitting Set problems. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2024). Hybrid k-Clustering: Blending k-Median and k-Center. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2018). When rigging a tournament, let greediness blind you. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2024). (Re)packing Equal Disks into Rectangle. (ekstern lenke)
- Rian Neogi; M.S. Ramanujan; Saket Saurabh et al. (2024). ON THE PARAMETERIZED COMPLEXITY OF DELETION TO H-FREE STRONG COMPONENTS. (ekstern lenke)
- Fedor Fomin; Sudeshna Kolay; Daniel Lokshtanov et al. (2020). Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. (ekstern lenke)
- Petr Golovach; Pinar Heggernes; Dieter Kratsch et al. (2011). Bandwidth on AT-free graphs. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Neeldhara Misra et al. (2016). Hitting forbidden minors: Approximation and kernelization. (ekstern lenke)
- Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh et al. (2017). Packing cycles faster than Erdös-Pósa. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Saket Saurabh et al. (2017). Split contraction: The untold story. (ekstern lenke)
- Daniel Lokshtanov; Ramanujan Maadapuzhi Shridharan; Saket Saurabh (2018). Linear time parameterized algorithms for subset feedback vertex set. (ekstern lenke)
- J Bang-Jensen; Kristine Vitting Klinkby Knudsen; Saket Saurabh et al. (2019). The parameterized complexity landscape of finding 2-partitions of digraphs. (ekstern lenke)
- Akanksha Agrawal; Sudeshna Kolay; Daniel Lokshtanov et al. (2016). A faster FPT algorithm and a smaller kernel for block graph vertex deletion. (ekstern lenke)
- Fedor Fomin; Tien-Nam Le; Daniel Lokshtanov et al. (2019). Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. (ekstern lenke)
- R. Krithika; Abhishek Sahu; Saket Saurabh et al. (2019). The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. (ekstern lenke)
- Daniel Lokshtanov; Saket Saurabh; Ondrej Suchy (2014). Solving Multicut faster than 2n. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2023). Polynomial Kernel for Interval Vertex Deletion. (ekstern lenke)
- Ashutosh Rai; M.S. Ramanujan; Saket Saurabh (2016). A parameterized algorithm for mixed-cut. (ekstern lenke)
- Sushmita Gupta; Saket Saurabh; Fahad Panolan et al. (2018). Exchange markets stability in barter. (ekstern lenke)
- Pradeesha Ashok; Aditi Dudeja; Sudeshna Kolay et al. (2018). Exact and fixed parameter tractable algorithms for max-conflict-free coloring in hypergraphs. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2017). Group activity selection on graphs: Parameterized analysis. (ekstern lenke)
- Sudeshna Kolay; Fahad Panolan; Saket Saurabh (2017). Communication complexity of pairs of graph families with applications. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2018). Parameterized Algorithms and Kernels for Rainbow Matching. (ekstern lenke)
- Akanksha Agrawal; Saket Saurabh; Roohani Sharma et al. (2018). Parameterised Algorithms for Deletion to Classes of DAGs. (ekstern lenke)
- Akanksha Agrawal; Lawqueen Kanesh; Saket Saurabh et al. (2017). Paths to trees and cacti. (ekstern lenke)
- Fedor Fomin; Sudeshna Kolay; Daniel Lokshtanov et al. (2016). Subexponential algorithms for rectilinear Steiner tree and arborescence problems. (ekstern lenke)
- Omid Amini; Fedor Fomin; Saket Saurabh (2012). Counting subgraphs via homomorphisms. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2020). Going Far from Degeneracy. (ekstern lenke)
- Henning Fernau; Fedor Fomin; Daniel Lokshtanov et al. (2009). Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. (ekstern lenke)
- Nathann Cohen; Fedor Fomin; Gregory Gutin et al. (2009). Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. (ekstern lenke)
- Noga Alon; Daniel Lokshtanov; Saket Saurabh (2009). Fast FAST. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh (2009). An Exact Algorithm for Minimum Distortion Embedding. (ekstern lenke)
- Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh et al. (2009). On the Directed Degree-Preserving Spanning Tree Problem. (ekstern lenke)
- Saket Saurabh; Daniel Lokshtanov (2009). Even Faster Algorithm for Set Splitting!. (ekstern lenke)
- Neeldhara Misra; Venkatesh Raman; Saket Saurabh et al. (2009). The Budgeted Unique Coverage Problem and Color-Coding. (ekstern lenke)
- Daniel Lokshtanov; Matthias Mnich; Saket Saurabh (2009). Linear Kernel for Planar Connected Dominating Set. (ekstern lenke)
- Michael Fellows; Fedor Fomin; Daniel Lokshtanov et al. (2009). Distortion Is Fixed Parameter Tractable. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh (2018). Excluded grid minors and efficient polynomial-time approximation schemes. (ekstern lenke)
- Daniel Lokshtanov; Saket Saurabh; Somnath Sikdar (2009). Simpler Parameterized Algorithm for OCT. (ekstern lenke)
- Michael Dom; Daniel Lokshtanov; Saket Saurabh (2009). Incompressibility through Colors and IDs. (ekstern lenke)
- Stephane Bessy; Fedor Fomin; Serge Gaspers et al. (2009). Kernels for Feedback Arc Set In Tournaments. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Venkatesh Raman et al. (2009). Subexponential Algorithms for Partial Cover Problems. (ekstern lenke)
- Daniel Lokshtanov; Venkatesh Raman; Saket Saurabh et al. (2011). On the directed Full Degree Spanning Tree problem. (ekstern lenke)
- Pradeesha Ashok; Fedor Fomin; Sudeshna Kolay et al. (2018). Exact algorithms for terrain guarding. (ekstern lenke)
- M.S. Ramanujan; Saket Saurabh (2017). Linear-time parameterized algorithms via skew-symmetric multicuts. (ekstern lenke)
- Pranabendu Misra; Fahad Panolan; M.S. Ramanujan et al. (2020). Linear representation of transversal matroids and gammoids parameterized by rank. (ekstern lenke)
- Neeldhara Misra; Fahad Panolan; Ashutosh Rai et al. (2018). Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2018). Long directed (s,t)-path: FPT algorithm. (ekstern lenke)
- Venkatesh Raman; M. S. Ramanujan; Saket Saurabh (2020). A characterization of König-Egerváry graphs with extendable vertex covers. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Fahad Panolan et al. (2026). Decomposition of Map Graphs with Applications. (ekstern lenke)
- Prachi Goyal; Pranabendu Misra; Fahad Panolan et al. (2018). Finding even subgraphs even faster. (ekstern lenke)
- Syed M. Meesum; Fahad Panolan; Saket Saurabh et al. (2019). Rank vertex cover as a natural problem for algebraic compression. (ekstern lenke)
- Aritra Banik; Pratibha Choudhary; Venkatesh Raman et al. (2020). Fixed-parameter tractable algorithms for Tracking Shortest Paths. (ekstern lenke)
- Akanksha Agrawal; Fahad Panolan; Saket Saurabh et al. (2021). Simultaneous Feedback Edge Set: A Parameterized Perspective. (ekstern lenke)
- Deeksha Adil; Sushmita Gupta; Sanjukta Roy et al. (2018). Parameterized algorithms for stable matching with ties and incomplete lists. (ekstern lenke)
- Jan Derbisz; Lawqueen Kanesh; Jayakrishnan Madathil et al. (2022). A polynomial kernel for bipartite permutation vertex deletion. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2020). Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. (ekstern lenke)
- Sushmita Gupta; Sanjukta Roy; Saket Saurabh et al. (2017). Parameterized algorithms and kernels for rainbow matching. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee et al. (2020). 2-Approximating Feedback Vertex Set in Tournaments. (ekstern lenke)
- Geevarghese Philip; Varun Rajan; Saket Saurabh et al. (2019). Subset Feedback Vertex Set in Chordal and Split Graphs. (ekstern lenke)
- Akanksha Agrawal; Pallavi Jain; Lawqueen Kanesh et al. (2020). Parameterized Complexity of Conflict-Free Matchings and Paths. (ekstern lenke)
- Lawqueen Kanesh; Soumen Maity; Komal Muluk et al. (2020). Parameterized complexity of fair feedback vertex set problem. (ekstern lenke)
- Soumen Mandal; Pranabendu Misra; Ashutosh Rai et al. (2024). Parameterized approximation algorithms for weighted vertex cover. (ekstern lenke)
- Geevarghese Philip; Varun Rajan; Saket Saurabh et al. (2019). Subset Feedback Vertex Set in Chordal and Split Graphs. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2017). Spanning Circuits in Regular Matroids. (ekstern lenke)
- Daniel Lokshtanov; Michal Pilipczuk; Saket Saurabh (2018). Below all subsets for minimal connected dominating set. (ekstern lenke)
- Abhishek Sahu; Saket Saurabh (2020). Kernelization of arc disjoint cycle packing in α-Bounded Digraphs. (ekstern lenke)
- Ashutosh Rai; Saket Saurabh (2018). Bivariate complexity analysis of ALMOST FOREST DELETION. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2018). Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. (ekstern lenke)
- Daniel Lokshtanov; M. S. Ramanujan; Saket Saurabh (2017). A linear-Time parameterized algorithm for node unique label cover. (ekstern lenke)
- Pranabendu Misra; Saket Saurabh; Roohani Sharma et al. (2018). Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. (ekstern lenke)
- Saket Saurabh; Meirav Zehavi (2023). Parameterized complexity of multi-node hubs. (ekstern lenke)
- Fahad Panolan; Saket Saurabh; Meirav Zehavi (2019). Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. (ekstern lenke)
- Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil et al. (2020). On the Complexity of Singly Connected Vertex Deletion. (ekstern lenke)
- Arindam Biswas; Venkatesh Raman; Saket Saurabh (2019). Solving GROUP INTERVAL SCHEDULING efficiently. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Diptapriyo Majumdar et al. (2016). Kernelization of cycle packing with relaxed disjointness constraints. (ekstern lenke)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2016). Lower bounds for approximation schemes for closest string. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Ivan Mihajlin et al. (2021). Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. (ekstern lenke)
- Omid Amini; Fedor Fomin; Saket Saurabh (2011). Implicit branching and parameterized partial cover problems. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2017). Covering vectors by spaces: Regular matroids. (ekstern lenke)
- Akanksha Agrawal; Daniel Lokshtanov; Pranabendu Misra et al. (2022). Erdős–Pósa property of obstructions to interval graphs. (ekstern lenke)
- Sushmita Gupta; Pranabendu Misra; Saket Saurabh et al. (2019). Popular matching in roommates setting is NP-hard. (ekstern lenke)
- William Lochet; Daniel Lokshtanov; Pranabendu Misra et al. (2020). Fault tolerant subgraphs with applications in kernelization. (ekstern lenke)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2019). Minimum Bisection Is Fixed-Parameter Tractable. (ekstern lenke)
- Pinar Heggernes; Dieter Kratsch; Daniel Lokshtanov et al. (2010). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. (ekstern lenke)
- Fedor Fomin; Daniel Lokshtanov; Saket Saurabh et al. (2018). Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. (ekstern lenke)
- Noga Alon; Fedor Fomin; Gregory Gutin et al. (2008). Spanning directed trees with many leaves. (ekstern lenke)
- Fedor Fomin; Serge Gaspers; Saket Saurabh et al. (2013). A linear vertex kernel for maximum internal spanning tree. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Daniel Lokshtanov et al. (2020). Parameterization Above a Multiplicative Guarantee. (ekstern lenke)
- Fedor Fomin; Petr Golovach; Fahad Panolan et al. (2023). Diverse collections in matroids and graphs. (ekstern lenke)
- Daniel Binkele-Raible; Henning Fernau; Fedor Fomin et al. (2012). Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. (ekstern lenke)
- Archontia Giannopoulou; Daniel Lokshtanov; Saket Saurabh et al. (2016). Tree deletion set has a polynomial kernel (but No OPTο(1) Approximation). (ekstern lenke)
- Jayakrishnan Madathil; Saket Saurabh; Meirav Zehavi (2019). Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. (ekstern lenke)
- Akanksha Agrawal; Pranabendu Misra; Fahad Panolan et al. (2022). Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. (ekstern lenke)
- Marek Cygan; Daniel Lokshtanov; Marcin Pilipczuk et al. (2012). On Cutwidth Parameterized by Vertex Cover. (ekstern lenke)
- Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee et al. (2021). 2-Approximating Feedback Vertex Set in Tournaments. (ekstern lenke)
- Archontia Giannopoulou; Daniel Lokshtanov; Saket Saurabh et al. (2014). Tree deletion set has a polynomial kernel (but no OPTO(1) approximation). (ekstern lenke)
- Sudeshna Kolay; Fahad Panolan; Venkatesh Raman et al. (2016). Parameterized algorithms on perfect graphs for deletion to (r,l)-Graphs. (ekstern lenke)
- Fedor Fomin; Saket Saurabh (2018). Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. (ekstern lenke)
- Manu Basavaraju; Fedor Fomin; Petr Golovach et al. (2014). Parameterized algorithms to preserve connectivity. (ekstern lenke)
- Manu Basavaraju; Fedor Fomin; Petr Golovach et al. (2014). Connecting vertices by independent trees. (ekstern lenke)
- Petr Golovach; Pinar Heggernes; Dieter Kratsch et al. (2009). Bandwidth on AT-Free Graphs. (ekstern lenke)
Vitenskapelig bokkapittel
Konferanseforedrag
- Matthias Bentert; Petr Golovach; Tanmay Inamdar et al. (2025). Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. (ekstern lenke)
- Sriram Bhyravarapu; Karthika Dhayanchand; Muthucumaraswamy Rajamanickam et al. (2025). On the Complexity of Minimum Membership Dominating Set. (ekstern lenke)
- Matthias Bentert; Fedor Fomin; Fanny Hauser et al. (2024). The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. (ekstern lenke)