research
∙
01/03/2023
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST
In this paper, we reduce the maximum weighted matching problem to the la...
share
research
∙
04/22/2021
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
In the classical partial vertex cover problem, we are given a graph G an...
research
∙
04/19/2021
On sublinear approximations for the Petersen coloring conjecture
If f:ℕ→ℕ is a function, then let us say that f is sublinear if lim_...
research
∙
09/27/2020
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring o...
research
∙
08/17/2020
Sublinear bounds for nullity of flows and approximating Tutte's flow conjectures
A function f:N→ N is sublinear, if lim_x→ +∞f(x)/x=0. If A is ...
research
∙
02/24/2020
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs
An equitable coloring of a graph G is a proper vertex coloring of G such...
research
∙
04/26/2019
Parameterized algorithms for Partial vertex covers in bipartite graphs
In the weighted partial vertex cover problem (WPVC), we are given a grap...
research
∙
04/26/2019
On the fixed-parameter tractability of the maximum connectivity improvement problem
In the Maximum Connectivity Improvement (MCI) problem, we are given a di...
research
∙
04/19/2019
On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem
A k-edge-coloring of a graph is an assignment of colors {1,...,k} to edg...
research
∙
04/04/2019
Normal 5-edge-colorings of a family of Loupekhine snarks
In a proper edge-coloring of a cubic graph an edge uv is called poor or ...
research
∙
03/13/2019
Normal 6-edge-colorings of some bridgeless cubic graphs
In an edge-coloring of a cubic graph, an edge is poor or rich, if the se...
research
∙
07/21/2018
S_12 and P_12-colorings of cubic graphs
If G and H are two cubic graphs, then an H-coloring of G is a proper edg...
research
∙
07/17/2018
A tight lower bound for the hardness of clutters
A clutter (or antichain or Sperner family) L is a pair (V,E), where V...
research
∙
07/17/2018
On maximum k-edge-colorable subgraphs of bipartite graphs
If k≥ 0, then a k-edge-coloring of a graph G is an assignment of colors ...
research
∙
04/25/2018
