research
∙
12/30/2022
Recurrent Problems in the LOCAL model
The paper considers the SUPPORTED model of distributed computing introdu...
share
research
∙
12/01/2022
Clustering What Matters: Optimal Approximation for Clustering with Outliers
Clustering with outliers is one of the most fundamental problems in Comp...
research
∙
11/08/2022
Computing Square Colorings on Bounded-Treewidth and Planar Graphs
A square coloring of a graph G is a coloring of the square G^2 of G, tha...
research
∙
10/08/2022
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation
The Delaunay graph of a point set P ⊆ℝ^2 is the plane graph with the ver...
research
∙
09/12/2022
On finding short reconfiguration sequences between independent sets
Assume we are given a graph G, two independent sets S and T in G of size...
research
∙
08/18/2022
Recognizing well-dominated graphs is coNP-complete
A graph G is well-covered if every minimal vertex cover of G is minimum,...
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
∙
04/20/2021
Elimination Distance to Topological-minor-free Graphs is FPT
In the literature on parameterized graph problems, there has been an inc...
research
∙
08/18/2020
Parameterized Complexity of Maximum Edge Colorable Subgraph
A graph H is p-edge colorable if there is a coloring ψ: E(H) →{1,2,…,p},...
research
∙
03/17/2020
The Parameterized Complexity of Guarding Almost Convex Polygons
Art Gallery is a fundamental visibility problem in Computational Geometr...
research
∙
05/06/2019