Saket Saurabh

Parameterized Algorithms

2015

Lower Bounds Based on the Exponential-Time Hypothesis

2015

Incompressibility through Colors and IDs

2009

Faster Parameterized Algorithms Using Linear Programming

2014

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms

2016

Graph Layout Problems Parameterized by Vertex Cover

2008

Kernelization Lower Bounds Through Colors and IDs

2014

On the complexity of some colorful problems parameterized by treewidth

2010

On Problems as Hard as CNF-SAT

2016

Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles

2008

(Meta) Kernelization

2016

On Two Techniques of Combining Branching and Treewidth

2007

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

2009

Hitting Forbidden Minors: Approximation and Kernelization

2016

Faster fixed parameter tractable algorithms for finding feedback vertex sets

2006

Parameterized algorithms for feedback set problems and their duals in tournaments

2005

Bidimensionality and Kernels

2010

On Problems as Hard as CNF-SAT

2012

Fast FAST

2009

Kernel(s) for problems with no kernel

2012

Kernels for feedback arc set in tournaments

2010

A linear vertex kernel for maximum internal spanning tree

2012

Kernelization

2018

Intractability of Clique-Width Parameterizations

2010

Capacitated Domination and Covering: A Parameterized Perspective

2008

Kernelization – Preprocessing with a Guarantee

2012

Lower bounds on kernelization

2010

On Parameterized Independent Feedback Vertex Set

2012

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

2009

Faster algorithms for finding and counting subgraphs

2011

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

2007

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

2018

Slightly Superexponential Parameterized Problems

2018

Local search: Is brute-force avoidable?

2011

A Linear Kernel for Planar Connected Dominating Set

2010

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

2011

Lossy kernelization

2017

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes

2018

Looking ahead makes query plans robust

2017

Representative Families of Product Families

2017

Partially Polynomial Kernels for Set Cover and Test Cover

2016

Spanning Directed Trees with Many Leaves

2009

Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set

2002

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

2018

LP can be a cure for Parameterized Problems

2012

Subexponential algorithms for partial cover problems

2011

FPT algorithms for Connected Feedback Vertex Set

2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

2010

Simpler Parameterized Algorithm for OCT

2009

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

2014

Sharp Separation and Applications to Exact and Parameterized Algorithms

2011

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization

2013

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem

2009

Algorithmic Aspects of Dominator Colorings in Graphs

2011

Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds

2012

Slightly Superexponential Parameterized Problems

2011

Paths, Flowers and Vertex Cover

2011

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

2017

A Polynomial Kernel for Proper Interval Vertex Deletion

2013

Iterative Compression and Exact Algorithms

2008

A Near-Optimal Planarization Algorithm

2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

2013

Tight Bounds for Linkages in Planar Graphs

2011

Linear Kernels for (Connected) Dominating Set on H-minor-free graphs

2012

Bidimensionality and Geometric Graphs

2012

Reconfiguration on sparse graphs

2018

Parameterized algorithm for eternal vertex cover

2010

Counting Subgraphs via Homomorphisms

2012

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

2009

Counting Subgraphs via Homomorphisms

2009

Implicit branching and parameterized partial cover problems

2010

Iterative compression and exact algorithms

2009

Parameterized Algorithms

2020

Uniform Kernelization Complexity of Hitting Forbidden Minors

2017

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments

2010

Minimum bisection is fixed parameter tractable

2014

Parameterized Algorithms to Preserve Connectivity

2014

Parameterized algorithms for stable matching with ties and incomplete lists

2018

Local search: is brute-force avoidable?

2009

Clique-width: On the Price of Generality

2009

On the approximability of some degree-constrained subgraph problems

2012

On the Complexity of Some Colorful Problems Parameterized by Treewidth

2007

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs

2013

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization

2014

Subexponential Parameterized Odd Cycle Transversal on Planar Graphs

2012

Linear Kernel for Planar Connected Dominating Set

2009

Selection of Cloud Service Providers for Hosting Web Applications in a Multi-cloud Environment

2020

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

2018

Quickstep

2018

Algorithmic lower bounds for problems parameterized by clique-width

2010

Improved Exact Algorithms for Counting 3- and 4-Colorings

2007

Hardness of r-dominating set on Graphs of Diameter (r + 1)

2013

Parameterized Algorithms for Generalized Domination

2008

Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG

2007

Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems

2006

Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems

2019

Minimum Bisection Is Fixed-Parameter Tractable

2019

Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp>

2018

Lower bounds for kernelization

2015

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges

2013

Parameterized Algorithms for Even Cycle Transversal

2012

Branching and Treewidth Based Exact Algorithms

2006

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs

2013

Faster Parameterized Algorithms using Linear Programming

2012

(Meta) Kernelization

2009

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems

2005

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors

2018

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set

2017

Strengthening Erdös-Pósa property for minor-closed graph classes

2010

Exact Algorithms for Terrain Guarding

2018

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

2017

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set

2015

Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)

2012

Even Faster Algorithm for Set Splitting!

2009

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs

2021

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion

2016

Lower bounds for approximation schemes for Closest String

2015

Kernelization and Sparseness: the Case of Dominating Set

2014

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound

2014

On the Hardness of Losing Width

2013

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem

2008

Popular Matching in Roommates Setting is NP-hard

2019

Clique-width III

2018

Processing of alumina ceramics by abrasive waterjet- an experimental study

2018

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices

2018

Faster exact algorithms for some terminal set problems

2017

Fully polynomial-time parameterized computations for graphs and matrices of low treewidth

2017

On the Hardness of Losing Width

2012

Parameterized complexity of finding small degree-constrained subgraphs

2011

Ranking and Drawing in Subexponential Time

2011

Parameterized Algorithms for Boxicity

2010

Distortion Is Fixed Parameter Tractable

2009

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

2007

An exponential time parameterized algorithm for planar disjoint paths

2020

Long directed (s,t)-path: FPT algorithm

2018

Hitting Selected (Odd) Cycles

2017

Parameterized Complexity of MaxSat above Average

2012

The Parameterized Complexity of Unique Coverage and Its Variants

2011

FPT Algorithms for Connected Feedback Vertex Set

2010

Don't Be Strict in Local Search!

2021

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth

2018

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments

2015

Faster algorithms for feedback vertex set

2005

A Polynomial Sized Kernel for Tracking Paths Problem

2019

Simultaneous Feedback Vertex Set

2018

When Rigging a Tournament, Let Greediness Blind You

2018

Distortion is Fixed Parameter Tractable

2013

On Cutwidth Parameterized by Vertex Cover

2012

An exact algorithm for minimum distortion embedding

2011

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

2022

Kernels for deletion to classes of acyclic digraphs

2017

Introduction

2015

Backdoors to q-Horn

2013

Bandwidth on AT-free graphs

2011

Triangles, 4-Cycles and Parameterized (In-)Tractability

2006

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems

2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts

Algorithmica · 2020 · journal article

Winning a Tournament by Any Means Necessary

2018

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators

2018

Bivariate complexity analysis of Almost Forest Deletion

2017

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems

2016

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel

2015

Unique Covering Problems with Geometric Sets

2015

On the parameterized complexity of vertex cover and edge cover with connectivity constraints

2014

Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

2014

Computing Optimal Steiner Trees in Polynomial Space

2012

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

2010

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree

2008

König Deletion Sets and Vertex Covers above the Matching Size

2008

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)

2022

Bidimensionality and Kernels

2020

A Polynomial Kernel for Paw-Free Editing

2019

Finding even subgraphs even faster

2018

Parameterized and Exact Algorithms for Class Domination Coloring

2017

A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set

2016

Graph Modification Problems: A Modern Perspective

2015

Fixed-parameter intractability

2015

Kernelization Methods for Fixed-Parameter Tractability

2014

Planar F-Deletion: Approximation and Optimal FPT Algorithms

2012

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem

2010

Exact Algorithms for Optimization and parameterized versions of some graph theoretic problems[HBNI Th 6]

2008

Multiplicative Parameterization Above a Guarantee

2021

On the Approximate Compressibility of Connected Vertex Cover

2020

Interval vertex deletion admits a polynomial kernel

2019

On the Parameterized Complexity of Contraction to Generalization of Trees

2018

On the kernelization complexity of string problems

2018

Polylogarithmic approximation algorithms for weighted-F-Deletion problems

2018

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk\n Graphs

2017

Uniform Kernelization Complexity of Hitting Forbidden Minors

2015

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs

2015

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators

2015

Imbalance is fixed parameter tractable

2013

Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles

2013

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles

2012

Linear Kernels for (Connected) Dominating Set on <i>H</i>-minor-free graphs

2012

Determining the Winner of a Dodgson Election is Hard

2010

The Budgeted Unique Coverage Problem and Color-Coding

2009

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent

2022

Approximate Counting of <i>k</i> -Paths: Simpler, Deterministic, and in Polynomial Space

2021

Well-Structured Committees

2020

Subexponential algorithm for d-cluster edge deletion: Exception or rule?

2020

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

2019

On Succinct Encodings for the Tournament Fixing Problem

2019

Split Contraction

2019

Below All Subsets for Minimal Connected Dominating Set

2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands

2018

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel

2018

On Treewidth and Stable Marriage

2017

Quick but Odd Growth of Cacti

2017

Group Activity Selection on Graphs: Parameterized Analysis

2017

Multivariate Complexity Analysis of Geometric Red Blue Set Cover

2016

Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation)

2016

Faster Exact Algorithms for Some Terminal Set Problems

2013

Partially Polynomial Kernels for Set Cover and Test Cover

2013

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound

2013

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs

2013

Planar k-Path in Subexponential Time and Polynomial Space

2011

Parameterized and Exact Computation

2010

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees

2008

A divide and conquer approach for web services location allocation problem

2021

Packing Arc-Disjoint Cycles in Tournaments

2021

FPT-approximation for FPT Problems

2021

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems

2020

2-Approximating Feedback Vertex Set in Tournaments

2019

Balanced Stable Marriage: How Close Is Close Enough?

2019

Subquadratic Kernels for Implicit 3-H<scp>itting</scp> S<scp>et</scp> and 3-S<scp>et</scp> P<scp>acking</scp> Problems

2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity

2018

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts

2017

On the parameterized complexity of b-chromatic number

2016

Backdoors to q-Horn

2014

Parameterized complexity of MaxSat Above Average

2013

The Curse of Connectivity: t-Total Vertex (Edge) Cover

2010

On the Directed Degree-Preserving Spanning Tree Problem

2009

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)

2008

Clustering What Matters: Optimal Approximation for Clustering with Outliers

2023

Detours in directed graphs

2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage

2023

Resolute control: Forbidding candidates from winning an election is hard

2022

Report on "Visions, requirements and needs for Future Research Environments: An Exploration Series with Researchers"

2020

Gehrlein stability in committee selection: parameterized hardness and algorithms

2020

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs

2019

Approximation Schemes for Low-rank Binary Matrix Approximation Problems

2019

Packing Cycles Faster Than Erdos--Posa

2019

Parameterised Algorithms for Deletion to Classes of DAGs

2018

On the Optimality of Pseudo-polynomial Algorithms for Integer Programming

2018

Paths to Trees and Cacti

2017

Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs

2016

Simultaneous Feedback Vertex Set: A Parameterized Perspective

2016

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree

2015

Solving <i>d-</i>SAT via Backdoors to Small Treewidth

2014

Parameterized Study of the Test Cover Problem

2012

The effect of girth on the kernelization complexity of Connected Dominating Set

2010

Sharp Separation and Applications to Exact and Parameterized Algorithms

2010

An Exact Algorithm for Minimum Distortion Embedding

2009

A Linear Vertex Kernel for Maximum Internal Spanning Tree

2009

Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments

2004

Parameterized Complexity of Directed Feedback Set Problems in Tournaments

2003

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii

2023

Parameterized complexity of multi-node hubs

2022

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on <i>H</i>-Minor-Free Graphs

2022

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules

2021

Strong Connectivity Augmentation is FPT

2021

Faster Graph bipartization

2019

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree

2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS

2019

Packing Arc-Disjoint Cycles in Tournaments

2019

Parameterized Algorithms and Kernels for Rainbow Matching

2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity

2018

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable

2018

Parameterized Complexity of Geometric Covering Problems Having Conflicts

2017

Split Contraction: The Untold Story

2017

Editing to Connected f-Degree Graph

2016

Lower Bounds for Approximation Schemes for Closest String

2016

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs

2015

Bivariate Complexity Analysis of Almost Forest Deletion

2015

B-Chromatic Number: Beyond NP-Hardness

2015

Parameterized Approximations via d-Skew-Symmetric Multicut

2014

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

2013

On the directed Full Degree Spanning Tree problem

2011

Hitting and Harvesting Pumpkins

2011

Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves

2008

Better Algorithms and Bounds for Directed Maximum Leaf Problems

2007

On the Complexity of Minimum Membership Dominating Set

2025

(Re)packing Equal Disks into Rectangle

2024

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity

2024

Optimizing PV integration: Addressing energy fluctuations through BIPV and rooftop PV synergy

2024

Investigation of Surface Integrity of Ti-6Al-4V Using Graphite Nanopowder Mixed Electrical Discharge Machining

2023

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules

2023

Diverse collections in matroids and graphs

2023

A Framework for Approximation Schemes on Disk Graphs

2023

Parameterized Complexity of Maximum Edge Colorable Subgraph

2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs

2022

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)

2022

Paths to trees and cacti

2021

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)

2021

Randomized Contractions Meet Lean Decompositions

2020

Simultaneous Feedback Edge Set: A Parameterized Perspective

2020

Fixed-parameter tractable algorithms for Tracking Shortest Paths

2020

Fault tolerant subgraphs with applications in kernelization

2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion

2020

Spanning Circuits in Regular Matroids

2019

Exploring the Kernelization Borders for Hitting Cycles

2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree

2019

Parameterized Streaming Algorithms for Min-Ones d-SAT

2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs

2018

Linear representation of transversal matroids and gammoids parameterized by rank

2018

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems

2018

A Polynomial Sized Kernel for Tracking Paths Problem

2018

Hitting and Covering Partially

2018

Erdös-Pósa Property of Obstructions to Interval Graphs

2018

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms

2018

Kernelization of Cycle Packing with Relaxed Disjointness Constraints

2018

Reducing CMSO Model Checking to Highly Connected Graphs

2018

Parameterized complexity of Strip Packing and Minimum Volume Packing

2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.

2016

Reducing rank of the adjacency matrix by graph modification

2016

Rank Reduction of Directed Graphs by Vertex and Edge Deletions

2016

Kernelization

2015

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound

2012

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

2011

Imbalance Is Fixed Parameter Tractable

2010

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs

2010

Bandwidth on AT-Free Graphs

2009

Subexponential Algorithms for Partial Cover Problems

2009

Roman Cycle Hitting Set

2025

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs

ACM Transactions on Algorithms · 2024 · journal article

On the Parameterized Complexity of Minus Domination

2024

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable

2024

The Parameterized Complexity of Guarding Almost Convex Polygons

2023

Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems

2023

Burn and Win

2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems

2023

Clustering What Matters: Optimal Approximation for Clustering with Outliers

2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion

2022

On the complexity of singly connected vertex deletion

2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements

2022

Elimination Distance to Topological-minor-free Graphs is FPT.

2021

2-Approximating Feedback Vertex Set in Tournaments

2021

Parameterized complexity of fair feedback vertex set problem

2021

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane

2021

PETA: Privacy Enabled Task Allocation

2020

On the (Parameterized) Complexity of Almost Stable Marriage

2020

Fully dynamic arboricity maintenance

2020

The Parameterized Complexity of Guarding Almost Convex Polygons

2020

Parameterization Above a Multiplicative Guarantee

2020

The parameterized complexity landscape of finding 2-partitions of digraphs

2019

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue

2019

Stability in barter exchange markets

2019

Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity

2019

Balanced Judicious Bipartition is Fixed-Parameter Tractable

2019

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem

2019

Editing to Connected F-Degree Graph

2019

On the Parameterized Complexity of Edge-Linked Paths

2019

Approximate Counting of k-Paths: Deterministic and in Polynomial Space

2019

Exact and Approximate Digraph Bandwidth

2019

Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

2018

Parameterized Algorithms for List K-Cycle

2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

2018

Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis

2018

Covering Vectors by Spaces: Regular Matroids

2018

Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers

2018

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.

2018

Exact Algorithms for Terrain Guarding

2017

Bidimensionality and Kernels

2016

Exact Algorithms via Monotone Local Search

2016

Lossy Kernelization

2016

$$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $${\mathcal O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel

2016

Simultaneous Feedback Vertex Set: A Parameterized Perspective

2015

Analysis of infinite pressure behaviour of thermoelastic properties of materials

2015

Advanced kernelization algorithms

2015

Algebraic techniques: sieves, convolutions, and polynomials

2015

Matroids in Parameterized Complexity and Exact Algorithms

2015

Quick but Odd Growth of Cacti

2015

Finding Even Subgraphs Even Faster

2014

Solving Multicut Faster Than 2 n

2014

Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation)

2013

An FPT Algorithm for Tree Deletion Set

2013

Fixed-Parameter Tractability of Satisfying beyond the Number of Variables

2012

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting

2012

Bidimensionality and EPTAS

2011

On Parameterized Independent Feedback Vertex Set

2011

Beyond Bidimensionality: Parameterized Subexponential Algorithms on\n Directed Graphs

2010

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints

2025

Fixed-Parameter Tractability of Hedge Cut

2025

Parameterized Approximation for Capacitated <i>d</i>-Hitting Set with Hard Capacities

2025

Fixed-parameter algorithms for Fair Hitting Set problems

2024

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time

2024

Meta-theorems for Parameterized Streaming Algorithms‡

2024

Odd Cycle Transversal on <i>P</i>₅-free Graphs in Quasi-polynomial Time

2024

Polynomial Kernel for Interval Vertex Deletion

ACM Transactions on Algorithms · 2023 · journal article

Almost optimal query algorithm for hitting set using a subset query

2023

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)

2023

Kernelization for Spreading Points

2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less

2023

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective

2022

On the parameterized complexity of Grid Contraction

2022

A Parameterized Approximation Scheme for Min $k$-Cut

2022

On the optimality of pseudo-polynomial algorithms for integer programming

2022

On the Parameterized Complexity of Maximum Degree Contraction Problem

2022

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

2021

Exact Multi-Covering Problems with Geometric Sets

2021

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent

2021

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting

2021

Circumventing Connectivity for Kernelization

2021

An ETH-Tight Algorithm for Multi-Team Formation.

2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms

2021

Exploiting Dense Structures in Parameterized Complexity

2021

On the Parameterized Approximability of Contraction to Classes of\n Chordal Graphs

2020

Hitting topological minors is FPT

2020

Parameterized Complexity of Conflict-Free Matchings and Paths

2020

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds

2020

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs

2020

Going Far from Degeneracy

2020

On the Parameterized Complexity of Deletion to $\mathcal{H}$-free Strong Components

2020

On the parameterized complexity of deletion to H-free strong components

2020

Quick Separation in Chordal and Split Graphs

2020

Parameterized Complexity of Directed Spanner Problems

2020

Quadratic Vertex Kernel for Rainbow Matching

2019

Issue Information

2019

Connecting the Dots (with Minimum Crossings)

2019

Parameterized Complexity of Multi-Node Hubs

2019

Solving Group Interval Scheduling Efficiently

2019

Fully Dynamic Arboricity Maintenance

2019

On the Complexity of Mixed Dominating Set

2019

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041)

2019

Modules

2018

Parameterized Computational Geometry via Decomposition Theorems

2018

$$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel

2018

Balanced Judicious Bipartition is Fixed-Parameter Tractable

2018

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces

2017

On the Parameterized Complexity of Contraction to Generalization of Trees

2017

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions

2017

On finding highly connected spanning subgraphs

2017

Spanning Circuits in Regular Matroids

2017

Matrix Rigidity from the Viewpoint of Parameterized Complexity

2017

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements

2017

Packing Cycles Faster Than Erdos-Posa

2017

Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank

2017

On Integer Programming and the Path-width of the Constraint Matrix

2016

A Linear Time Parameterized Algorithm for Node Unique Label Cover

2016

Matroids in Parameterized Complexity and Exact Algorithms

2016

Kernelization of Cycle Packing with Relaxed Disjointness Constraints

2016

Kernelizing Buttons and Scissors.

2016

Simultaneous Feedback Edge Set: A Parameterized Perspective

2016

Deterministic Truncation of Linear Matroids

2015

Bounded Search Trees

2015

Reducing Rank of the Adjacency Matrix by Graph Modification

2015

Miscellaneous

2015

Finding cuts and separators

2015

On the Kernelization Complexity of String Problems

2014

Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound

2013

Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts

2013

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

2013

Parameterized Complexity of MaxSat Above Average

2011

Approximation Algorithms for Minimum Chain Vertex Deletion

2011

Parameterized and exact computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings

2010

Faster Algorithms for Finding and Counting Subgraphs

2009

Kernels for Feedback Arc Set In Tournaments

2009

Parameterized Algorithms for Partial Cover Problems

2008

Improving the gap of Erdös-Pósa property for minor-closed graph classes.

2008

Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs

2026

Stability in Graphs with Matroid Constraints

2026

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality

2026

Balanced substructures in bicolored graphs

Theoretical Computer Science · 2026 · journal article

The parameterized complexity landscape of two-sets cut-uncut

Theoretical Computer Science · 2026 · journal article

Packing Short Cycles

ACM Transactions on Algorithms · 2026 · journal article

Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage

ACM Transactions on Algorithms · 2026 · journal article

Chromatic Index Under Parameterized Settings

2026

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization

2026

The Sparsification Lemma via Measure and Conquer

2026

Hybrid k-Clustering: Blending k-Median and k-Center

ACM Transactions on Computation Theory · 2025 · journal article

When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices

2025

On the structural parameterized complexity of defective coloring

2025

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization

2025

Max-SAT with cardinality constraint parameterized by the number of clauses

2025

Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs

2025 · conference paper

Subexponential Parameterized Algorithms for Hitting Subgraphs

2025 · conference paper

Further parameterized results on weak Grundy coloring

2025

Burn and win

2025

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules

2025

Odd Cycle Transversal on P 5 -free Graphs in Polynomial Time

ACM Transactions on Algorithms · 2025 · journal article

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set

ACM Transactions on Computation Theory · 2025 · journal article

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths

2025

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems

2025

MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal

2025

Exact and Approximate Digraph Bandwidth

2025

Crossing Number in Slightly Superexponential Time (Extended Abstract)

2025

PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods

2025

Multivariate Exploration of Metric Dilation

2025

Parameterized Complexity of Generalizations of Edge Dominating Set

2025

Nonpartisan Feedback Vertex Set

2025

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut

2025

Parameterized Algorithms for Power Edge Set and Zero Forcing Set

2025

On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components

2024

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications

2024

Parameterized Geometric Graph Modification with Disk Scaling

2024

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities

2024

Parameterized Saga of First-Fit and Last-Fit Coloring

2024

Packing Short Cycles

2024

Fixed-Parameter Tractability of Hedge Cut

2024

Discovering Bayesian Networks when Few Variables Matter

2024

Efficient Approximation of Fractional Hypertree Width

2024

Subexponential Parameterized Algorithms for Hitting Subgraphs

2024

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut

2024

Giant Lumbosacral Extradural Intraosseous Schwannoma in an Adolescent Male – A Rare Lesion

2024

Balanced Substructures in Bicolored Graphs

2024

Conflict and Fairness in Resource Allocation

2024

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time

2024

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments

2024

Improved FPT Algorithms for Deletion to Forest-Like Structures

2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints

2024

Well-Structured Committee

2024

Eliminating Crossings in Ordered Graphs

2024

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection

2024

Weak Grundy Coloring: Beyond Np-Hardness

2024

Parameterized Complexity of Paired Domination

2024

Cuts in Graphs with Matroid Constraints

2024

Hybrid k-Clustering: Blending k-Median and k-Center

2024

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3

2024

Parameterized Approximation Algorithms for Weighted Vertex Cover

2024

Max-Sat with Cardinality Constraint Parameterized by the Number of Clauses

2024

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable

2023

Partitioning subclasses of chordal graphs with few deletions

2023

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams

2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach

2023

Kernelization of Counting Problems

2023

Meta-theorems for Parameterized Streaming Algorithms

2023

Efficient Approximation for Subgraph-Hitting Problems in Sparse Graphs and Geometric Intersection Graphs

2023

Parameterized algorithms for Eccentricity Shortest Path Problem

2023

Erdős–Pósa property of obstructions to interval graphs

Journal of Graph Theory · 2023 · journal article

An Improved Exact Algorithm for Knot-Free Vertex Deletion

2023

Exact and Approximate Digraph Bandwidth

2023

Issue Information

2023

Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs

2023

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

2023

Minimum-Membership Geometric Set Cover, Revisited

2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity

2023

On the Complexity of the Eigenvalue Deletion Problem

2023

Optimal cost-effective roof-top installation in an energy deficit economic condition

2023

Lossy Kernelization for (Implicit) Hitting Set Problems

2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands

2023

Balanced Substructures in Bicolored Graphs

2022

(Re)packing Equal Disks into Rectangle

2022

A Framework for Approximation Schemes on Disk Graphs

2022

Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor

2022

Highly unbreakable graph with a fixed excluded minor are almost rigid

2022

Theory research in India

2022

Exact Exponential Algorithms for Clustering Problems

2022

Parameterized Algorithms for Locally Minimal Defensive Alliance

2022

Parameterized Complexity of Graph Partitioning into Connected Clusters

2022

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles

2022

Detours in Directed Graphs

2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs

2022

Output Sensitive Fault Tolerant Maximum Matching

2022

Gehrlein Stable Committee with Multi-modal Preferences

2022

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation

2022

List Homomorphism: Beyond the Known Boundaries

2022

Parameterized Algorithms for Finding Highly Connected Solution

2022

Space-Efficient FPT Algorithms

2021

Parameterized Complexity of Directed Spanner Problems

2021

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs

2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space

2021

Approximation in (Poly-) Logarithmic Space

Algorithmica · 2021 · journal article

$α$-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms

2021

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths

2021

Popular Matching in Roommates Setting Is NP-hard

2021

Computation of Hadwiger Number and Related Contraction Problems

2021

Gerrymandering on graphs: Computational complexity and parameterized\n algorithms

2021

Diverse Collections in Matroids and Graphs

2021

k-Distinct Branchings Admits a Polynomial Kernel

2021

Odd Cycle Transversal in Mixed Graphs

2021

A Polynomial Kernel for Deletion to Ptolemaic Graphs

2021

Parameterized and exact algorithms for class domination coloring

2020

A Constant Factor Approximation for Navigating Through Connected\n Obstacles in the Plane

2020

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar)\n Disjoint Paths

2020

On the Parameterized Complexity Of Grid Contraction

2020

Parameterized Complexity of Maximum Edge Colorable Subgraph

2020

A characterization of König-Egerváry graphs with extendable vertex covers

2020

A Parameterized Approximation Scheme for Min $k$-Cut

2020

Optimal Output Sensitive Fault Tolerant Cuts

2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs

2020

Parameterized Complexity of Fair Feedback Vertex Set Problem

2020

Improved FPT Algorithms for Deletion to Forest-Like Structures

2020

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams

2020

Path Contraction Faster than $2^n$

2020

On the Complexity of Singly Connected Vertex Deletion

2020

Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs

2020

On the Parameterized Complexity of Maximum Degree Contraction Problem.

2020

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set

2020

Approximation algorithms for geometric conflict free covering problems

2019

Smart Irrigation Monitoring System

2019

Path Contraction Faster Than 2^n

2019

Structural Parameterization for Graph Deletion Problems over Data Streams

2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.

2019

Communication Complexity and Graph Families

2019

Subset Feedback Vertex Set in Chordal and Split Graphs

2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs

2019

Constrained Representations of Map Graphs and Half-Squares

2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression

2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals

2019

An Erdős–Pósa Theorem on Neighborhoods and Domination Number

2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals.

2019

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices

2019

Surgery on Graphs

2018

Polynomial Lower Bounds

2018

Introduction to Treewidth

2018

Preface

2018

Representative Families

2018

Expansion Lemma

2018

Warm Up

2018

Sunflower Lemma

2018

Polynomial Parameter Transformation

2018