We stand with Ukraine  

Hayk Grigoryan

Orcid: 0000-0003-2829-2482

Affiliations:
  • Concordia University, Department of Computer Science and Software Engineering, Montreal, QC, Canada


According to our database1, Hayk Grigoryan authored at least 5 papers between 2013 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
The shortest path problem in the Knödel graph.
[BibTeX]
[DOI]
Hayk Grigoryan
,
Hovhannes A. Harutyunyan
J. Discrete Algorithms, 2015

2014
Diametral broadcast graphs.
[BibTeX]
[DOI]
Hayk Grigoryan
,
Hovhannes A. Harutyunyan
Discret. Appl. Math., 2014

Tight lower bounds on broadcast function for n=24 and 25.
[BibTeX]
[DOI]
Georgy Barsky
,
Hayk Grigoryan
,
Hovhannes A. Harutyunyan
Discret. Appl. Math., 2014

New Lower Bounds on Broadcast Function.
[BibTeX]
[DOI]
Hayk Grigoryan
,
Hovhannes A. Harutyunyan
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Tight Bound on the Diameter of the Knödel Graph.
[BibTeX]
[DOI]
Hayk Grigoryan
,
Hovhannes A. Harutyunyan
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013


  Loading...