Ararat Harutyunyan

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 31

Top Topics

Graph Theoretic

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

J. Comb. Theory, Ser. B

Publications

Ararat Harutyunyan, Louisa Harutyunyan, Narek A. Hovhannisyan
Coloring k-partite sparse digraphs. Discret. Appl. Math. 353 (2024)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling crosswords is very hard. Theor. Comput. Sci. 982 (2024)
Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. 345 (2024)
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
Odd Chromatic Number of Graph Classes. CoRR (2023)
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
Odd Chromatic Number of Graph Classes. WG (2023)
Ararat Harutyunyan, Paul Horn, Jacques Verstraëte
Independent dominating sets in graphs of girth five. Comb. Probab. Comput. 30 (3) (2021)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords Is Very Hard. ISAAC (2021)
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Digraph Coloring and Distance to Acyclicity. STACS (2021)
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords is Very Hard. CoRR (2021)
Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé
Disproving the normal graph conjecture. J. Comb. Theory, Ser. B 147 (2021)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846 (2020)
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Digraph Coloring and Distance to Acyclicity. CoRR (2020)
Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS (2020)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring Dense Digraphs. Comb. 39 (5) (2019)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. WG (2019)
Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu
Coloring tournaments: From local to global. J. Comb. Theory, Ser. B 138 (2019)
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28 (2) (2019)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Comb. 39 (2) (2019)
Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos
Average-case complexity of a branch-and-bound algorithm for min dominating set. CoRR (2019)
Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski
Local envy-freeness in house allocation problems. Auton. Agents Multi Agent Syst. 33 (5) (2019)
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le
List coloring digraphs. J. Graph Theory 87 (4) (2018)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25 (3) (2018)
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR (2018)
Ararat Harutyunyan, Bojan Mohar
Planar Digraphs of Digirth Five Are 2-Colorable. J. Graph Theory 84 (4) (2017)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
A proof of the Barát-Thomassen conjecture. J. Comb. Theory, Ser. B 124 (2017)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229 (2017)
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol
Disjoint Cycles of Different Lengths in Graphs and Digraphs. Electron. J. Comb. 24 (4) (2017)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring dense digraphs. Electron. Notes Discret. Math. 61 (2017)
Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis
Connected Tropical Subgraphs in Vertex-Colored Graphs. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. CoRR (2016)
Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun
Mapping planar graphs into the Coxeter graph. Discret. Math. 339 (2) (2016)
Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis
Weak Balance in Random Signed Graphs. Internet Math. 11 (2) (2015)
Ararat Harutyunyan, Sylvain Legay
Linear time algorithms for weighted offensive and powerful alliances in trees. Theor. Comput. Sci. 582 (2015)
Ararat Harutyunyan
Global offensive alliances in graphs and random graphs. Discret. Appl. Math. 164 (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179 (2014)
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
Strong edge-colouring of sparse planar graphs. CoRR (2014)
Ararat Harutyunyan
Some bounds on global alliances in trees. Discret. Appl. Math. 161 (12) (2013)
Ararat Harutyunyan, Bojan Mohar
Planar Graphs Have Exponentially Many 3-Arboricities. SIAM J. Discret. Math. 26 (3) (2012)
Ararat Harutyunyan, Bojan Mohar
Two results on the digraph chromatic number. Discret. Math. 312 (10) (2012)
Ararat Harutyunyan, Bojan Mohar
Gallai's Theorem for List Coloring of Digraphs. SIAM J. Discret. Math. 25 (1) (2011)
Ararat Harutyunyan, Bojan Mohar
Strengthened Brooks' Theorem for Digraphs of Girth at least Three. Electron. J. Comb. 18 (1) (2011)
Ararat Harutyunyan
A Fast Algorithm for Powerful Alliances in Trees. COCOA (1) (2010)
Ararat Harutyunyan
Some Bounds on Alliances in Trees. CTW (2010)