Ararat Harutyunyan

54 papers A 1B 3C 1Journal 44Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bounds on broadcast time in well-connected graphs.
Discret. Appl. Math.
Ararat Harutyunyan, Hovhannes A. Harutyunyan, Aram Khanlari
2025 J jnl
(Δ-1)-dicolouring of digraphs.
CoRR
Ararat Harutyunyan, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta, Gil Puig i Surroca
2025 J jnl
ACCORD: Autoregressive Constraint-satisfying Generation for COmbinatorial Optimization with Routing and Dynamic attention.
CoRR
Henrik Abgaryan, Tristan Cazenave, Ararat Harutyunyan
2025 — conf
Automated Refutation with Monte Carlo Search of Graph Theory Conjectures on the Maximum Laplacian Eigenvalue.
LION (1)
Liora Taieb, Milo Roucairol, Tristan Cazenave, Ararat Harutyunyan
2025 J jnl
Colouring Complete Multipartite and Kneser-Type Digraphs.
Electron. J. Comb.
Ararat Harutyunyan, Gil Puig i Surroca
2025 J jnl
Odd chromatic number of graph classes.
J. Graph Theory
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
2025 — conf
SchedulExpert: Graph Attention Meets Mixture-of-Experts for JSSP.
LION (1)
Henrik Abgaryan, Tristan Cazenave, Ararat Harutyunyan
2025 J jnl
Starjob: Dataset for LLM-Driven Job Shop Scheduling.
CoRR
Henrik Abgaryan, Tristan Cazenave, Ararat Harutyunyan
2024 J jnl
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.
Discret. Appl. Math.
Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos
2024 J jnl
Coloring k-partite sparse digraphs.
Discret. Appl. Math.
Ararat Harutyunyan, Louisa Harutyunyan, Narek A. Hovhannisyan
2024 J jnl
Digraph Coloring and Distance to Acyclicity.
Theory Comput. Syst.
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024 J jnl
Filling crosswords is very hard.
Theor. Comput. Sci.
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024 J jnl
LLMs can Schedule.
CoRR
Henrik Abgaryan, Ararat Harutyunyan, Tristan Cazenave
2024 — conf
Randomized Greedy Sampling for JSSP.
LION
Henrik Abgaryan, Ararat Harutyunyan, Tristan Cazenave
2023 B conf
Odd Chromatic Number of Graph Classes.
WG
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
2023 J jnl
Odd Chromatic Number of Graph Classes.
CoRR
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
2021 A conf
Digraph Coloring and Distance to Acyclicity.
STACS
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 J jnl
Disproving the normal graph conjecture.
J. Comb. Theory B
Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé
2021 B conf
Filling Crosswords Is Very Hard.
ISAAC
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 J jnl
Filling Crosswords is Very Hard.
CoRR
Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021 J jnl
Independent dominating sets in graphs of girth five.
Comb. Probab. Comput.
Ararat Harutyunyan, Paul Horn, Jacques Verstraëte
2020 J jnl
Digraph Coloring and Distance to Acyclicity.
CoRR
Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2020 J jnl
Maximum independent sets in subcubic graphs: New results.
Theor. Comput. Sci.
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2020 — conf
On the Complexity of the Upper r-Tolerant Edge Cover Problem.
TTCS
Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2019 J jnl
Average-case complexity of a branch-and-bound algorithm for min dominating set.
CoRR
Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos
2019 J jnl
Coloring Dense Digraphs.
Comb.
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
2019 J jnl
Coloring tournaments: From local to global.
J. Comb. Theory B
Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu
2019 J jnl
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture.
Comb.
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
2019 J jnl
Exact Distance Colouring in Trees.
Comb. Probab. Comput.
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos
2019 J jnl
Local envy-freeness in house allocation problems.
Auton. Agents Multi Agent Syst.
Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski
2019 B conf
Maximum Independent Sets in Subcubic Graphs: New Results.
WG
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2018 J jnl
Domination and Fractional Domination in Digraphs.
Electron. J. Comb.
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
2018 J jnl
List coloring digraphs.
J. Graph Theory
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le
2018 J jnl
Maximum Independent Sets in Subcubic Graphs: New Results.
CoRR
Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2017 J jnl
A proof of the Barát-Thomassen conjecture.
J. Comb. Theory B
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
2017 J jnl
Coloring dense digraphs.
Electron. Notes Discret. Math.
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
2017 J jnl
Disjoint Cycles of Different Lengths in Graphs and Digraphs.
Electron. J. Comb.
Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol
2017 J jnl
Planar Digraphs of Digirth Five Are 2-Colorable.
J. Graph Theory
Ararat Harutyunyan, Bojan Mohar
2017 J jnl
The complexity of tropical graph homomorphisms.
Discret. Appl. Math.
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2016 J jnl
Connected Tropical Subgraphs in Vertex-Colored Graphs.
Discret. Math. Theor. Comput. Sci.
Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis
2016 J jnl
Mapping planar graphs into the Coxeter graph.
Discret. Math.
Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun
2016 J jnl
The complexity of tropical graph homomorphisms.
CoRR
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2015 J jnl
Linear time algorithms for weighted offensive and powerful alliances in trees.
Theor. Comput. Sci.
Ararat Harutyunyan, Sylvain Legay
2015 J jnl
Weak Balance in Random Signed Graphs.
Internet Math.
Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis
2014 J jnl
Global offensive alliances in graphs and random graphs.
Discret. Appl. Math.
Ararat Harutyunyan
2014 J jnl
Strong edge-colouring of sparse planar graphs.
CoRR
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
2014 J jnl
Strong edge-colouring of sparse planar graphs.
Discret. Appl. Math.
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov
2013 J jnl
Some bounds on global alliances in trees.
Discret. Appl. Math.
Ararat Harutyunyan
2012 J jnl
Planar Graphs Have Exponentially Many 3-Arboricities.
SIAM J. Discret. Math.
Ararat Harutyunyan, Bojan Mohar
2012 J jnl
Two results on the digraph chromatic number.
Discret. Math.
Ararat Harutyunyan, Bojan Mohar
2011 J jnl
Gallai's Theorem for List Coloring of Digraphs.
SIAM J. Discret. Math.
Ararat Harutyunyan, Bojan Mohar
2011 J jnl
Strengthened Brooks' Theorem for Digraphs of Girth at least Three.
Electron. J. Comb.
Ararat Harutyunyan, Bojan Mohar
2010 — conf
A Fast Algorithm for Powerful Alliances in Trees.
COCOA (1)
Ararat Harutyunyan
2010 C conf
Some Bounds on Alliances in Trees.
CTW
Ararat Harutyunyan