Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ararat Harutyunyan
@article{DBLP:journals/dam/DenatHMP24,
author = {Tom Denat and
Ararat Harutyunyan and
Nikolaos Melissinos and
Vangelis Th. Paschos},
title = {Average-case complexity of a branch-and-bound algorithm for Min Dominating
Set},
journal = {Discret. Appl. Math.},
volume = {345},
pages = {4--8},
year = {2024},
url = {https://doi.org/10.1016/j.dam.2023.11.021},
doi = {10.1016/J.DAM.2023.11.021},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DenatHMP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GourvesHLM24,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Filling crosswords is very hard},
journal = {Theor. Comput. Sci.},
volume = {982},
pages = {114275},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114275},
doi = {10.1016/J.TCS.2023.114275},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GourvesHLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BelmonteHKM23,
author = {R{\'{e}}my Belmonte and
Ararat Harutyunyan and
Noleen K{\"{o}}hler and
Nikolaos Melissinos},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Odd Chromatic Number of Graph Classes},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {44--58},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_4},
doi = {10.1007/978-3-031-43380-1\_4},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BelmonteHKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-03225,
author = {R{\'{e}}my Belmonte and
Ararat Harutyunyan and
Noleen K{\"{o}}hler and
Nikolaos Melissinos},
title = {Odd Chromatic Number of Graph Classes},
journal = {CoRR},
volume = {abs/2303.03225},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.03225},
doi = {10.48550/ARXIV.2303.03225},
eprinttype = {arXiv},
eprint = {2303.03225},
timestamp = {Tue, 14 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-03225.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HarutyunyanHV21,
author = {Ararat Harutyunyan and
Paul Horn and
Jacques Verstra{\"{e}}te},
title = {Independent dominating sets in graphs of girth five},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {3},
pages = {344--359},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000279},
doi = {10.1017/S0963548320000279},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HarutyunyanHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/HarutyunyanPT21,
author = {Ararat Harutyunyan and
Lucas Pastor and
St{\'{e}}phan Thomass{\'{e}}},
title = {Disproving the normal graph conjecture},
journal = {J. Comb. Theory, Ser. {B}},
volume = {147},
pages = {238--251},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2020.04.001},
doi = {10.1016/J.JCTB.2020.04.001},
timestamp = {Mon, 11 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/HarutyunyanPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GourvesHLM21,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Filling Crosswords Is Very Hard},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {36:1--36:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.36},
doi = {10.4230/LIPICS.ISAAC.2021.36},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GourvesHLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HarutyunyanLM21,
author = {Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Digraph Coloring and Distance to Acyclicity},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {41:1--41:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.41},
doi = {10.4230/LIPICS.STACS.2021.41},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HarutyunyanLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-11203,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Filling Crosswords is Very Hard},
journal = {CoRR},
volume = {abs/2109.11203},
year = {2021},
url = {https://arxiv.org/abs/2109.11203},
eprinttype = {arXiv},
eprint = {2109.11203},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-11203.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HarutyunyanLLM20,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Maximum independent sets in subcubic graphs: New results},
journal = {Theor. Comput. Sci.},
volume = {846},
pages = {14--26},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.010},
doi = {10.1016/J.TCS.2020.09.010},
timestamp = {Wed, 04 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HarutyunyanLLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ttcs/HarutyunyanGMMP20,
author = {Ararat Harutyunyan and
Mehdi Khosravian Ghadikolaei and
Nikolaos Melissinos and
J{\'{e}}r{\^{o}}me Monnot and
Aris Pagourtzis},
editor = {Lu{\'{\i}}s Soares Barbosa and
Mohammad Ali Abam},
title = {On the Complexity of the Upper r-Tolerant Edge Cover Problem},
booktitle = {Topics in Theoretical Computer Science - Third {IFIP} {WG} 1.8 International
Conference, {TTCS} 2020, Tehran, Iran, July 1-2, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12281},
pages = {32--47},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-57852-7\_3},
doi = {10.1007/978-3-030-57852-7\_3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ttcs/HarutyunyanGMMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-06317,
author = {Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
title = {Digraph Coloring and Distance to Acyclicity},
journal = {CoRR},
volume = {abs/2010.06317},
year = {2020},
url = {https://arxiv.org/abs/2010.06317},
eprinttype = {arXiv},
eprint = {2010.06317},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-06317.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/BeynierCGHLMW19,
author = {Aur{\'{e}}lie Beynier and
Yann Chevaleyre and
Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Julien Lesca and
Nicolas Maudet and
Ana{\"{e}}lle Wilczynski},
title = {Local envy-freeness in house allocation problems},
journal = {Auton. Agents Multi Agent Syst.},
volume = {33},
number = {5},
pages = {591--627},
year = {2019},
url = {https://doi.org/10.1007/s10458-019-09417-x},
doi = {10.1007/S10458-019-09417-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aamas/BeynierCGHLMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BensmailHLT19,
author = {Julien Bensmail and
Ararat Harutyunyan and
Tien{-}Nam Le and
St{\'{e}}phan Thomass{\'{e}}},
title = {Edge-Partitioning a Graph into Paths: Beyond the Bar{\'{a}}t-Thomassen
Conjecture},
journal = {Comb.},
volume = {39},
number = {2},
pages = {239--263},
year = {2019},
url = {https://doi.org/10.1007/s00493-017-3661-5},
doi = {10.1007/S00493-017-3661-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BensmailHLT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HarutyunyanLNT19,
author = {Ararat Harutyunyan and
Tien{-}Nam Le and
Alantha Newman and
St{\'{e}}phan Thomass{\'{e}}},
title = {Coloring Dense Digraphs},
journal = {Comb.},
volume = {39},
number = {5},
pages = {1021--1053},
year = {2019},
url = {https://doi.org/10.1007/s00493-019-3815-8},
doi = {10.1007/S00493-019-3815-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HarutyunyanLNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BousquetEHV19,
author = {Nicolas Bousquet and
Louis Esperet and
Ararat Harutyunyan and
R{\'{e}}mi de Joannis de Verclos},
title = {Exact Distance Colouring in Trees},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {177--186},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000378},
doi = {10.1017/S0963548318000378},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BousquetEHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HarutyunyanLTW19,
author = {Ararat Harutyunyan and
Tien{-}Nam Le and
St{\'{e}}phan Thomass{\'{e}} and
Hehui Wu},
title = {Coloring tournaments: From local to global},
journal = {J. Comb. Theory, Ser. {B}},
volume = {138},
pages = {166--171},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2019.01.005},
doi = {10.1016/J.JCTB.2019.01.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/HarutyunyanLTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HarutyunyanLLM19,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {40--52},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_4},
doi = {10.1007/978-3-030-30786-8\_4},
timestamp = {Tue, 29 Dec 2020 18:38:49 +0100},
biburl = {https://dblp.org/rec/conf/wg/HarutyunyanLLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-01874,
author = {Tom Denat and
Ararat Harutyunyan and
Vangelis Th. Paschos},
title = {Average-case complexity of a branch-and-bound algorithm for min dominating
set},
journal = {CoRR},
volume = {abs/1902.01874},
year = {2019},
url = {http://arxiv.org/abs/1902.01874},
eprinttype = {arXiv},
eprint = {1902.01874},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-01874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HarutyunyanLNT18,
author = {Ararat Harutyunyan and
Tien{-}Nam Le and
Alantha Newman and
St{\'{e}}phan Thomass{\'{e}}},
title = {Domination and Fractional Domination in Digraphs},
journal = {Electron. J. Comb.},
volume = {25},
number = {3},
pages = {3},
year = {2018},
url = {https://doi.org/10.37236/7211},
doi = {10.37236/7211},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HarutyunyanLNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BensmailHL18,
author = {Julien Bensmail and
Ararat Harutyunyan and
Ngoc{-}Khang Le},
title = {List coloring digraphs},
journal = {J. Graph Theory},
volume = {87},
number = {4},
pages = {492--508},
year = {2018},
url = {https://doi.org/10.1002/jgt.22170},
doi = {10.1002/JGT.22170},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BensmailHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10940,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
journal = {CoRR},
volume = {abs/1810.10940},
year = {2018},
url = {http://arxiv.org/abs/1810.10940},
eprinttype = {arXiv},
eprint = {1810.10940},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10940.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BensmailHLLL17,
author = {Julien Bensmail and
Ararat Harutyunyan and
Ngoc{-}Khang Le and
Binlong Li and
Nicolas Lichiardopol},
title = {Disjoint Cycles of Different Lengths in Graphs and Digraphs},
journal = {Electron. J. Comb.},
volume = {24},
number = {4},
pages = {4},
year = {2017},
url = {https://doi.org/10.37236/6921},
doi = {10.37236/6921},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BensmailHLLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FoucaudHHLMN17,
author = {Florent Foucaud and
Ararat Harutyunyan and
Pavol Hell and
Sylvain Legay and
Yannis Manoussakis and
Reza Naserasr},
title = {The complexity of tropical graph homomorphisms},
journal = {Discret. Appl. Math.},
volume = {229},
pages = {64--81},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.04.027},
doi = {10.1016/J.DAM.2017.04.027},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FoucaudHHLMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HarutyunyanLNT17,
author = {Ararat Harutyunyan and
Tien{-}Nam Le and
Alantha Newman and
St{\'{e}}phan Thomass{\'{e}}},
title = {Coloring dense digraphs},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {577--583},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.07.010},
doi = {10.1016/J.ENDM.2017.07.010},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HarutyunyanLNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BensmailHLMT17,
author = {Julien Bensmail and
Ararat Harutyunyan and
Tien{-}Nam Le and
Martin Merker and
St{\'{e}}phan Thomass{\'{e}}},
title = {A proof of the Bar{\'{a}}t-Thomassen conjecture},
journal = {J. Comb. Theory, Ser. {B}},
volume = {124},
pages = {39--55},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2016.12.006},
doi = {10.1016/J.JCTB.2016.12.006},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BensmailHLMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HarutyunyanM17,
author = {Ararat Harutyunyan and
Bojan Mohar},
title = {Planar Digraphs of Digirth Five Are 2-Colorable},
journal = {J. Graph Theory},
volume = {84},
number = {4},
pages = {408--427},
year = {2017},
url = {https://doi.org/10.1002/jgt.22032},
doi = {10.1002/JGT.22032},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HarutyunyanM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HarutyunyanNPSS16,
author = {Ararat Harutyunyan and
Reza Naserasr and
Mirko Petrusevski and
Riste Skrekovski and
Qiang Sun},
title = {Mapping planar graphs into the Coxeter graph},
journal = {Discret. Math.},
volume = {339},
number = {2},
pages = {839--849},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.10.007},
doi = {10.1016/J.DISC.2015.10.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HarutyunyanNPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/dAuriacCMHLM16,
author = {Jean{-}Alexandre Angl{\`{e}}s d'Auriac and
Nathann Cohen and
Hakim El Mafthoui and
Ararat Harutyunyan and
Sylvain Legay and
Yannis Manoussakis},
title = {Connected Tropical Subgraphs in Vertex-Colored Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {3},
year = {2016},
url = {https://doi.org/10.46298/dmtcs.2151},
doi = {10.46298/DMTCS.2151},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/dAuriacCMHLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FoucaudHHLMN16,
author = {Florent Foucaud and
Ararat Harutyunyan and
Pavol Hell and
Sylvain Legay and
Yannis Manoussakis and
Reza Naserasr},
title = {The complexity of tropical graph homomorphisms},
journal = {CoRR},
volume = {abs/1607.04777},
year = {2016},
url = {http://arxiv.org/abs/1607.04777},
eprinttype = {arXiv},
eprint = {1607.04777},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FoucaudHHLMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/MaftouhiHM15,
author = {Abdelhakim El Maftouhi and
Ararat Harutyunyan and
Yannis Manoussakis},
title = {Weak Balance in Random Signed Graphs},
journal = {Internet Math.},
volume = {11},
number = {2},
pages = {143--154},
year = {2015},
url = {https://doi.org/10.1080/15427951.2014.912994},
doi = {10.1080/15427951.2014.912994},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/MaftouhiHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HarutyunyanL15,
author = {Ararat Harutyunyan and
Sylvain Legay},
title = {Linear time algorithms for weighted offensive and powerful alliances
in trees},
journal = {Theor. Comput. Sci.},
volume = {582},
pages = {17--26},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.017},
doi = {10.1016/J.TCS.2015.03.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HarutyunyanL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Harutyunyan14,
author = {Ararat Harutyunyan},
title = {Global offensive alliances in graphs and random graphs},
journal = {Discret. Appl. Math.},
volume = {164},
pages = {522--526},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.08.018},
doi = {10.1016/J.DAM.2013.08.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Harutyunyan14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BensmailHHV14,
author = {Julien Bensmail and
Ararat Harutyunyan and
Herv{\'{e}} Hocquard and
Petru Valicov},
title = {Strong edge-colouring of sparse planar graphs},
journal = {Discret. Appl. Math.},
volume = {179},
pages = {229--234},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.07.006},
doi = {10.1016/J.DAM.2014.07.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BensmailHHV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BensmailHHV14,
author = {Julien Bensmail and
Ararat Harutyunyan and
Herv{\'{e}} Hocquard and
Petru Valicov},
title = {Strong edge-colouring of sparse planar graphs},
journal = {CoRR},
volume = {abs/1401.4568},
year = {2014},
url = {http://arxiv.org/abs/1401.4568},
eprinttype = {arXiv},
eprint = {1401.4568},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BensmailHHV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Harutyunyan13,
author = {Ararat Harutyunyan},
title = {Some bounds on global alliances in trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1739--1746},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.11.026},
doi = {10.1016/J.DAM.2011.11.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Harutyunyan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HarutyunyanM12,
author = {Ararat Harutyunyan and
Bojan Mohar},
title = {Two results on the digraph chromatic number},
journal = {Discret. Math.},
volume = {312},
number = {10},
pages = {1823--1826},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.01.028},
doi = {10.1016/J.DISC.2012.01.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HarutyunyanM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HarutyunyanM12,
author = {Ararat Harutyunyan and
Bojan Mohar},
title = {Planar Graphs Have Exponentially Many 3-Arboricities},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {3},
pages = {1269--1280},
year = {2012},
url = {https://doi.org/10.1137/110846828},
doi = {10.1137/110846828},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HarutyunyanM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HarutyunyanM11,
author = {Ararat Harutyunyan and
Bojan Mohar},
title = {Strengthened Brooks' Theorem for Digraphs of Girth at least Three},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/682},
doi = {10.37236/682},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HarutyunyanM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HarutyunyanM11,
author = {Ararat Harutyunyan and
Bojan Mohar},
title = {Gallai's Theorem for List Coloring of Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {1},
pages = {170--180},
year = {2011},
url = {https://doi.org/10.1137/100803870},
doi = {10.1137/100803870},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HarutyunyanM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/Harutyunyan10,
author = {Ararat Harutyunyan},
editor = {Weili Wu and
Ovidiu Daescu},
title = {A Fast Algorithm for Powerful Alliances in Trees},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6508},
pages = {31--40},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17458-2\_4},
doi = {10.1007/978-3-642-17458-2\_4},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/Harutyunyan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Harutyunyan10,
author = {Ararat Harutyunyan},
editor = {Ulrich Faigle and
Rainer Schrader and
Daniel Herrmann},
title = {Some Bounds on Alliances in Trees},
booktitle = {9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Cologne, Germany, May 25-27, 2010. Extended Abstracts},
pages = {83--86},
year = {2010},
timestamp = {Tue, 09 Nov 2010 19:12:38 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/Harutyunyan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:50 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:
