Vitenskapelig artikkel

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

Vitenskapelig Kapittel/Artikkel/Konferanseartikkel

• Gupta, Sushmita; Pallavi, Jain; Saurabh, Saket (2020). Well-Structured Committees. (ekstern lenke)
• Fellows, Michael; Rosamond, Frances; Fomin, Fedor et al. (2009). Local Search: Is Brute-Force Avoidable?. (ekstern lenke)

Lærebok

• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2019). Kernelization. Theory of Parameterized Preprocessing. (ekstern lenke)

Doktorgradsavhandling

• Agrawal, Akanksha; Saurabh, Saket (2017). Graph modification problems: Beyond the known boundaries. (ekstern lenke)

Vitenskapelig monografi

• Cygan, Marek; Fomin, Fedor; Lokshtanov, Daniel et al. (2015). Parameterized Algorithms. (ekstern lenke)

Se en full oversikt over publikasjoner i Cristin