Vahan Mkrtchyan

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 40

Top Topics

Bipartite Graph

Polynomial Time Approximation

Ensemble Classification

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

Publications

Vahan Mkrtchyan
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability. J. Graph Algorithms Appl. 28 (1) (2024)
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. Theory Comput. Syst. 68 (1) (2024)
Edita Mácajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan, Jean Paul Zerafa
Some snarks are worse than others. Eur. J. Comb. 117 (2024)
Janusz Dybizbanski, Hanna Furmanczyk, Vahan Mkrtchyan
Gap one bounds for the equitable chromatic number of block graphs. Discret. Appl. Math. 354 (2024)
Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
Decomposition of class II graphs into two class I graphs. Discret. Math. 346 (12) (2023)
Vahan Mkrtchyan
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST. CoRR (2023)
Vahan Mkrtchyan, Garik Petrosyan
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. J. Graph Algorithms Appl. 26 (1) (2022)
Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao
Decomposition of class II graphs into two class I graphs. CoRR (2022)
Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
On sublinear approximations for the Petersen coloring conjecture. CoRR (2021)
Vahan Mkrtchyan, Garik Petrosyan
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. CoRR (2021)
Hanna Furmanczyk, Vahan Mkrtchyan
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs. Discret. Math. Theor. Comput. Sci. 23 (2) (2021)
Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
On sublinear approximations for the Petersen coloring conjecture. Bull. ICA 92 (2021)
Alessandro Aloisio, Vahan Mkrtchyan
Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem. AINA (3) (2021)
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Normal edge-colorings of cubic graphs. J. Graph Theory 94 (1) (2020)
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr J. Wojciechowski
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. IWOCA (2020)
Janusz Dybizbanski, Hanna Furmanczyk, Vahan Mkrtchyan
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs. CoRR (2020)
Vahan Mkrtchyan
Sublinear bounds for nullity of flows and approximating Tutte's flow conjectures. CoRR (2020)
Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. Theory Comput. Syst. 64 (6) (2020)
Hanna Furmanczyk, Vahan Mkrtchyan
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs. CoRR (2020)
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Normal 6-edge-colorings of some bridgeless cubic graphs. Discret. Appl. Math. 277 (2020)
Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Normal 5-edge-colorings of a family of Loupekhine snarks. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
On the fixed-parameter tractability of the maximum connectivity improvement problem. CoRR (2019)
Liana Karapetyan, Vahan Mkrtchyan
On maximum k-edge-colorable subgraphs of bipartite graphs. Discret. Appl. Math. 257 (2019)
Anush Hakobyan, Vahan Mkrtchyan
-colorings of cubic graphs. Ars Math. Contemp. 17 (2) (2019)
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Normal 6-edge-colorings of some bridgeless cubic graphs. CoRR (2019)
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani
Parameterized algorithms for Partial vertex covers in bipartite graphs. CoRR (2019)
Zola Donovan, K. Subramani, Vahan Mkrtchyan
Disjoint Clustering in Combinatorial Circuits. IWOCA (2019)
Alessandro Aloisio, Vahan Mkrtchyan
On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem. CoRR (2019)
Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38 (2) (2019)
Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Normal 5-edge-colorings of a family of Loupekhine snarks. CoRR (2019)
Bugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr J. Wojciechowski
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM (2018)
Vahan Mkrtchyan, Hovhannes Sargsyan
A tight lower bound for the hardness of clutters. J. Comb. Optim. 35 (1) (2018)
Vahan Mkrtchyan, Hovhannes Sargsyan
A tight lower bound for the hardness of clutters. CoRR (2018)
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
Normal edge-colorings of cubic graphs. CoRR (2018)
Bugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36 (2) (2018)
Liana Karapetyan, Vahan Mkrtchyan
On maximum k-edge-colorable subgraphs of bipartite graphs. CoRR (2018)
Anush Hakobyan, Vahan Mkrtchyan
-colorings of cubic graphs. CoRR (2018)
Hanna Furmanczyk, Marek Kubale, Vahan Mkrtchyan
Equitable colorings of corona multiproducts of graphs. Discuss. Math. Graph Theory 37 (4) (2017)
Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
The Approximability of Partial Vertex Covers in Trees. SOFSEM (2017)
Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Lianna Hambardzumyan, Vahan Mkrtchyan
Cubic Graphs, Disjoint Matchings and Some Inequalities. CoRR (2015)
Anush Hakobyan, Vahan Mkrtchyan
On Sylvester Colorings of Cubic Graphs. CoRR (2015)
Zola Donovan, Vahan Mkrtchyan, K. Subramani
On Clustering Without Replication in Combinatorial Circuits. COCOA (2015)
Vahan Mkrtchyan, K. Subramani
On the approximability of the Largest Sphere Rule Ensemble Classification problem. Inf. Process. Lett. 115 (11) (2015)
Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS (2014)
Zola Donovan, Vahan Mkrtchyan, K. Subramani
Clustering without replication: approximation and inapproximability. CoRR (2014)
Vahan Mkrtchyan, Codrut Grosu
Disjoint Maximum-Sized Matchings: 11305 [2007, 640]. Am. Math. Mon. 116 (6) (2009)
Vahan Mkrtchyan
Problem 11305. Am. Math. Mon. 114 (7) (2007)