 | 2012 |
|---|
| 43 |       | Hervé Baumann,
Pierre Fraigniaud,
Hovhannes A. Harutyunyan,
R. de Verclos:
The Worst Case Behavior of Randomized Gossip.
TAMC 2012: 330-345 |
| 2011 |
|---|
| 42 | | Hovhannes A. Harutyunyan,
Pavol Hell,
Arthur L. Liestman:
Messy broadcasting - Decentralized broadcast schemes with limited knowledge.
Discrete Applied Mathematics 159(5): 322-327 (2011) |
| 41 | | Hovhannes A. Harutyunyan,
Arthur L. Liestman,
Kazuhisa Makino,
Thomas C. Shermer:
Nonadaptive broadcasting in trees.
Networks 57(2): 157-168 (2011) |
| 2010 |
|---|
| 40 | | Hovhannes A. Harutyunyan,
Wei Wang:
Broadcasting Algorithm Via Shortest Paths.
ICPADS 2010: 299-305 |
| 39 |  | Hovhannes A. Harutyunyan,
Edward Maraachlian:
Broadcasting in Hierarchical Tree Cluster Network.
PDPTA 2010: 479-486 |
| 38 | | Hovhannes A. Harutyunyan,
Shahin Kamali:
Optimum Broadcasting in Complete Weighted-Vertex Graphs.
SOFSEM 2010: 489-502 |
| 2009 |
|---|
| 37 | | Hovhannes A. Harutyunyan,
Rahul Katragadda,
Calin D. Morosan:
Efficient Heuristic for Multicasting in Arbitrary Networks.
AINA Workshops 2009: 61-66 |
| 36 | | Hovhannes A. Harutyunyan,
George Laza,
Edward Maraachlian:
Broadcasting in necklace graphs.
C3S2E 2009: 253-256 |
| 35 | | Hovhannes A. Harutyunyan,
Edward Maraachlian:
Broadcasting in Fully Connected Trees.
ICPADS 2009: 740-745 |
| 34 | | Hovhannes A. Harutyunyan,
Edward Maraachlian:
Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles.
PDPTA 2009: 296-301 |
| 33 | | 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) |
| 2008 |
|---|
| 32 | | Hovhannes A. Harutyunyan,
Edward Maraachlian:
Near Optimal Broadcasting in Optimal Triple Loop Graphs.
AINA 2008: 227-233 |
| 31 | | Hovhannes A. Harutyunyan,
Shahin Kamali:
Efficient Broadcasting in Networks with Weighted Nodes.
ICPADS 2008: 879-884 |
| 30 | | Hovhannes A. Harutyunyan,
Shahin Kamali:
Broadcasting in Weighted-Vertex Graphs.
ISPA 2008: 301-307 |
| 29 | | Hovhannes A. Harutyunyan,
Shahin Kamali,
Talin Moradian:
Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks.
PDPTA 2008: 178-182 |
| 28 | | Hovhannes A. Harutyunyan:
An Efficient Vertex Addition Method for Broadcast Networks.
Internet Mathematics 5(3): 211-225 (2008) |
| 27 | | Hovhannes A. Harutyunyan,
Edward Maraachlian:
On broadcasting in unicyclic graphs.
J. Comb. Optim. 16(3): 307-322 (2008) |
| 2007 |
|---|
| 26 | | Hovhannes A. Harutyunyan,
Edward Maraachlian:
Linear Algorithm for Broadcasting in Unicyclic Graphs.
COCOON 2007: 372-382 |
| 25 | | Hovhannes A. Harutyunyan,
Xiangyang Xu:
New Construction of Broardcast Graphs.
IV 2007: 751-756 |
| 24 | | Hovhannes A. Harutyunyan,
Calin D. Morosan,
Yunzan Zhang:
Two Tree-Based Algorithms for Network Spare Capacity Design.
PDCAT 2007: 279-284 |
| 23 | | Hovhannes A. Harutyunyan,
Bin Shao:
Efficient heuristics for message dissemination in networks.
Parallel and Distributed Computing and Networks 2007: 192-197 |
| 22 | | Hovhannes A. Harutyunyan,
Shengjian Wang:
Path-based multicasting in multicomputers.
Parallel and Distributed Computing and Networks 2007: 206-211 |
| 21 | | Hovhannes A. Harutyunyan,
Junlei He:
A New Peer-to-Peer Network.
PerCom Workshops 2007: 120-125 |
| 20 | | Hovhannes A. Harutyunyan,
Calin D. Morosan:
On the minimum path problem in Knödel graphs.
Networks 50(1): 86-91 (2007) |
| 2006 |
|---|
| 19 | | Hovhannes A. Harutyunyan,
Shengjian Wang:
Efficient Multicast Algorithms for Mesh-connected Multicomputers.
IV 2006: 504-510 |
| 18 | | Hovhannes A. Harutyunyan,
Edward Maraachlian:
Broadcasting in Optimal Bipartite Double Loop Graphs.
IV 2006: 521-528 |
| 17 | | Hovhannes A. Harutyunyan,
Calin D. Morosan:
The global fault-tolerance of interconnection networks.
SNPD 2006: 171-176 |
| 16 | | Hovhannes A. Harutyunyan,
Calin D. Morosan:
The spectra of Knödel graphs.
Informatica (Slovenia) 30(3): 295-299 (2006) |
| 15 | | Hovhannes A. Harutyunyan,
Bin Shao:
An efficient heuristic for broadcasting in networks.
J. Parallel Distrib. Comput. 66(1): 68-76 (2006) |
| 14 | | Hovhannes A. Harutyunyan:
Minimum multiple message broadcast graphs.
Networks 47(4): 218-224 (2006) |
| 2005 |
|---|
| 13 | | Hovhannes A. Harutyunyan,
Calin D. Morosan:
On Two Properties of the Minimum Broadcast Time Function.
IV 2005: 523-527 |
| 2004 |
|---|
| 12 | | Hovhannes A. Harutyunyan,
Perouz Taslakian:
Orderly Broadcasting in a 2D Torus.
IV 2004: 370-375 |
| 2003 |
|---|
| 11 | | Hovhannes A. Harutyunyan,
Xiaolin Liu:
Multicast Algorithms in Torus Network.
Applied Informatics 2003: 429-434 |
| 10 | | Hovhannes A. Harutyunyan,
Bin Shao:
An Experimental Result for Broadcast Time.
Applied Informatics 2003: 441-445 |
| 9 | | Hovhannes A. Harutyunyan,
Bin Shao:
A Heuristic for k-Broadcasting in Arbitrary Networks.
IV 2003: 287-293 |
| 8 | | Hovhannes A. Harutyunyan,
Arthur L. Liestman:
On the monotonicity of the broadcast function.
Discrete Mathematics 262(1-3): 149-157 (2003) |
| 7 | | Francesc Comellas,
Hovhannes A. Harutyunyan,
Arthur L. Liestman:
Messy Broadcasting in Multidimensional Directed Tori.
Journal of Interconnection Networks 4(1): 37-51 (2003) |
| 2001 |
|---|
| 6 | | Hovhannes A. Harutyunyan,
Arthur L. Liestman:
Improved upper and lower bounds for k-broadcasting.
Networks 37(2): 94-101 (2001) |
| 5 | | Hovhannes A. Harutyunyan,
Arthur L. Liestman:
k-Broadcasting in trees.
Networks 38(3): 163-168 (2001) |
| 2000 |
|---|
| 4 | | Hovhannes A. Harutyunyan:
Multiple message broadcasting in modified Knödel graph.
SIROCCO 2000: 157-165 |
| 1999 |
|---|
| 3 | | Hovhannes A. Harutyunyan,
Arthur L. Liestman:
More Broadcast Graphs.
Discrete Applied Mathematics 98(1-2): 81-102 (1999) |
| 1998 |
|---|
| 2 | | Hovhannes A. Harutyunyan,
Arthur L. Liestman:
Messy Broadcasting.
Parallel Processing Letters 8(2): 149-159 (1998) |
| 1997 |
|---|
| 1 | | 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- (1997) |
Data released under the ODC-BY 1.0 license — See also our legal information page