default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArarat Harutyunyan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]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: 4-8 (2024)- [j29]Ararat Harutyunyan, Louisa Harutyunyan, Narek A. Hovhannisyan:
Coloring k-partite sparse digraphs. Discret. Appl. Math. 353: 1-3 (2024) - [j28]Ararat Harutyunyan, Michael Lampis
, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. Theory Comput. Syst. 68(4): 986-1013 (2024) - [j27]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling crosswords is very hard. Theor. Comput. Sci. 982: 114275 (2024) - [i8]Henrik Abgaryan, Ararat Harutyunyan, Tristan Cazenave:
LLMs can Schedule. CoRR abs/2408.06993 (2024) - 2023
- [c7]Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd Chromatic Number of Graph Classes. WG 2023: 44-58 - [i7]Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd Chromatic Number of Graph Classes. CoRR abs/2303.03225 (2023) - 2021
- [j26]Ararat Harutyunyan, Paul Horn, Jacques Verstraëte:
Independent dominating sets in graphs of girth five. Comb. Probab. Comput. 30(3): 344-359 (2021) - [j25]Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé:
Disproving the normal graph conjecture. J. Comb. Theory B 147: 238-251 (2021) - [c6]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords Is Very Hard. ISAAC 2021: 36:1-36:16 - [c5]Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. STACS 2021: 41:1-41:15 - [i6]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords is Very Hard. CoRR abs/2109.11203 (2021) - 2020
- [j24]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846: 14-26 (2020) - [c4]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: 32-47 - [i5]Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. CoRR abs/2010.06317 (2020)
2010 – 2019
- 2019
- [j23]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): 591-627 (2019) - [j22]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): 239-263 (2019) - [j21]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring Dense Digraphs. Comb. 39(5): 1021-1053 (2019) - [j20]Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos:
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28(2): 177-186 (2019) - [j19]Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu:
Coloring tournaments: From local to global. J. Comb. Theory B 138: 166-171 (2019) - [c3]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. WG 2019: 40-52 - [i4]Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for min dominating set. CoRR abs/1902.01874 (2019) - 2018
- [j18]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j17]Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le:
List coloring digraphs. J. Graph Theory 87(4): 492-508 (2018) - [i3]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR abs/1810.10940 (2018) - 2017
- [j16]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): 4 (2017) - [j15]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229: 64-81 (2017) - [j14]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring dense digraphs. Electron. Notes Discret. Math. 61: 577-583 (2017) - [j13]Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé:
A proof of the Barát-Thomassen conjecture. J. Comb. Theory B 124: 39-55 (2017) - [j12]Ararat Harutyunyan, Bojan Mohar:
Planar Digraphs of Digirth Five Are 2-Colorable. J. Graph Theory 84(4): 408-427 (2017) - 2016
- [j11]Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun:
Mapping planar graphs into the Coxeter graph. Discret. Math. 339(2): 839-849 (2016) - [j10]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) - [i2]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. CoRR abs/1607.04777 (2016) - 2015
- [j9]Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis:
Weak Balance in Random Signed Graphs. Internet Math. 11(2): 143-154 (2015) - [j8]Ararat Harutyunyan, Sylvain Legay:
Linear time algorithms for weighted offensive and powerful alliances in trees. Theor. Comput. Sci. 582: 17-26 (2015) - 2014
- [j7]Ararat Harutyunyan:
Global offensive alliances in graphs and random graphs. Discret. Appl. Math. 164: 522-526 (2014) - [j6]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. Discret. Appl. Math. 179: 229-234 (2014) - [i1]Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. CoRR abs/1401.4568 (2014) - 2013
- [j5]Ararat Harutyunyan:
Some bounds on global alliances in trees. Discret. Appl. Math. 161(12): 1739-1746 (2013) - 2012
- [j4]Ararat Harutyunyan, Bojan Mohar:
Two results on the digraph chromatic number. Discret. Math. 312(10): 1823-1826 (2012) - [j3]Ararat Harutyunyan, Bojan Mohar:
Planar Graphs Have Exponentially Many 3-Arboricities. SIAM J. Discret. Math. 26(3): 1269-1280 (2012) - 2011
- [j2]Ararat Harutyunyan, Bojan Mohar:
Strengthened Brooks' Theorem for Digraphs of Girth at least Three. Electron. J. Comb. 18(1) (2011) - [j1]Ararat Harutyunyan, Bojan Mohar:
Gallai's Theorem for List Coloring of Digraphs. SIAM J. Discret. Math. 25(1): 170-180 (2011) - 2010
- [c2]Ararat Harutyunyan:
A Fast Algorithm for Powerful Alliances in Trees. COCOA (1) 2010: 31-40 - [c1]Ararat Harutyunyan:
Some Bounds on Alliances in Trees. CTW 2010: 83-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 01:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
