Folgen
Ararat Harutyunyan
Ararat Harutyunyan
Professor of Computer Science, Paris Dauphine University
Bestätigte E-Mail-Adresse bei dauphine.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Local envy-freeness in house allocation problems
A Beynier, Y Chevaleyre, L Gourvès, A Harutyunyan, J Lesca, N Maudet, ...
Autonomous Agents and Multi-Agent Systems 33, 591-627, 2019
432019
Two results on the digraph chromatic number
A Harutyunyan, B Mohar
Discrete Mathematics 312 (10), 1823-1826, 2012
362012
Strong edge-colouring of sparse planar graphs
J Bensmail, A Harutyunyan, H Hocquard, P Valicov
Discrete Applied Mathematics 179, 229-234, 2014
342014
Gallai's theorem for list coloring of digraphs
A Harutyunyan, B Mohar
SIAM Journal on Discrete Mathematics 25 (1), 170-180, 2011
252011
Strengthened Brooks Theorem for digraphs of girth three
A Harutyunyan, B Mohar
arXiv preprint arXiv:1110.4896, 2011
232011
List coloring digraphs
J Bensmail, A Harutyunyan, NK Le
Journal of Graph Theory 87 (4), 492-508, 2018
212018
Brooks-type results for coloring of digraphs
A Harutyunyan
Simon Fraser University, 2011
212011
A proof of the Barát–Thomassen conjecture
J Bensmail, A Harutyunyan, TN Le, M Merker, S Thomassé
Journal of Combinatorial Theory, Series B 124, 39-55, 2017
202017
Planar digraphs of digirth five are 2‐colorable
A Harutyunyan, B Mohar
Journal of Graph Theory 84 (4), 408-427, 2017
152017
Uniquely D-colourable Digraphs with Large Girth
A Harutyunyan, PM Kayll, B Mohar, L Rafferty
Canadian Journal of Mathematics 64 (6), 1310-1328, 2012
152012
Coloring tournaments: From local to global
A Harutyunyan, TN Le, S Thomassé, H Wu
Journal of Combinatorial Theory, Series B 138, 166-171, 2019
142019
Connected tropical subgraphs in vertex-colored graphs
JAA d'Auriac, N Cohen, H El Mafthoui, A Harutyunyan, S Legay, ...
Discrete Mathematics and Theoretical Computer Science 17 (3), 327-348, 2016
122016
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
J Bensmail, A Harutyunyan, TN Le, S Thomassé
Combinatorica 39 (2), 239-263, 2019
112019
Exact distance colouring in trees
N Bousquet, L Esperet, A Harutyunyan, RJ de Verclos
Combinatorics, Probability and Computing 28 (2), 177-186, 2019
112019
Coloring dense digraphs
A Harutyunyan, TN Le, A Newman, S Thomassé
Combinatorica 39, 1021-1053, 2019
82019
Some bounds on global alliances in trees
A Harutyunyan
Discrete Applied Mathematics 161 (12), 1739-1746, 2013
82013
Tropical homomorphisms in vertex-coloured graphs
F Foucaud, A Harutyunyan, P Hell, S Legay, Y Manoussakis, R Naserasr
Unpublished results, 2017
72017
Global offensive alliances in graphs and random graphs
A Harutyunyan
Discrete Applied Mathematics 164, 522-526, 2014
62014
Some Bounds on Alliances in Trees.
A Harutyunyan
CTW, 83-86, 2010
62010
A fast algorithm for powerful alliances in trees
A Harutyunyan
Combinatorial Optimization and Applications: 4th International Conference …, 2010
62010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20