Vahan V. Mkrtchyan

Ojas Parekh

Int. J. Found. Comput. Sci., June, 2024

Some snarks are worse than others.

[BibT_eX]

[DOI]

Eur. J. Comb., March, 2024

On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective.

[BibT_eX]

[DOI]

Theory Comput. Syst., February, 2024

The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

Gap one bounds for the equitable chromatic number of block graphs.

[BibT_eX]

[DOI]

Janusz Dybizbanski

Discret. Appl. Math., 2024

Non-conflicting no-where zero Z2⨉ Z2 flows in cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Two hardness results for the maximum 2-edge-colorable subgraph problem in bipartite graphs.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Decomposition of class II graphs into two class I graphs.

[BibT_eX]

[DOI]

Discret. Math., December, 2023

Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST.

[BibT_eX]

[DOI]

CoRR, 2023

2022

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs.

[BibT_eX]

[DOI]

Garik Petrosyan

J. Graph Algorithms Appl., 2022

2021

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

On sublinear approximations for the Petersen coloring conjecture.

[BibT_eX]

[DOI]

Davide Mattiolo

Bull. ICA, 2021

Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem.

[BibT_eX]

[DOI]

Alessandro Aloisio

Proceedings of the Advanced Information Networking and Applications, 2021

2020

Analyzing Clustering and Partitioning Problems in Selected VLSI Models.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem.

[BibT_eX]

[DOI]

Federico Corò

Gianlorenzo D'Angelo

Theory Comput. Syst., 2020

Normal edge-colorings of cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Normal 6-edge-colorings of some bridgeless cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs.

[BibT_eX]

[DOI]

Janusz Dybizbanski

CoRR, 2020

On two consequences of Berge-Fulkerson conjecture.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2020

Normal 5-edge-colorings of a family of Loupekhine snarks.

[BibT_eX]

[DOI]

Luca Ferrarini

AKCE Int. J. Graphs Comb., 2020

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Clustering without replication in combinatorial circuits.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

On maximum k-edge-colorable subgraphs of bipartite graphs.

[BibT_eX]

[DOI]

Liana Karapetyan

Discret. Appl. Math., 2019

Parameterized algorithms for Partial vertex covers in bipartite graphs.

[BibT_eX]

[DOI]

Garik Petrosyan

CoRR, 2019

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem.

[BibT_eX]

[DOI]

Alessandro Aloisio

CoRR, 2019

S12 and P12-colorings of cubic graphs.

[BibT_eX]

[DOI]

Anush Hakobyan

Ars Math. Contemp., 2019

Disjoint Clustering in Combinatorial Circuits.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

A tight lower bound for the hardness of clutters.

[BibT_eX]

[DOI]

Hovhannes Sargsyan

J. Comb. Optim., 2018

On approximating optimal weight "no"-certificates in weighted difference constraint systems.

[BibT_eX]

[DOI]

Bugra Çaskurlu

Matthew D. Williamson

J. Comb. Optim., 2018

S12 and P12-colorings of cubic graphs.

[BibT_eX]

[DOI]

Anush Hakobyan

CoRR, 2018

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.

[BibT_eX]

[DOI]

Bugra Çaskurlu

Matthew D. Williamson

Piotr Wojciechowski

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Equitable colorings of corona multiproducts of graphs.

[BibT_eX]

[DOI]

Marek Kubale

Discuss. Math. Graph Theory, 2017

The Approximability of Partial Vertex Covers in Trees.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2015

On the approximability of the Largest Sphere Rule Ensemble Classification problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Graph Theory.

[BibT_eX]

[DOI]

Petros A. Petrosyan

Rafayel R. Kamalian

CoRR, 2015

Cubic Graphs, Disjoint Matchings and Some Inequalities.

[BibT_eX]

[DOI]

Lianna Hambardzumyan

CoRR, 2015

On Sylvester Colorings of Cubic Graphs.

[BibT_eX]

[DOI]

Anush Hakobyan

CoRR, 2015

On Clustering Without Replication in Combinatorial Circuits.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Clustering without replication: approximation and inapproximability.

[BibT_eX]

[DOI]

CoRR, 2014

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

2013

Corrigendum to "On disjoint matchings in cubic graphs" [Discrete Math. 310 (2010) 1588-1613].

[BibT_eX]

[DOI]

Discret. Math., 2013

A remark on the Petersen coloring conjecture of Jaeger.

[BibT_eX]

[DOI]

Australas. J Comb., 2013

2012

Maximum Δ-edge-colorable subgraphs of class II graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Measures of edge-uncolorability.

[BibT_eX]

[DOI]

Discret. Math., 2012

On upper bounds for parameters related to the construction of special maximum matchings.

[BibT_eX]

[DOI]

Artur Khojabaghyan

Discret. Math., 2012

2011

On spanning maximum k-edge-colorable subgraphs

[BibT_eX]

[DOI]

CoRR, 2011

A note on triangle-free graphs

[BibT_eX]

[DOI]

Petros A. Petrosyan

CoRR, 2011

2010

On disjoint matchings in cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

Bricks and conjectures of Berge, Fulkerson and Seymour

[BibT_eX]

[DOI]

CoRR, 2010

Maximum Delta-edge-colorable Subgraphs of Class II Graphs.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Disjoint Maximum-Sized Matchings: 11305 [2007, 640].

[BibT_eX]

[DOI]

Codrut Grosu

Am. Math. Mon., 2009

On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs

[BibT_eX]

[DOI]

CoRR, 2009

Complexity: an approach through independence

[BibT_eX]

[DOI]

CoRR, 2009

An upper bound for a parameter related to special maximum matching constructing

[BibT_eX]

[DOI]

Artur Khojabaghyan

CoRR, 2009

2008

On edge-disjoint pairs of matchings.

[BibT_eX]

[DOI]

Vahe L. Musoyan

A. V. Tserunyan

Discret. Math., 2008

On complexity of special maximum matchings constructing.

[BibT_eX]

[DOI]

Rafael R. Kamalian

Discret. Math., 2008

TRACTATUS on disjoint matchings in cubic graphs

[BibT_eX]

[DOI]

CoRR, 2008

5-cycles and the Petersen graph

[BibT_eX]

[DOI]

Matt DeVos

CoRR, 2008

2007

Problem 11305.

[BibT_eX]

[DOI]

Am. Math. Mon., 2007

A course on Combinatorial Algorithms

[BibT_eX]

[DOI]

CoRR, 2007

On a constructive characterization of a class of trees related to pairs of disjoint matchings

[BibT_eX]

[DOI]

Rafael R. Kamalian

CoRR, 2007

Two polynomial algorithms for special maximum matching constructing in trees

[BibT_eX]

[DOI]

Rafael R. Kamalian

CoRR, 2007

2006

On trees with a maximum proper partial 0-1 coloring containing a maximum matching.

[BibT_eX]

[DOI]

Discret. Math., 2006

A note on minimal matching covered graphs.

[BibT_eX]

[DOI]