default search action
Hovhannes A. Harutyunyan
Person information
- affiliation: Concordia University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Aria Adibi, Hovhannes A. Harutyunyan:
Messy Broadcasting in Grid. Algorithms 17(7): 310 (2024) - [j31]Saber Gholami, Hovhannes A. Harutyunyan:
A Note to Non-adaptive Broadcasting. Parallel Process. Lett. 34(1): 2340017:1-2340017:19 (2024) - [c67]Akash Ambashankar, Hovhannes A. Harutyunyan:
Broadcasting in Stars of Cliques. IWOCA 2024: 485-496 - [c66]Pierre Fraigniaud, Hovhannes A. Harutyunyan:
Source-Oblivious Broadcast. TAMC 2024: 137-148 - 2023
- [j30]Hovhannes A. Harutyunyan, Zhiyuan Li:
Broadcast graphs using new dimensional broadcast schemes for Knödel graphs. Discret. Appl. Math. 336: 56-67 (2023) - [j29]Saber Gholami, Hovhannes A. Harutyunyan:
HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm. J. Commun. Networks 25(1): 88-110 (2023) - [j28]Mohammad Saber Gholami, Hovhannes A. Harutyunyan, Edward Maraachlian:
Optimal Broadcasting in Fully Connected Trees. J. Interconnect. Networks 23(1): 2150037:1-2150037:20 (2023) - [c65]Hovhannes A. Harutyunyan, Narek A. Hovhannisyan:
Efficient Heuristic for Broadcasting in Chordal Networks. AINA (1) 2023: 332-345 - [c64]Hovhannes A. Harutyunyan, Narek A. Hovhannisyan:
Broadcasting in Split Graphs. CIAC 2023: 278-292 - [c63]Hovhannes A. Harutyunyan, Narek A. Hovhannisyan:
Improved Approximation for Broadcasting in k-Path Graphs. COCOA (2) 2023: 111-122 - [c62]Hovhannes A. Harutyunyan, Narek A. Hovhannisyan, Edward Maraachlian:
Broadcasting in chains of rings. ICUFN 2023: 506-511 - [c61]Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov:
Temporal Separators with Deadlines. ISAAC 2023: 38:1-38:19 - [c60]Hovhannes A. Harutyunyan, Narek A. Hovhannisyan:
Broadcasting in interconnection networks based on node partitioning. MeditCom 2023: 234-239 - [i1]Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov:
Temporal Separators with Deadlines. CoRR abs/2309.14185 (2023) - 2022
- [j27]Sahar Bakhtar, Hovhannes A. Harutyunyan:
A new metric to compare local community detection algorithms in social networks using geodesic distance. J. Comb. Optim. 44(4): 2809-2831 (2022) - [c59]Puspal Bhabak, Hovhannes A. Harutyunyan:
Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph. CALDAM 2022: 305-316 - [c58]Hovhannes A. Harutyunyan, Narek A. Hovhannisyan, Rakshit Magithiya:
[Full] Deep Heuristic for Broadcasting in Arbitrary Networks. ISPDC 2022: 1-8 - [c57]Sahar Bakhtar, Hovhannes A. Harutyunyan:
Dynamic Local Community Detection Algorithms. NOMS 2022: 1-6 - [c56]Sahar Bakhtar, Hovhannes A. Harutyunyan:
A Fast Local Community Detection Algorithm in Signed Social Networks. SNAMS 2022: 1-8 - [c55]Saber Gholami, Hovhannes A. Harutyunyan:
Fully-adaptive Model for Broadcasting with Universal Lists. SYNASC 2022: 92-99 - 2021
- [c54]Hovhannes A. Harutyunyan, Zhiyuan Li:
The Complexity of Finding a Broadcast Center. AAIM 2021: 57-70 - [c53]Mohammad Saber Gholami, Hovhannes A. Harutyunyan:
A Broadcasting Heuristic for Hypercube of Trees. CCWC 2021: 355-361 - [c52]Hovhannes A. Harutyunyan, Denis Pankratov, Jesse Racicot:
Online Domination: The Value of Getting to Know All Your Neighbors. MFCS 2021: 57:1-57:21 - [c51]Sahar Bakhtar, Hovhannes A. Harutyunyan:
A New Fast Local Community Detection Algorithm Using the Number of Common Neighbours. SNAMS 2021: 1-8 - 2020
- [j26]Hovhannes A. Harutyunyan, Zhiyuan Li:
A new construction of broadcast graphs. Discret. Appl. Math. 280: 144-155 (2020) - [c50]Sahar Bakhtar, Mohammad Saber Gholami, Hovhannes A. Harutyunyan:
A New Metric to Evaluate Communities in Social Networks Using Geodesic Distance. CSoNet 2020: 202-216 - [c49]Neil Conlan, Hovhannes A. Harutyunyan, Edward Maraachlian:
Heuristic Algorithms with Near Optimal Broadcasting in Cactus Graphs. PDP 2020: 253-257
2010 – 2019
- 2019
- [j25]Puspal Bhabak, Hovhannes A. Harutyunyan:
Approximation Algorithm for the Broadcast Time in k-Path Graph. J. Interconnect. Networks 19(4): 1950006:1-1950006:22 (2019) - [c48]Hovhannes A. Harutyunyan, Zhiyuan Li:
A Simple Construction of Broadcast Graphs. COCOON 2019: 240-253 - 2018
- [j24]Hovhannes A. Harutyunyan, Meghrig Terzian:
Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing. Int. J. Commun. Syst. 31(4) (2018) - [c47]Hovhannes A. Harutyunyan, Meghrig Terzian:
A Dynamic Multi-Core Multicast Approach for Delay and Delay Variation Multicast Routing. PDP 2018: 222-228 - 2017
- [j23]Hovhannes A. Harutyunyan, Shahin Kamali:
Efficient broadcast trees for weighted vertices. Discret. Appl. Math. 216: 598-608 (2017) - [c46]Hovhannes A. Harutyunyan, Zhiyuan Li:
Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs. CALDAM 2017: 193-204 - [c45]Hovhannes A. Harutyunyan, Meghrig Terzian:
A Multi-core Multicast Approach for Delay and Delay Variation Multicast Routing. HPCC/SmartCity/DSS 2017: 154-161 - [c44]Puspal Bhabak, Hovhannes A. Harutyunyan, Peter G. Kropf:
Efficient Broadcasting Algorithm in Harary-like Networks. ICPP Workshops 2017: 162-170 - [c43]Hovhannes A. Harutyunyan, Zhiyuan Li:
Improved Lower Bound on Broadcast Function Based on Graph Partition. IWOCA 2017: 219-230 - 2016
- [j22]Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci:
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199: 101-109 (2016) - [c42]Hovhannes A. Harutyunyan, Zhiyuan Li:
A New Construction of Broadcast Graphs. CALDAM 2016: 201-211 - [c41]Hovhannes A. Harutyunyan, Meghrig Terzian:
Directional Core Selection Approach for Delay and Delay Variation Multicast Routing. HPCC/SmartCity/DSS 2016: 481-488 - [c40]Hovhannes A. Harutyunyan, Meghrig Terzian:
3-Additive Approximation Algorithm for Multicast Time in 2D Torus Networks. ICA3PP 2016: 129-142 - 2015
- [j21]Hayk Grigoryan, Hovhannes A. Harutyunyan:
The shortest path problem in the Knödel graph. J. Discrete Algorithms 31: 40-47 (2015) - [c39]Puspal Bhabak, Hovhannes A. Harutyunyan:
Constant Approximation for Broadcasting in k-cycle Graph. CALDAM 2015: 21-32 - [c38]Hovhannes A. Harutyunyan, Meghrig Terzian:
Two Modified Multicast Algorithms for Two Dimensional Mesh and Torus Networks. PAAP 2015: 122-128 - 2014
- [j20]Hayk Grigoryan, Hovhannes A. Harutyunyan:
Diametral broadcast graphs. Discret. Appl. Math. 171: 53-59 (2014) - [j19]Georgy Barsky, Hayk Grigoryan, Hovhannes A. Harutyunyan:
Tight lower bounds on broadcast function for n=24 and 25. Discret. Appl. Math. 175: 109-114 (2014) - [j18]Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The worst case behavior of randomized gossip protocols. Theor. Comput. Sci. 560: 108-120 (2014) - [c37]Hayk Grigoryan, Hovhannes A. Harutyunyan:
New Lower Bounds on Broadcast Function. AAIM 2014: 174-184 - [c36]Hovhannes A. Harutyunyan:
Broadcast Networks with Near Optimal Cost. AAIM 2014: 312-322 - [c35]Hovhannes A. Harutyunyan, Cosmin Jimborean:
New Heuristic for Message Broadcasting in Networks. AINA 2014: 517-524 - [c34]Sirma C. Altay, Hovhannes A. Harutyunyan:
New Properties for Broadcasting in KG2k. C3S2E 2014: 8:1-8:10 - [c33]Hovhannes A. Harutyunyan, Gul B. Oad:
Exploring the diameter and broadcast time of general Knödel graphs using extensive simulations. C3S2E 2014: 25:1-25:6 - [c32]Puspal Bhabak, Hovhannes A. Harutyunyan, Shreelekha Tanna:
Broadcasting in Harary-Like Graphs. CSE 2014: 1269-1276 - [c31]Puspal Bhabak, Hovhannes A. Harutyunyan:
Broadcast Problem in Hypercube of Trees. FAW 2014: 1-12 - [c30]Hovhannes A. Harutyunyan, Shengjian Wang:
Two New Multicast Algorithms in 3D Mesh and Torus Networks. HPCC/CSS/ICESS 2014: 1150-1157 - [c29]Hovhannes A. Harutyunyan, Ankit Malani:
Efficient Multicast Algorithms for Mesh and Torus Networks. ISPA 2014: 231-236 - 2013
- [c28]Hayk Grigoryan, Hovhannes A. Harutyunyan:
Tight Bound on the Diameter of the Knödel Graph. IWOCA 2013: 206-215 - 2012
- [j17]Hovhannes A. Harutyunyan, Arthur L. Liestman:
Upper bounds on the broadcast function using minimum dominating sets. Discret. Math. 312(20): 2992-2996 (2012) - [c27]Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The Worst Case Behavior of Randomized Gossip. TAMC 2012: 330-345 - 2011
- [j16]Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman:
Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discret. Appl. Math. 159(5): 322-327 (2011) - [j15]Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer:
Nonadaptive broadcasting in trees. Networks 57(2): 157-168 (2011) - 2010
- [c26]Hovhannes A. Harutyunyan, Wei Wang:
Broadcasting Algorithm Via Shortest Paths. ICPADS 2010: 299-305 - [c25]Hovhannes A. Harutyunyan, Edward Maraachlian:
Broadcasting in Hierarchical Tree Cluster Network. PDPTA 2010: 479-486 - [c24]Hovhannes A. Harutyunyan, Shahin Kamali:
Optimum Broadcasting in Complete Weighted-Vertex Graphs. SOFSEM 2010: 489-502
2000 – 2009
- 2009
- [j14]Hovhannes A. Harutyunyan, Arthur L. Liestman, Bin Shao:
A linear algorithm for finding the k-broadcast center of a tree. Networks 53(3): 287-292 (2009) - [c23]Hovhannes A. Harutyunyan, Rahul Katragadda, Calin D. Morosan:
Efficient Heuristic for Multicasting in Arbitrary Networks. AINA Workshops 2009: 61-66 - [c22]Hovhannes A. Harutyunyan, George Laza, Edward Maraachlian:
Broadcasting in necklace graphs. C3S2E 2009: 253-256 - [c21]Hovhannes A. Harutyunyan, Edward Maraachlian:
Broadcasting in Fully Connected Trees. ICPADS 2009: 740-745 - [c20]Hovhannes A. Harutyunyan, Edward Maraachlian:
Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles. PDPTA 2009: 296-301 - 2008
- [j13]Hovhannes A. Harutyunyan:
An Efficient Vertex Addition Method for Broadcast Networks. Internet Math. 5(3): 211-225 (2008) - [j12]Hovhannes A. Harutyunyan, Edward Maraachlian:
On broadcasting in unicyclic graphs. J. Comb. Optim. 16(3): 307-322 (2008) - [c19]Hovhannes A. Harutyunyan, Edward Maraachlian:
Near Optimal Broadcasting in Optimal Triple Loop Graphs. AINA 2008: 227-233 - [c18]Hovhannes A. Harutyunyan, Shahin Kamali:
Efficient Broadcasting in Networks with Weighted Nodes. ICPADS 2008: 879-884 - [c17]Hovhannes A. Harutyunyan, Shahin Kamali:
Broadcasting in Weighted-Vertex Graphs. ISPA 2008: 301-307 - [c16]Hovhannes A. Harutyunyan, Shahin Kamali, Talin Moradian:
Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks. PDPTA 2008: 178-182 - 2007
- [j11]Hovhannes A. Harutyunyan, Calin D. Morosan:
On the minimum path problem in Knödel graphs. Networks 50(1): 86-91 (2007) - [c15]Hovhannes A. Harutyunyan, Edward Maraachlian:
Linear Algorithm for Broadcasting in Unicyclic Graphs. COCOON 2007: 372-382 - [c14]Hovhannes A. Harutyunyan, Xiangyang Xu:
New Construction of Broardcast Graphs. IV 2007: 751-756 - [c13]Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan Zhang:
Two Tree-Based Algorithms for Network Spare Capacity Design. PDCAT 2007: 279-284 - [c12]Hovhannes A. Harutyunyan, Bin Shao:
Efficient heuristics for message dissemination in networks. Parallel and Distributed Computing and Networks 2007: 192-197 - [c11]Hovhannes A. Harutyunyan, Shengjian Wang:
Path-based multicasting in multicomputers. Parallel and Distributed Computing and Networks 2007: 206-211 - [c10]Hovhannes A. Harutyunyan, Junlei He:
A New Peer-to-Peer Network. PerCom Workshops 2007: 120-125 - 2006
- [j10]Hovhannes A. Harutyunyan, Calin D. Morosan:
The spectra of Knödel graphs. Informatica (Slovenia) 30(3): 295-299 (2006) - [j9]Hovhannes A. Harutyunyan, Bin Shao:
An efficient heuristic for broadcasting in networks. J. Parallel Distributed Comput. 66(1): 68-76 (2006) - [j8]Hovhannes A. Harutyunyan:
Minimum multiple message broadcast graphs. Networks 47(4): 218-224 (2006) - [c9]Hovhannes A. Harutyunyan, Shengjian Wang:
Efficient Multicast Algorithms for Mesh-connected Multicomputers. IV 2006: 504-510 - [c8]Hovhannes A. Harutyunyan, Edward Maraachlian:
Broadcasting in Optimal Bipartite Double Loop Graphs. IV 2006: 521-528 - [c7]Hovhannes A. Harutyunyan, Calin D. Morosan:
The global fault-tolerance of interconnection networks. SNPD 2006: 171-176 - 2005
- [c6]Hovhannes A. Harutyunyan, Calin D. Morosan:
On Two Properties of the Minimum Broadcast Time Function. IV 2005: 523-527 - 2004
- [c5]Hovhannes A. Harutyunyan, Perouz Taslakian:
Orderly Broadcasting in a 2D Torus. IV 2004: 370-375 - 2003
- [j7]Hovhannes A. Harutyunyan, Arthur L. Liestman:
On the monotonicity of the broadcast function. Discret. Math. 262(1-3): 149-157 (2003) - [j6]Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman:
Messy Broadcasting in Multidimensional Directed Tori. J. Interconnect. Networks 4(1): 37-51 (2003) - [c4]Hovhannes A. Harutyunyan, Xiaolin Liu:
Multicast Algorithms in Torus Network. Applied Informatics 2003: 429-434 - [c3]Hovhannes A. Harutyunyan, Bin Shao:
An Experimental Result for Broadcast Time. Applied Informatics 2003: 441-445 - [c2]Hovhannes A. Harutyunyan, Bin Shao:
A Heuristic for k-Broadcasting in Arbitrary Networks. IV 2003: 287-293 - 2001
- [j5]Hovhannes A. Harutyunyan, Arthur L. Liestman:
Improved upper and lower bounds for k-broadcasting. Networks 37(2): 94-101 (2001) - [j4]Hovhannes A. Harutyunyan, Arthur L. Liestman:
k-Broadcasting in trees. Networks 38(3): 163-168 (2001) - 2000
- [c1]Hovhannes A. Harutyunyan:
Multiple message broadcasting in modified Knödel graph. SIROCCO 2000: 157-165
1990 – 1999
- 1999
- [j3]Hovhannes A. Harutyunyan, Arthur L. Liestman:
More Broadcast Graphs. Discret. Appl. Math. 98(1-2): 81-102 (1999) - 1998
- [j2]Hovhannes A. Harutyunyan, Arthur L. Liestman:
Messy Broadcasting. Parallel Process. Lett. 8(2): 149-159 (1998) - 1997
- [j1]Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes:
A Note on the Dimensionality of Modified Knö;del Graphs. Int. J. Found. Comput. Sci. 8(2): 109-116 (1997)
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 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint