E-LIB Suche - Ergebnisse für: Harutyunyan, Ararat

1

Average-case complexity of a branch-and-bound algorithm for..:

Denat, Tom ; Harutyunyan, Ararat ; Melissinos, Nikolaos.
Discrete Applied Mathematics. 345 (2024) - p. 4-8 , 2024

2

Coloring k-partite sparse digraphs:

Harutyunyan, Ararat ; Harutyunyan, Louisa ; Hovhannisyan, Narek
Discrete Applied Mathematics. 353 (2024) - p. 1-3 , 2024

Link: https://doi.org/10.1016/..

3

Filling crosswords is very hard:

Gourvès, Laurent ; Harutyunyan, Ararat ; Lampis, Michael.
Theoretical Computer Science. 982 (2024) - p. 114275 , 2024

Link: https://doi.org/10.1016/..

4

Odd Chromatic Number of Graph Classes:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Belmonte, Rémy ; Harutyunyan, Ararat ; Köhler, Noleen. - p. 44-58 , 2023

Link: https://doi.org/10.1007/..

5

Digraph Coloring and Distance to Acyclicity:

Harutyunyan, Ararat ; Lampis, Michael ; Melissinos, Nikolaos
Theory of Computing Systems. , 2022

Link: https://doi.org/10.1007/..

6

Disproving the normal graph conjecture:

Harutyunyan, Ararat ; Pastor, Lucas ; Thomassé, Stéphan
Journal of Combinatorial Theory, Series B. 147 (2021) - p. 238-251 , 2021

Link: https://doi.org/10.1016/..

7

On the Complexity of the Upper r-Tolerant Edge Cover Proble:

, In: Topics in Theoretical Computer Science; Lecture Notes in Computer Science,

Harutyunyan, Ararat ; Ghadikolaei, Mehdi Khosravian ; Melissinos, Nikolaos.. - p. 32-47 , 2020

Link: https://doi.org/10.1007/..

8

Independent dominating sets in graphs of girth five:

Harutyunyan, Ararat ; Horn, Paul ; Verstraete, Jacques
Combinatorics, Probability and Computing. 30 (2020) 3 - p. 344-359 , 2020

Link: https://doi.org/10.1017/..

9

Maximum Independent Sets in Subcubic Graphs: New Results:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Harutyunyan, Ararat ; Lampis, Michael ; Lozin, Vadim. - p. 40-52 , 2019

Link: https://doi.org/10.1007/..

10

Coloring Dense Digraphs:

Harutyunyan, Ararat ; Le, Tien-Nam ; Newman, Alantha.
Combinatorica. 39 (2019) 5 - p. 1021-1053 , 2019

Link: https://doi.org/10.1007/..

11

Coloring tournaments: From local to global:

Harutyunyan, Ararat ; Le, Tien-Nam ; Thomassé, Stéphan.
Journal of Combinatorial Theory, Series B. 138 (2019) - p. 166-171 , 2019

Link: https://doi.org/10.1016/..

12

Local envy-freeness in house allocation problems:

Beynier, Aurélie ; Chevaleyre, Yann ; Gourvès, Laurent...
Autonomous Agents and Multi-Agent Systems. 33 (2019) 5 - p. 591-627 , 2019

Link: https://doi.org/10.1007/..

13

Exact Distance Colouring in Trees:

BOUSQUET, NICOLAS ; ESPERET, LOUIS ; HARUTYUNYAN, ARARAT.
Combinatorics, Probability and Computing. 28 (2018) 2 - p. 177-186 , 2018

Link: https://doi.org/10.1017/..

14

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

Bensmail, Julien ; Harutyunyan, Ararat ; Le, Tien-Nam.
Combinatorica. 39 (2018) 2 - p. 239-263 , 2018

Link: https://doi.org/10.1007/..

15

List coloring digraphs:

Bensmail, Julien ; Harutyunyan, Ararat ; Le, Ngoc Khang
Journal of Graph Theory. 87 (2017) 4 - p. 492-508 , 2017

Link: https://doi.org/10.1002/..