research
∙
10/17/2019
Faster parameterized algorithm for Bicluter Editing
In the Bicluter Editing problem the input is a graph G and an integer k,...
share
research
∙
08/20/2019
An algorithm for destroying claws and diamonds
In the Claw,Diamond-Free Edge Deletion problem the input is a graph G an...
research
∙
08/09/2019
Kernel for Kt-free edge deletion
In the K_t-free edge deletion problem, the input is a graph G and an int...
research
∙
08/03/2019
Faster algorithms for cograph edge modification problems
In the Cograph Deletion (resp., Cograph Editing) problem the input is a ...
research
∙
08/03/2019
Faster algorithm for Cograph Deletion
In the Cograph Deletion problem the input is a graph G and an integer k,...
research
∙
07/24/2019
An FPT algorithm for orthogonal buttons and scissors
We study the puzzle game Buttons and Scissors in which the goal is to re...
research
∙
07/19/2019
Cluster deletion revisited
In the Cluster Deletion problem the input is a graph G and an integer k,...
research
∙
06/24/2019
Algorithms for deletion problems on split graphs
In the Split to Block Vertex Deletion and Split to Threshold Vertex Dele...
research
∙
06/24/2019
A note on the Split to Block Vertex Deletion problem
In the Split to Block Vertex Deletion (SBVD) problem the input is a spli...
research
∙
06/24/2019
Faster branching algorithm for split to block vertex deletion
In the Split to Block Vertex Deletion (SBVD) problem the input is a spli...
research
∙
06/22/2019
l-path vertex cover is easier than l-hitting set for small l
In the l-path vertex cover problem the input is an undirected graph G an...
research
∙
01/22/2019
Faster parameterized algorithm for Cluster Vertex Deletion
In the Cluster Vertex Deletion problem the input is a graph G and an int...
research
∙
01/08/2019
Faster parameterized algorithm for pumpkin vertex deletion set
A directed graph G is called a pumpkin if G is a union of induced paths ...
research
∙
12/27/2018
Above guarantee parameterization for vertex cover on graphs with maximum degree 4
In the vertex cover problem, the input is a graph G and an integer k, an...
research
∙
11/08/2018
An O^*(2.619^k) algorithm for 4-path vertex cover
In the 4-path vertex cover problem, the input is an undirected graph G a...
research
∙
10/30/2018
Weighted vertex cover on graphs with maximum degree 3
We give a parameterized algorithm for weighted vertex cover on graphs wi...
research
∙
09/07/2018
Parameterized algorithm for 3-path vertex cover
In the 3-path vertex cover problem, the input is an undirected graph G a...
research
∙
08/13/2018
Faster deterministic parameterized algorithm for k-Path
In the k-Path problem, the input is a directed graph G and an integer k≥...
research
∙
08/10/2018
The effective entropy of next/previous larger/smaller value queries
We study the problem of storing the minimum number of bits required to a...
research
∙
08/10/2018
Dynamic all scores matrices for LCS score
The problem of aligning two strings A,B in order to determine their simi...
research
∙
07/01/2018
Representation of ordered trees with a given degree distribution
The degree distribution of an ordered tree T with n nodes is n⃗ = (n_0,....
research
∙
05/29/2018
