default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVahan V. Mkrtchyan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Janusz Dybizbanski
, Hanna Furmanczyk, Vahan Mkrtchyan:
Gap one bounds for the equitable chromatic number of block graphs. Discret. Appl. Math. 354: 15-28 (2024)- [j35]Edita Mácajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan, Jean Paul Zerafa:
Some snarks are worse than others. Eur. J. Comb. 117: 103832 (2024) - [j34]Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Approximation Algorithms for Partial Vertex Covers in Trees. Int. J. Found. Comput. Sci. 35(4): 387-407 (2024) - [j33]Vahan Mkrtchyan:
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability. J. Graph Algorithms Appl. 28(1): 129-147 (2024) - [j32]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): 122-143 (2024) - [i41]Vahan Mkrtchyan:
Two hardness results for the maximum 2-edge-colorable subgraph problem in bipartite graphs. CoRR abs/2409.15388 (2024) - [i40]Vahan Mkrtchyan:
Non-conflicting no-where zero Z2⨉ Z2 flows in cubic graphs. CoRR abs/2410.04389 (2024) - 2023
- [j31]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): 113610 (2023) - [i39]Vahan Mkrtchyan:
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST. CoRR abs/2301.01084 (2023) - 2022
- [j30]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): 91-110 (2022) - [i38]Yan Cao, Guangming Jing, Rong Luo, Vahan Mkrtchyan, Cun-Quan Zhang, Yue Zhao:
Decomposition of class II graphs into two class I graphs. CoRR abs/2211.05930 (2022) - 2021
- [j29]Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
On sublinear approximations for the Petersen coloring conjecture. Bull. ICA 92: 78-90 (2021) - [j28]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) - [c8]Alessandro Aloisio, Vahan Mkrtchyan:
Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem. AINA (3) 2021: 232-241 - [i37]Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
On sublinear approximations for the Petersen coloring conjecture. CoRR abs/2104.09241 (2021) - [i36]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 abs/2104.11215 (2021) - 2020
- [j27]Vahan V. Mkrtchyan, Gagik N. Vardanyan:
On two consequences of Berge-Fulkerson conjecture. AKCE Int. J. Graphs Comb. 17(1): 584-586 (2020) - [j26]Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 5-edge-colorings of a family of Loupekhine snarks. AKCE Int. J. Graphs Comb. 17(3): 720-724 (2020) - [j25]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 6-edge-colorings of some bridgeless cubic graphs. Discret. Appl. Math. 277: 252-262 (2020) - [j24]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal edge-colorings of cubic graphs. J. Graph Theory 94(1): 75-91 (2020) - [j23]Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan:
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. Theory Comput. Syst. 64(6): 1094-1109 (2020) - [j22]Zola Donovan, K. Subramani, Vahan V. Mkrtchyan:
Analyzing Clustering and Partitioning Problems in Selected VLSI Models. Theory Comput. Syst. 64(7): 1242-1272 (2020) - [c7]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. IWOCA 2020: 395-408 - [i35]Janusz Dybizbanski, Hanna Furmanczyk, Vahan Mkrtchyan:
Vizing-Goldberg type bounds for the equitable chromatic number of block graphs. CoRR abs/2002.10151 (2020) - [i34]Hanna Furmanczyk, Vahan Mkrtchyan:
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs. CoRR abs/2009.12784 (2020)
2010 – 2019
- 2019
- [j21]Anush Hakobyan, Vahan Mkrtchyan:
S12 and P12-colorings of cubic graphs. Ars Math. Contemp. 17(2): 431-445 (2019) - [j20]Liana Karapetyan, Vahan Mkrtchyan:
On maximum k-edge-colorable subgraphs of bipartite graphs. Discret. Appl. Math. 257: 226-232 (2019) - [j19]Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani:
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38(2): 481-501 (2019) - [c6]Zola Donovan, K. Subramani, Vahan Mkrtchyan:
Disjoint Clustering in Combinatorial Circuits. IWOCA 2019: 201-213 - [i33]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 6-edge-colorings of some bridgeless cubic graphs. CoRR abs/1903.06043 (2019) - [i32]Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 5-edge-colorings of a family of Loupekhine snarks. CoRR abs/1904.02661 (2019) - [i31]Alessandro Aloisio, Vahan Mkrtchyan:
On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem. CoRR abs/1904.09246 (2019) - [i30]Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan:
On the fixed-parameter tractability of the maximum connectivity improvement problem. CoRR abs/1904.12000 (2019) - [i29]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani:
Parameterized algorithms for Partial vertex covers in bipartite graphs. CoRR abs/1904.12011 (2019) - 2018
- [j18]Vahan Mkrtchyan, Hovhannes Sargsyan:
A tight lower bound for the hardness of clutters. J. Comb. Optim. 35(1): 21-25 (2018) - [j17]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan:
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36(2): 329-345 (2018) - [c5]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM 2018: 45-58 - [i28]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal edge-colorings of cubic graphs. CoRR abs/1804.09449 (2018) - [i27]Vahan V. Mkrtchyan, Gagik N. Vardanyan:
On two consequences of Berge-Fulkerson conjecture. CoRR abs/1805.06828 (2018) - [i26]Liana Karapetyan, Vahan Mkrtchyan:
On maximum k-edge-colorable subgraphs of bipartite graphs. CoRR abs/1807.06556 (2018) - [i25]Vahan Mkrtchyan, Hovhannes Sargsyan:
A tight lower bound for the hardness of clutters. CoRR abs/1807.06568 (2018) - [i24]Anush Hakobyan, Vahan Mkrtchyan:
S12 and P12-colorings of cubic graphs. CoRR abs/1807.08138 (2018) - 2017
- [j16]Hanna Furmanczyk, Marek Kubale, Vahan Mkrtchyan:
Equitable colorings of corona multiproducts of graphs. Discuss. Math. Graph Theory 37(4): 1079-1094 (2017) - [j15]Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 2172-2184 (2017) - [c4]Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani:
The Approximability of Partial Vertex Covers in Trees. SOFSEM 2017: 350-360 - 2015
- [j14]Vahan Mkrtchyan, K. Subramani:
On the approximability of the Largest Sphere Rule Ensemble Classification problem. Inf. Process. Lett. 115(11): 833-837 (2015) - [c3]Zola Donovan, Vahan Mkrtchyan, K. Subramani:
On Clustering Without Replication in Combinatorial Circuits. COCOA 2015: 334-347 - [i23]Petros A. Petrosyan, Vahan V. Mkrtchyan, Rafayel R. Kamalian:
Graph Theory. CoRR abs/1510.00945 (2015) - [i22]Anush Hakobyan, Vahan Mkrtchyan:
On Sylvester Colorings of Cubic Graphs. CoRR abs/1511.02475 (2015) - [i21]Lianna Hambardzumyan, Vahan Mkrtchyan:
Cubic Graphs, Disjoint Matchings and Some Inequalities. CoRR abs/1512.02546 (2015) - 2014
- [j13]Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs. Discret. Appl. Math. 172: 12-27 (2014) - [c2]Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS 2014: 13-26 - [i20]Zola Donovan, Vahan Mkrtchyan, K. Subramani:
Clustering without replication: approximation and inapproximability. CoRR abs/1412.4051 (2014) - 2013
- [j12]Vahan V. Mkrtchyan:
A remark on the Petersen coloring conjecture of Jaeger. Australas. J Comb. 56: 145-152 (2013) - [j11]Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
Corrigendum to "On disjoint matchings in cubic graphs" [Discrete Math. 310 (2010) 1588-1613]. Discret. Math. 313(21): 2381 (2013) - 2012
- [j10]Artur Khojabaghyan, Vahan V. Mkrtchyan:
On upper bounds for parameters related to the construction of special maximum matchings. Discret. Math. 312(2): 213-220 (2012) - [j9]Vahan V. Mkrtchyan, Eckhard Steffen:
Measures of edge-uncolorability. Discret. Math. 312(2): 476-478 (2012) - [j8]Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory 70(4): 473-482 (2012) - [i19]Vahan V. Mkrtchyan:
A remark on Petersen coloring conjecture of Jaeger. CoRR abs/1201.4472 (2012) - [i18]Hanna Furmanczyk, Marek Kubale, Vahan V. Mkrtchyan:
Equitable Colorings of Corona Multiproducts of Graphs. CoRR abs/1210.6568 (2012) - 2011
- [i17]Vahan V. Mkrtchyan, Petros A. Petrosyan:
A note on triangle-free graphs. CoRR abs/1101.3188 (2011) - [i16]Vahan V. Mkrtchyan, Gagik N. Vardanyan:
On spanning maximum k-edge-colorable subgraphs. CoRR abs/1107.4879 (2011) - 2010
- [j7]Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
On disjoint matchings in cubic graphs. Discret. Math. 310(10-11): 1588-1613 (2010) - [c1]Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Delta-edge-colorable Subgraphs of Class II Graphs. CTW 2010: 129-132 - [i15]Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum $\Delta$-edge-colorable subgraphs of class II graphs. CoRR abs/1002.0783 (2010) - [i14]Vahan V. Mkrtchyan, Eckhard Steffen:
Bricks and conjectures of Berge, Fulkerson and Seymour. CoRR abs/1003.5782 (2010) - [i13]Vahan V. Mkrtchyan, Eckhard Steffen:
Measures of edge-uncolorability. CoRR abs/1003.5783 (2010)
2000 – 2009
- 2009
- [j6]Vahan Mkrtchyan, Codrut Grosu:
Disjoint Maximum-Sized Matchings: 11305 [2007, 640]. Am. Math. Mon. 116(6): 550-551 (2009) - [i12]Artur Khojabaghyan, Vahan V. Mkrtchyan:
An upper bound for a parameter related to special maximum matching constructing. CoRR abs/0901.0121 (2009) - [i11]Sasun Hambartsumyan, Vahan V. Mkrtchyan, Vahe L. Musoyan, Hovhannes Sargsyan:
Complexity: an approach through independence. CoRR abs/0903.4907 (2009) - [i10]Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs. CoRR abs/0909.2767 (2009) - 2008
- [j5]Rafael R. Kamalian, Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing. Discret. Math. 308(10): 1792-1800 (2008) - [j4]Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan:
On edge-disjoint pairs of matchings. Discret. Math. 308(23): 5823-5828 (2008) - [i9]Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan:
5-cycles and the Petersen graph. CoRR abs/0801.3714 (2008) - [i8]Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
TRACTATUS on disjoint matchings in cubic graphs. CoRR abs/0803.0134 (2008) - 2007
- [j3]Vahan Mkrtchyan:
Problem 11305. Am. Math. Mon. 114(7): 640 (2007) - [i7]Vahan V. Mkrtchyan:
A note on minimal matching covered graphs. CoRR abs/0707.1925 (2007) - [i6]Vahan V. Mkrtchyan:
On trees with a maximum proper partial 0-1 coloring containing a maximum matching. CoRR abs/0707.1926 (2007) - [i5]Rafael R. Kamalian, Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing. CoRR abs/0707.2126 (2007) - [i4]Rafael R. Kamalian, Vahan V. Mkrtchyan:
Two polynomial algorithms for special maximum matching constructing in trees. CoRR abs/0707.2295 (2007) - [i3]Vahan V. Mkrtchyan, Vahe L. Musoyan, A. V. Tserunyan:
On Edge-Disjoint Pairs Of Matchings. CoRR abs/0708.1903 (2007) - [i2]Rafael R. Kamalian, Vahan V. Mkrtchyan:
On a constructive characterization of a class of trees related to pairs of disjoint matchings. CoRR abs/0708.2363 (2007) - [i1]Vahan V. Mkrtchyan:
A course on Combinatorial Algorithms. CoRR abs/0708.3962 (2007) - 2006
- [j2]Vahan V. Mkrtchyan:
A note on minimal matching covered graphs. Discret. Math. 306(4): 452-455 (2006) - [j1]Vahan V. Mkrtchyan:
On trees with a maximum proper partial 0-1 coloring containing a maximum matching. Discret. Math. 306(4): 456-459 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
