20 citations · 146 across the 41 of their papers we have counts for
5 papers · 2 filters
Parameterized algorithms for Partial vertex covers in bipartite graphs
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani
In the weighted partial vertex cover problem (WPVC), we are given a graph , cost function , profit function , and positive integers …
On the fixed-parameter tractability of the maximum connectivity improvement problem
Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
In the Maximum Connectivity Improvement (MCI) problem, we are given a directed graph and an integer and we are asked to find new edges to be added to in order…
Normal -edge-colorings of a family of Loupekhine snarks
Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
In a proper edge-coloring of a cubic graph an edge is called poor or rich, if the set of colors of the edges incident to and contains exactly three or five colors, res…
Assigning tasks to agents under time conflicts: a parameterized complexity approach
Alessandro Aloisio, Vahan Mkrtchyan
We consider the problem of assigning tasks to agents under time conflicts, with applications also to frequency allocations in point-to-point wireless networks. In particular, we ar…
Normal 6-edge-colorings of some bridgeless cubic graphs
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct…