Saket Suman Saurabh

Saket Suman Saurabh's AcademicInfluence.com Rankings

Saket Suman Saurabh

Computer Science

#8839

World Rank

#9292

Historical Rank

Database

#5836

World Rank

#6053

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Saket Suman Saurabh's Degrees

Masters Computer Science Stanford University

Similar Degrees You Can Earn

Best Online Master's in Computer Science

Why Is Saket Suman Saurabh Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Saket Suman Saurabh's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Parameterized Algorithms (2015) (1302)
Lower bounds based on the Exponential Time Hypothesis (2011) (351)
(Meta) Kernelization (2009) (297)
On Problems as Hard as CNF-SAT (2011) (200)
Faster Parameterized Algorithms Using Linear Programming (2012) (191)
Bidimensionality and kernels (2010) (188)
Known algorithms on graphs of bounded treewidth are probably optimal (2010) (182)
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms (2016) (175)
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms (2012) (172)
Incompressibility through Colors and IDs (2009) (169)
Kernelization: Theory of Parameterized Preprocessing (2019) (153)
Kernelization Lower Bounds Through Colors and IDs (2014) (138)
Kernel(s) for problems with no kernel: On out-trees with many leaves (2008) (135)
Slightly superexponential parameterized problems (2011) (131)
On the Complexity of Some Colorful Problems Parameterized by Treewidth (2007) (128)
Graph Layout Problems Parameterized by Vertex Cover (2008) (124)
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles (2008) (112)
Faster fixed parameter tractable algorithms for finding feedback vertex sets (2006) (104)
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms (2013) (97)
On Two Techniques of Combining Branching and Treewidth (2009) (95)
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number (2007) (92)
Kernels for feedback arc set in tournaments (2009) (89)
Bidimensionality and EPTAS (2010) (87)
Parameterized algorithms for feedback set problems and their duals in tournaments (2006) (84)
Kernelization - Preprocessing with a Guarantee (2012) (84)
A linear vertex kernel for maximum internal spanning tree (2009) (82)
Capacitated Domination and Covering: A Parameterized Perspective (2008) (78)
Lower bounds on kernelization (2011) (77)
Hitting Forbidden Minors: Approximation and Kernelization (2010) (77)
Intractability of Clique-Width Parameterizations (2010) (73)
Lossy kernelization (2016) (72)
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (2015) (72)
Faster algorithms for finding and counting subgraphs (2009) (69)
Bidimensionality and geometric graphs (2011) (67)
A linear kernel for planar connected dominating set (2011) (66)
Counting Subgraphs via Homomorphisms (2009) (64)
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (2014) (62)
On Parameterized Independent Feedback Vertex Set (2011) (62)
Local Search: Is Brute-Force Avoidable? (2009) (60)
Kernelization and Sparseness: the case of Dominating Set (2014) (55)
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques (2007) (53)
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set (2002) (52)
Minimum bisection is fixed parameter tractable (2013) (51)
A Near-Optimal Planarization Algorithm (2014) (51)
Iterative compression and exact algorithms (2008) (51)
Deterministic Truncation of Linear Matroids (2014) (49)
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (2014) (48)
Quickstep: A Data Platform Based on the Scaling-Up Approach (2018) (48)
LP can be a cure for Parameterized Problems (2012) (47)
Simpler Parameterized Algorithm for OCT (2009) (46)
Clique-width: on the price of generality (2009) (46)
Algorithmic lower bounds for problems parameterized by clique-width (2010) (46)
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem (2009) (46)
Spanning Directed Trees with Many Leaves (2008) (46)
FPT algorithms for Connected Feedback Vertex Set (2009) (46)
Subexponential algorithms for partial cover problems (2011) (45)
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover (2011) (45)
Exact algorithms via monotone local search (2015) (43)
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes (2018) (43)
Representative Families of Product Families (2017) (43)
Uniform Kernelization Complexity of Hitting Forbidden Minors (2015) (42)
Representative Sets of Product Families (2014) (42)
Paths, Flowers and Vertex Cover (2011) (42)
Linear kernels for (connected) dominating set on H-minor-free graphs (2012) (42)
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization (2013) (41)
Reconfiguration on Sparse Graphs (2015) (41)
Sharp Separation and Applications to Exact and Parameterized Algorithms (2010) (40)
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs (2010) (38)
FO Model Checking on Posets of Bounded Width (2015) (37)
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal (2017) (37)
Degree-Constrained Subgraph Problems: Hardness and Approximation Results (2009) (36)
A Polynomial Kernel for Proper Interval Vertex Deletion (2012) (35)
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments (2011) (35)
Lower bounds for approximation schemes for Closest String (2015) (34)
Tight Bounds for Linkages in Planar Graphs (2011) (34)
Parameterized Algorithms for Directed Maximum Leaf Problems (2007) (33)
On Problems as Hard as CNFSAT (2011) (33)
On the Hardness of Losing Width (2011) (33)
Hitting and Harvesting Pumpkins (2011) (32)
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs (2012) (31)
Algorithmic Aspects of Dominator Colorings in Graphs (2011) (31)
Popular Matching in Roommates Setting Is NP-hard (2018) (29)
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (2012) (28)
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds (2012) (28)
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion (2017) (28)
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (2013) (28)
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (2016) (28)
Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG (2007) (27)
Parameterized algorithm for eternal vertex cover (2010) (27)
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) (2012) (27)
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (2015) (26)
On the approximability of some degree-constrained subgraph problems (2012) (25)
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments (2010) (24)
Parameterized Algorithms to Preserve Connectivity (2014) (24)
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs (2012) (23)
Improved Exact Algorithms for Counting 3- and 4-Colorings (2007) (23)
Strengthening Erdös–Pósa property for minor‐closed graph classes (2011) (23)
On Cutwidth Parameterized by Vertex Cover (2011) (23)
Approximation Schemes for Low-rank Binary Matrix Approximation Problems (2018) (23)
Better Algorithms and Bounds for Directed Maximum Leaf Problems (2007) (23)
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems (2019) (23)
Don't Be Strict in Local Search! (2012) (22)
Parameterized complexity of MaxSat Above Average (2011) (22)
Implicit branching and parameterized partial cover problems (2011) (22)
Looking Ahead Makes Query Plans Robust (2017) (21)
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (2013) (21)
Distortion is Fixed Parameter Tractable (2009) (21)
Randomized Contractions Meet Lean Decompositions (2018) (21)
Branching and Treewidth Based Exact Algorithms (2006) (21)
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs (2017) (20)
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems (2006) (20)
Hardness of r-dominating set on Graphs of Diameter (r + 1) (2013) (20)
Parameterized Algorithms for Even Cycle Transversal (2012) (19)
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems (2020) (19)
Solving d-SAT via Backdoors to Small Treewidth (2015) (18)
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (2007) (18)
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth (2018) (18)
Reducing CMSO Model Checking to Highly Connected Graphs (2018) (18)
Parameterized Algorithms for Generalized Domination (2008) (18)
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices (2018) (17)
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion (2015) (17)
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (2008) (17)
A Parameterized Approximation Scheme for Min $k$-Cut (2020) (17)
Irrelevant vertices for the planar Disjoint Paths Problem (2013) (17)
Hitting topological minors is FPT (2019) (16)
Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles (2013) (16)
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set (2016) (16)
Long directed (s, t)-path: FPT algorithm (2018) (16)
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation (2013) (16)
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (2014) (16)
Exact Algorithms for Terrain Guarding (2018) (16)
The Parameterized Complexity of Unique Coverage and Its Variants (2013) (16)
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems (2005) (16)
Even Faster Algorithm for Set Splitting! (2009) (16)
Parameterized Study of the Test Cover Problem (2012) (16)
Planar F-Deletion: Approximation and Optimal FPT Algorithms (2012) (15)
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (2020) (15)
Partially Polynomial Kernels for Set Cover and Test Cover (2016) (15)
Parameterized algorithms for stable matching with ties and incomplete lists (2018) (15)
Ranking and Drawing in Subexponential Time (2010) (15)
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound (2012) (15)
Simultaneous Feedback Vertex Set: A Parameterized Perspective (2015) (15)
Backdoors to q-Horn (2014) (15)
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (2018) (14)
Faster algorithms for feedback vertex set (2005) (14)
Computing Optimal Steiner Trees in Polynomial Space (2013) (14)
Bandwidth on AT-Free Graphs (2009) (14)
Interval Vertex Deletion Admits a Polynomial Kernel (2019) (14)
Unique Covering Problems with Geometric Sets (2015) (14)
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators (2018) (14)
Parameterized complexity of finding small degree-constrained subgraphs (2012) (13)
Kernels for deletion to classes of acyclic digraphs (2018) (13)
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators (2015) (13)
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set (2017) (13)
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound (2013) (13)
Parameterized Algorithms for Boxicity (2010) (13)
Triangles, 4-Cycles and Parameterized (In-)Tractability (2006) (13)
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers (2018) (12)
Finding Even Subgraphs Even Faster (2014) (12)
Parameterized and Exact Algorithms for Class Domination Coloring (2021) (12)
Balanced Stable Marriage: How Close is Close Enough? (2017) (12)
Linear Kernel for Planar Connected Dominating Set (2009) (12)
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs (2015) (12)
On Treewidth and Stable Marriage (2017) (12)
Packing Cycles Faster Than Erdos-Posa (2017) (12)
Exact Algorithms via Monotone Local Search (2019) (12)
An exact algorithm for minimum distortion embedding (2009) (12)
Going Far From Degeneracy (2019) (11)
Faster Exact Algorithms for Some Terminal Set Problems (2013) (11)
A Polynomial Sized Kernel for Tracking Paths Problem (2018) (11)
Diverse Collections in Matroids and Graphs (2021) (11)
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs (2021) (11)
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors (2018) (11)
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (2015) (11)
The Curse of Connectivity: t-Total Vertex (Edge) Cover (2010) (11)
Exact Algorithms for Optimization and parameterized versions of some graph theoretic problems[HBNI Th 6] (2008) (11)
On the parameterized complexity of vertex cover and edge cover with connectivity constraints (2015) (10)
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs (2015) (10)
König Deletion Sets and Vertex Covers above the Matching Size (2008) (10)
Split Contraction: The Untold Story (2017) (10)
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms (2017) (10)
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments (2016) (10)
2-Approximating Feedback Vertex Set in Tournaments (2020) (10)
Imbalance is fixed parameter tractable (2010) (10)
Determining the Winner of a Dodgson Election is Hard (2010) (10)
Bivariate complexity analysis of Almost Forest Deletion (2015) (10)
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (2013) (10)
Packing Arc-Disjoint Cycles in Tournaments (2019) (9)
Graph Modification Problems: A Modern Perspective (2015) (9)
The Budgeted Unique Coverage Problem and Color-Coding (2009) (9)
Processing of alumina ceramics by abrasive waterjet- an experimental study (2018) (9)
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees (2008) (9)
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing (2010) (9)
Group Activity Selection on Graphs: Parameterized Analysis (2017) (9)
Editing to Connected f-Degree Graph (2019) (9)
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles (2014) (9)
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (2008) (9)
When Rigging a Tournament, Let Greediness Blind You (2018) (9)
The Parameterized Complexity of Guarding Almost Convex Polygons (2020) (9)
On the Parameterized Complexity of Contraction to Generalization of Trees (2017) (9)
Quick but Odd Growth of Cacti (2017) (9)
Matrix Rigidity from the Viewpoint of Parameterized Complexity (2018) (9)
Hitting Selected (Odd) Cycles (2017) (8)
A Polynomial Kernel for Paw-Free Editing (2019) (8)
Parameterized Approximations via d-Skew-Symmetric Multicut (2014) (8)
An exponential time parameterized algorithm for planar disjoint paths (2020) (8)
Parameterization Above a Multiplicative Guarantee (2020) (8)
Multivariate Complexity Analysis of Geometric Red Blue Set Cover (2015) (8)
Planar k-Path in Subexponential Time and Polynomial Space (2011) (8)
Parameterized Complexity of Multi-Node Hubs (2019) (8)
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion (2020) (7)
On the optimality of pseudo-polynomial algorithms for integer programming (2016) (7)
A Linear Time Parameterized Algorithm for Node Unique Label Cover (2016) (7)
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity (2019) (7)
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? (2013) (7)
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable (2018) (7)
Clique-width III (2018) (7)
(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel (2016) (7)
Below all subsets for Minimal Connected Dominating Set (2016) (7)
On the Kernelization Complexity of String Problems (2018) (7)
Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems (2014) (7)
Selection of Cloud Service Providers for Hosting Web Applications in a Multi-cloud Environment (2020) (7)
Balanced Judicious Bipartition is Fixed-Parameter Tractable (2017) (6)
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs (2016) (6)
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding (2019) (6)
Parameterized Algorithms for Survivable Network Design with Uniform Demands (2018) (6)
Reducing rank of the adjacency matrix by graph modification (2015) (6)
Paths to Trees and Cacti (2017) (6)
Approximate Counting of k-Paths: Deterministic and in Polynomial Space (2019) (6)
On the (Parameterized) Complexity of Almost Stable Marriage (2020) (6)
Path Contraction Faster Than 2n (2019) (6)
Computation of Hadwiger Number and Related Contraction Problems (2020) (6)
On the Directed Degree-Preserving Spanning Tree Problem (2009) (6)
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs (2020) (6)
Fixed-parameter tractable algorithms for Tracking Shortest Paths (2020) (6)
A Parameterized Algorithm for Mixed-Cut (2015) (6)
Kernelization Methods for Fixed-Parameter Tractability (2014) (6)
Fully Dynamic Arboricity Maintenance (2019) (6)
Spanning Circuits in Regular Matroids (2016) (6)
Gerrymandering on graphs: Computational complexity and parameterized algorithms (2021) (6)
Distortion is Fixed Parameter Tractable (2013) (5)
Kernelization of Cycle Packing with Relaxed Disjointness Constraints (2018) (5)
Winning a Tournament by Any Means Necessary (2018) (5)
Parameterized Complexity of Conflict-Free Matchings and Paths (2020) (5)
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity (2018) (5)
On the Approximate Compressibility of Connected Vertex Cover (2019) (5)
Parameterized Complexity of Directed Feedback Set Problems in Tournaments (2003) (5)
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs (2020) (5)
Parameterised Algorithms for Deletion to Classes of DAGs (2018) (5)
On the parameterized complexity of b-chromatic number (2017) (5)
Decomposition of Map Graphs with Applications (2019) (5)
The effect of girth on the kernelization complexity of Connected Dominating Set (2010) (5)
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments (2018) (5)
Parameterized Complexity of Geometric Covering Problems Having Conflicts (2017) (5)
Rank Reduction of Directed Graphs by Vertex and Edge Deletions (2016) (5)
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) (2008) (5)
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS (2019) (5)
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank (2020) (5)
On the Parameterized Complexity of Deletion to H-free Strong Components (2020) (4)
On Succinct Encodings for the Tournament Fixing Problem (2019) (4)
A divide and conquer approach for web services location allocation problem (2021) (4)
Parameterized Algorithms and Kernels for Rainbow Matching (2018) (4)
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem (2018) (4)
B-Chromatic Number: Beyond NP-Hardness (2015) (4)
Covering vectors by spaces: Regular matroids (2017) (4)
An FPT algorithm for Tree Deletion Set (2013) (4)
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy (2018) (4)
Split Contraction (2019) (4)
Detours in Directed Graphs (2022) (4)
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (2017) (4)
On the directed Full Degree Spanning Tree problem (2011) (4)
Optimization Method for Unit Commitment in High-Level Wind Generation and Solar Power (2018) (4)
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent (2021) (4)
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables (2012) (4)
The Half-integral Erdös-Pósa Property for Non-null Cycles (2017) (4)
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space (2021) (4)
Path Contraction Faster Than 2 (2019) (4)
Fine-grained complexity of integer programming: The case of bounded branch-width and rank (2016) (4)
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments (2004) (4)
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements (2017) (4)
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings (2010) (4)
A Brief Note on Single Source Fault Tolerant Reachability (2019) (3)
On the Parameterized Complexity of Maximum Degree Contraction Problem (2022) (3)
Parameterized Streaming Algorithms for Min-Ones d-SAT (2019) (3)
FPT-approximation for FPT Problems (2021) (3)
Fault Tolerant Subgraphs with Applications in Kernelization (2020) (3)
Approximation in (Poly-) Logarithmic Space (2020) (3)
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor (2022) (3)
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs (2021) (3)
Matroids in Parameterized Complexity and Exact Algorithms (2016) (3)
Gehrlein stability in committee selection: parameterized hardness and algorithms (2019) (3)
GA Based Optimal STATCOM Placement for Improvement of Voltage Stability (2020) (3)
Simultaneous Feedback Edge Set: A Parameterized Perspective (2016) (3)
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems (2017) (3)
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments (2018) (3)
Well-Structured Committees (2020) (3)
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules (2021) (3)
FPT algorithms for Connected Feedback Vertex Set (2011) (3)
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems (2022) (3)
Subset Feedback Vertex Set in Chordal and Split Graphs (2019) (3)
Parameterized Computational Geometry via Decomposition Theorems (2019) (3)
Strong Connectivity Augmentation is FPT (2021) (3)
Connecting the Dots (with Minimum Crossings) (2019) (3)
Exploring the Kernelization Borders for Hitting Cycles (2018) (3)
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree (2019) (3)
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (2018) (3)
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (2020) (3)
On the Parameterized Complexity of Grid Contraction (2020) (3)
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions (2018) (2)
Solving Multicut Faster Than 2 n (2014) (2)
Parameterized Complexity of Maximum Edge Colorable Subgraph (2020) (2)
On the Complexity of Mixed Dominating Set (2019) (2)
A Polynomial Kernel for Bipartite Permutation Vertex Deletion (2022) (2)
Packing Arc-Disjoint Cycles in Tournaments (2021) (2)
Parameterized Complexity of Conflict-Free Matchings and Paths (2020) (2)
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams (2019) (2)
On the Hardness of Losing Width (2013) (2)
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane (2020) (2)
On Problems as Hard as CNF-SATx (2012) (2)
Advanced kernelization algorithms (2015) (2)
Sustaining the economy under partial lockdown: A pandemic centric approach (2020) (2)
Elimination Distance to Topological-minor-free Graphs is FPT (2021) (2)
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract) (2022) (2)
Clustering What Matters: Optimal Approximation for Clustering with Outliers (2022) (2)
Multivariate Complexity Analysis of Geometric Red Blue Set Cover (2016) (2)
Improving the gap of Erdös-Pósa property for minor-closed graph classes (2008) (2)
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals (2019) (2)
Parameterized complexity of Strip Packing and Minimum Volume Packing (2017) (2)
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting (2012) (2)
On finding highly connected spanning subgraphs (2017) (2)
Algebraic techniques: sieves, convolutions, and polynomials (2015) (2)
Rank Vertex Cover as a Natural Problem for Algebraic Compression (2017) (2)
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs (2019) (2)
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (2018) (1)
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective (2022) (1)
Kernelizing Buttons and Scissors (2016) (1)
Hitting and Covering Partially (2018) (1)
On the Parameterized Complexity of Edge-Linked Paths (2019) (1)
Parameterized Complexity of Red Blue Set Cover for Lines (2016) (1)
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue (2018) (1)
Approximation Algorithms for Minimum Chain Vertex Deletion (2011) (1)
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (2020) (1)
Resolute control: Forbidding candidates from winning an election is hard (2022) (1)
Exploiting Dense Structures in Parameterized Complexity (2021) (1)
Stability in barter exchange markets (2018) (1)
On the Parameterized Complexity of Deletion to $\mathcal{H}$-free Strong Components (2020) (1)
DC-OPF for LMP Calculation in Wholesale Electricity Market (2014) (1)
Erdős–Pósa property of obstructions to interval graphs (2018) (1)
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii (2023) (1)
KERNEL(S) FOR PROBLEMS WITH NO KERNEL: ON O UT-TREES WITH MANY LEAVES (EXTENDED ABSTRACT) (2009) (1)
Parameterized and Exact Computation (2011) (1)
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound (2013) (1)
Parameterized Complexity of Fair Feedback Vertex Set Problem (2020) (1)
On approximability of optimization problems related to Red/Blue-split graphs (2017) (1)
Quick Separation in Chordal and Split Graphs (2020) (1)
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators (2018) (1)
Solving Group Interval Scheduling Efficiently (2019) (1)
A Framework for Approximation Schemes on Disk Graphs (2022) (1)
Communication Complexity of Pairs of Graph Families with Applications (2017) (1)
Subexponential Parameterized Algorithms on Disk Graphs (2021) (1)
k-Distinct Branchings Admits a Polynomial Kernel (2021) (1)
Subset Feedback Vertex Set in Chordal and Split Graphs (2019) (1)
Exact and Approximate Digraph Bandwidth (2019) (1)
Improved FPT Algorithms for Deletion to Forest-like Structures (2020) (1)
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs (2020) (1)
Parameterized Complexity of Graph Partitioning into Connected Clusters (2022) (1)
On Integer Programming and the Path-width of the Constraint Matrix (2016) (1)
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (2018) (1)
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS (2018) (1)
Parameterized Complexity of Directed Spanner Problems (2021) (1)
Sharp Separation and Applications to Exact and Parameterized Algorithms (2011) (1)
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) (2019) (1)
Smart Irrigation Monitoring System (2019) (1)
The parameterized complexity landscape of finding 2-partitions of digraphs (2019) (1)
Kernel: Lower and Upper Bounds (2009) (1)
ESTIMATION OF ERROR IN DEFLECTION OF A SIMPLY SUPPORTED BEAM (2013) (1)
An Exact Algorithm for Knot-Free Vertex Deletion (2022) (1)
Multiplicative Parameterization Above a Guarantee (2021) (1)
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments (2013) (1)
Parameterized Algorithms for Partial Cover Problems (2008) (1)
Finding cuts and separators (2015) (1)
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version) (2021) (1)
Randomized Methods in Parameterized Algorithms (2015) (1)
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs (2022) (1)
Parameterized Complexity of Superstring Problems (2015) (1)
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs (2022) (0)
Gehrlein stability in committee selection: parameterized hardness and algorithms (2020) (0)
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms (2021) (0)
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs (2023) (0)
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin (2018) (0)
0 Linear Time Parameterized Algorithms for S UBSET F EEDBACK V (2017) (0)
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (2015) (0)
71 : 2 Packing Cycles Faster Than (2017) (0)
Faster Graph bipartization (2020) (0)
Almost optimal query algorithm for hitting set using a subset query (2023) (0)
BELOW ALL SUBSETS FOR MINIMAL CONNECTED (2018) (0)
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation (2022) (0)
Theory research in India (2022) (0)
Structural Parameterization for Graph Deletion Problems over Data Streams (2019) (0)
On Cutwidth Parameterized by Vertex Cover (2012) (0)
(k,n-k)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(k,n-k)$$\end{document}-Max-Cut: An O∗(2p)\documentclass[12pt]{ (2018) (0)
Parameterized Algorithms for Locally Minimal Defensive Alliance (2022) (0)
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets (2022) (0)
Editor’s Note: Special Issue on Combinatorial Pattern Matching (2017) (0)
EVALUATION OF LOWER GASTROINTESTINAL BLEEDING WITH SPECIAL REFERENCE TO COLONOSCOPY (2019) (0)
An ETH-tight Algorithm for Multi-Team 1 Formation 2 (2021) (0)
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles (2012) (0)
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut (2018) (0)
Circumventing Connectivity for Kernelization (2021) (0)
A On Problems as Hard as CNF-SAT 1 (2015) (0)
NACA2412 airfoil based method for design and aerodynamic analysis of small HAWT using modified BEM approach (2023) (0)
Exact Multi-Covering Problems with Geometric Sets (2021) (0)
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue (2018) (0)
Communication Complexity and Graph Families (2019) (0)
Exact Multi-Covering Problems with Geometric Sets (2021) (0)
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (2022) (0)
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II (2013) (0)
Computing Optimal Steiner Trees in Polynomial Space (2012) (0)
2 Strong Parameterized Deletion : Bipartite Graphs (2016) (0)
Fixed-parameter intractability (2015) (0)
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree (2019) (0)
COMPARATIVE STUDY BETWEEN CT SCAN AND AUTOPSY FINDINGS IN TRAUMATIC BRAIN INJURY WITH SPECIAL REFERENCE TO DAI (2019) (0)
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set (2020) (0)
Parameterized Dichotomy of Deletion to List Matrix-Partition for low-order Matrices (2019) (0)
Output Sensitive Fault Tolerant Maximum Matching (2022) (0)
Connecting Vertices by Independent Trees (2014) (0)
Parameterized Algorithms for List K-Cycle (2018) (0)
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables (2012) (0)
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles (2022) (0)
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin (2018) (0)
On the Parameterized Complexity of Contraction to Generalization of Trees (2018) (0)
INTRODUCTION (2017) (0)
List Homomorphism: Beyond the Known Boundaries (2022) (0)
Parameterized Complexity of Neighborhood Problems in Graphs with no Small Cycles (2006) (0)
A Polynomial Sized Kernel for Tracking Paths Problem (2019) (0)
A Polynomial Kernel for Deletion to Ptolemaic Graphs (2021) (0)
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers (2016) (0)
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs (2015) (0)
On the Complexity of Singly Connected Vertex Deletion (2020) (0)
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II (2013) (0)
Quadratic Vertex Kernel for Rainbow Matching (2019) (0)
Approximation algorithms for geometric conflict free covering problems (2020) (0)
LIPICs, Volume 65, FSTTCS'16, Complete Volume (2016) (0)
PETA: Privacy Enabled Task Allocation (2020) (0)
Simultaneous Feedback Edge Set: A Parameterized Perspective (2020) (0)
Reducing Topological Minor Containment to the Unique Linkage Theorem (2019) (0)
Parameterized Complexity of Superstring Problems (2016) (0)
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space (2021) (0)
Optimal Output Sensitive Fault Tolerant Cuts (2020) (0)
Title : Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree Year : 2015 Version : Post print (2016) (0)
D S ] 8 F eb 2 00 7 Parameterized Algorithms for Directed Maximum Leaf Problems ( Extended Abstract ) (2007) (0)
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments (2015) (0)
Improving dynamic programming on tree decompositions (2015) (0)
On the Approximate Compressibility of Connected Vertex Cover (2020) (0)
Parameterised Algorithms for Deletion to Classes of DAGs (2018) (0)
Space-Efficient FPT Algorithms (2021) (0)
An Erdős-Pósa Theorem on Neighborhoods and Domination Number (2019) (0)
Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp> (2018) (0)
$$(k,n-k)$$(k,n-k)-Max-Cut: An $$\mathcal{O}^*(2^p)$$O∗(2p)-Time Algorithm and a Polynomial Kernel (2018) (0)
Quadratic Vertex Kernel for Rainbow Matching (2019) (0)
Balanced Substructures in Bicolored Graphs (2023) (0)
Balanced Judicious Bipartition is FPT (2017) (0)
Report on "Visions, requirements and needs for Future Research Environments: An Exploration Series with Researchers" (2020) (0)
Parameterized Complexity of Geometric Covering Problems Having Conflicts (2019) (0)
Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, gargano, Italy, 13-15 May, 2008 (2008) (0)
OESTROGEN, PROGESTERONE & HER2/NEU RECEPTOR STATUS IN PATIENTS WITH BREAST CARCINOMA WITH SPECIAL REFERENCE TO TRIPLE NEGATIVE STATUS IN A TERTIARY CARE HOSPITAL IN SOUTHERN ODISHA (2019) (0)
Packing Cycles Faster Than Erd\H{o}s-P\'osa (2017) (0)
Parameterized Algorithms and Kernels for Rainbow Matching (2018) (0)
An ETH-Tight Algorithm for Multi-Team Formation (2021) (0)
Parameterized Analysis for the Group Activity Selection Problem on Graphs (2022) (0)
T C C C L     E T H (2011) (0)
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I (2012) (0)
Using Combinatorics to Prune Search Trees: Independent and Dominating Set (2006) (0)
Gehrlein Stable Committee with Multi-modal Preferences (2022) (0)
KERNELIZATION OF CYCLE PACKING WITH RELAXED (2018) (0)
Kernel Lower Bounds on String Problems (2013) (0)
Partitioning Subclasses of Chordal Graphs with Few Deletions (2023) (0)
Fixed-Parameter Algorithms and Complexity (2015) (0)
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage (2023) (0)
A characterization of König-Egerváry graphs with extendable vertex covers (2020) (0)
Parameterized algorithms for Eccentricity Shortest Path Problem (2023) (0)
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices (2019) (0)
35 : 2 Parameterized Complexity of Conflict-Free Matchings and Paths 1 (2019) (0)
Exact Exponential Algorithms for Clustering Problems (2022) (0)
Parameterized Algorithms for Finding Highly Connected Solution (2022) (0)
The Parameterized Complexity of Unique Coverage and Its Variants (2011) (0)
Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis (2018) (0)
Stability in barter exchange markets (2019) (0)
Odd Cycle Transversal in Mixed Graphs (2021) (0)
An Improved Exact Algorithm for Knot-Free Vertex Deletion (2023) (0)
Readings through the texts of Rigoberta Menchú and Dayamani Barla (2017) (0)
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (2022) (0)
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions (2017) (0)
Bounded Search Trees (2015) (0)
Parameterized Complexity News 2 Johan Kwisthout TOP grant (2017) (0)
Quick but Odd Growth of Cacti (2017) (0)
Highly unbreakable graph with a fixed excluded minor are almost rigid (2022) (0)
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem (2020) (0)
Backdoors to q-Horn (2014) (0)
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs (2020) (0)
Polynomial Kernel for Interval Vertex Deletion (2023) (0)
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I (2011) (0)
Path Contraction Faster than 2 n ∗ 1 (2019) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Saket Suman Saurabh?

Saket Suman Saurabh is affiliated with the following schools:

Saket Suman Saurabh's Academic­Influence.com Rankings