Vahan Mkrtchyan

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