Ararat Harutyunyan

According to our database, Ararat Harutyunyan authored at least 33 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.

Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos

Discret. Appl. Math., March, 2024

Filling crosswords is very hard.

Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos

Theor. Comput. Sci., January, 2024

2023

Odd Chromatic Number of Graph Classes.

Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2021

Disproving the normal graph conjecture.

Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé

J. Comb. Theory, Ser. B, 2021

Independent dominating sets in graphs of girth five.

Ararat Harutyunyan, Paul Horn, Jacques Verstraëte

Comb. Probab. Comput., 2021

Digraph Coloring and Distance to Acyclicity.

Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020

Maximum independent sets in subcubic graphs: New results.

Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot

Theor. Comput. Sci., 2020

On the Complexity of the Upper r-Tolerant Edge Cover Problem.

Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis

Proceedings of the Topics in Theoretical Computer Science, 2020

2019

Coloring tournaments: From local to global.

Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu

J. Comb. Theory, Ser. B, 2019

Exact Distance Colouring in Trees.

Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos

Comb. Probab. Comput., 2019

Average-case complexity of a branch-and-bound algorithm for min dominating set.

Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos

CoRR, 2019

Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture.

Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé

Comb., 2019

Local envy-freeness in house allocation problems.

Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski

Auton. Agents Multi Agent Syst., 2019

2018

List coloring digraphs.

Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le

J. Graph Theory, 2018

Domination and Fractional Domination in Digraphs.

Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé

Electron. J. Comb., 2018

2017

Planar Digraphs of Digirth Five Are 2-Colorable.

Ararat Harutyunyan, Bojan Mohar

J. Graph Theory, 2017

A proof of the Barát-Thomassen conjecture.

Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé

J. Comb. Theory, Ser. B, 2017

Coloring dense digraphs.

Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé

Electron. Notes Discret. Math., 2017

The complexity of tropical graph homomorphisms.

Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr

Discret. Appl. Math., 2017

Disjoint Cycles of Different Lengths in Graphs and Digraphs.

Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol

Electron. J. Comb., 2017

2016

Connected Tropical Subgraphs in Vertex-Colored Graphs.

Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis

Discret. Math. Theor. Comput. Sci., 2016

Mapping planar graphs into the Coxeter graph.

Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun

Discret. Math., 2016

2015

Linear time algorithms for weighted offensive and powerful alliances in trees.

Ararat Harutyunyan, Sylvain Legay

Theor. Comput. Sci., 2015

Weak Balance in Random Signed Graphs.

Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis

Internet Math., 2015

2014

Global offensive alliances in graphs and random graphs.

Ararat Harutyunyan

Discret. Appl. Math., 2014

Strong edge-colouring of sparse planar graphs.

Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov

Discret. Appl. Math., 2014

2013

Some bounds on global alliances in trees.

Ararat Harutyunyan

Discret. Appl. Math., 2013

2012

Planar Graphs Have Exponentially Many 3-Arboricities.

Ararat Harutyunyan, Bojan Mohar

SIAM J. Discret. Math., 2012

Two results on the digraph chromatic number.

Ararat Harutyunyan, Bojan Mohar

Discret. Math., 2012

2011

Gallai's Theorem for List Coloring of Digraphs.

Ararat Harutyunyan, Bojan Mohar

SIAM J. Discret. Math., 2011

Strengthened Brooks' Theorem for Digraphs of Girth at least Three.

Ararat Harutyunyan, Bojan Mohar

Electron. J. Comb., 2011

2010

Some Bounds on Alliances in Trees.

Ararat Harutyunyan

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

A Fast Algorithm for Powerful Alliances in Trees.

Ararat Harutyunyan

Proceedings of the Combinatorial Optimization and Applications, 2010