research
∙
01/01/2023
Exactly Hittable Interval Graphs
Given a set system 𝒳 = {𝒰,𝒮}, where 𝒰 is a set of elements and 𝒮 is a se...
share
research
∙
05/16/2022
A faster algorithm for Vertex Cover parameterized by solution size
We describe a new algorithm for vertex cover with runtime O^*(1.25400^k)...
research
∙
11/08/2021
Succinct Data Structure for Path Graphs
We consider the problem of designing a succinct data structure for path ...
research
∙
10/13/2021
Parameterized Complexity of Minimum Membership Dominating Set
Given a graph G=(V,E) and an integer k, the Minimum Membership Dominatin...
research
∙
10/06/2021
Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube
We address the problem of computing a Steiner Arborescence on a directed...
research
∙
07/07/2021
Budgeted Dominating Sets in Uncertain Graphs
We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, ...
research
∙
11/23/2020
The Connected Domination Number of Grids
Closed form expressions for the domination number of an n × m grid have ...
research
∙
07/20/2020
A polynomial time 12-approximation algorithm for restricted Santa Claus problem
In this paper, we consider the restricted case of the problem and improv...
research
∙
09/17/2019
Dynamic coloring for Bipartite and General Graphs
We consider the dynamic coloring problem on bipartite and general graphs...
research
∙
04/01/2019
Fully Dynamic Data Structures for Interval Coloring
We consider the dynamic graph coloring problem restricted to the class o...
research
∙
12/05/2018
On the Complexity Landscape of Connected f -Factor Problems
Let G be an undirected simple graph having n vertices and let f be a fun...
research
∙
12/04/2018
Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring
We present a polynomial time reduction from the conflict-free colouring ...
research
∙
10/02/2018