research
∙
07/22/2023
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
Domination and coloring are two classic problems in graph theory. The ma...
share
research
∙
04/13/2023
Graph-theoretic insights on the constructability of complex entangled states
The most efficient automated way to construct a large class of quantum p...
research
∙
10/14/2022
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
In this paper, we study the computational complexity of s-Club Cluster V...
research
∙
09/13/2022
List recoloring of planar graphs
A list assignment L of a graph G is a function that assigns to every ver...
research
∙
02/11/2022
Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture
In 2017, Krenn reported that certain problems related to the perfect mat...
research
∙
11/25/2021
Variants of the Gyà rfà s-Sumner Conjecture: Oriented Trees and Rainbow Paths
Given a finite family ℱ of graphs, we say that a graph G is "ℱ-free" if ...
research
∙
11/25/2019
Combinatorial lower bounds for 3-query LDCs
A code is called a q-query locally decodable code (LDC) if there is a ra...
research
∙
10/25/2019
Improved Approximation for Maximum Edge Colouring Problem
The anti-Ramsey number, ar(G, H) is the minimum integer k such that in a...
research
∙
12/12/2018
On Graphs with Minimal Eternal Vertex Cover Number
The eternal vertex cover problem is a variant of the classical vertex co...
research
∙
10/01/2018
Approximation bounds on maximum edge 2-coloring of dense graphs
For a graph G and integer q≥ 2, an edge q-coloring of G is an assignment...
research
∙
02/21/2018
