| Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph. | 0 | 0.34 | 2022 |
| The Complexity of Finding a Broadcast Center. | 0 | 0.34 | 2021 |
| A New Metric to Evaluate Communities in Social Networks Using Geodesic Distance. | 0 | 0.34 | 2020 |
| Heuristic Algorithms with Near Optimal Broadcasting in Cactus Graphs | 0 | 0.34 | 2020 |
| A new construction of broadcast graphs. | 1 | 0.35 | 2020 |
| A Simple Construction of Broadcast Graphs. | 0 | 0.34 | 2019 |
| Approximation Algorithm for the Broadcast Time in k-Path Graph. | 0 | 0.34 | 2019 |
| Directional Core Selection Approach And Dynamic Tree Reorganization For Delay And Delay Variation Multicast Routing | 0 | 0.34 | 2018 |
| A Dynamic Multi-Core Multicast Approach for Delay and Delay Variation Multicast Routing | 0 | 0.34 | 2018 |
| Efficient broadcast trees for weighted vertices. | 3 | 0.41 | 2017 |
| Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs. | 0 | 0.34 | 2017 |
| A Multi-core Multicast Approach for Delay and Delay Variation Multicast Routing | 0 | 0.34 | 2017 |
| 3-Additive Approximation Algorithm for Multicast Time in 2D Torus Networks. | 0 | 0.34 | 2016 |
| On the complexity of the shortest-path broadcast problem | 1 | 0.35 | 2016 |
| Directional Core Selection Approach for Delay and Delay Variation Multicast Routing | 1 | 0.36 | 2016 |
| A New Construction of Broadcast Graphs. | 0 | 0.34 | 2016 |
| Two Modified Multicast Algorithms for Two Dimensional Mesh and Torus Networks | 1 | 0.37 | 2015 |
| The shortest path problem in the Knödel graph | 1 | 0.35 | 2015 |
| Constant Approximation for Broadcasting in k-cycle Graph. | 1 | 0.36 | 2015 |
| Broadcasting in Harary-Like Graphs | 1 | 0.35 | 2014 |
| Efficient Multicast Algorithms for Mesh and Torus Networks | 1 | 0.37 | 2014 |
| Broadcast Networks with Near Optimal Cost. | 0 | 0.34 | 2014 |
| Broadcast Problem in Hypercube of Trees. | 0 | 0.34 | 2014 |
| New Lower Bounds on Broadcast Function. | 2 | 0.37 | 2014 |
| Tight Bound on the Diameter of the Knödel Graph. | 1 | 0.36 | 2013 |
| Upper bounds on the broadcast function using minimum dominating sets. | 14 | 0.64 | 2012 |
| Messy broadcasting - Decentralized broadcast schemes with limited knowledge | 2 | 0.37 | 2011 |
| Nonadaptive broadcasting in trees | 2 | 0.42 | 2011 |
| Broadcasting in Hierarchical Tree Cluster Network | 0 | 0.34 | 2010 |
| Optimum Broadcasting in Complete Weighted-Vertex Graphs | 1 | 0.37 | 2010 |
| Broadcasting Algorithm Via Shortest Paths | 8 | 0.49 | 2010 |
| Broadcasting in necklace graphs | 2 | 0.39 | 2009 |
| Broadcasting in Fully Connected Trees | 3 | 0.39 | 2009 |
| A linear algorithm for finding the k-broadcast center of a tree | 3 | 0.40 | 2009 |
| Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles | 1 | 0.36 | 2009 |
| Efficient Heuristic for Multicasting in Arbitrary Networks | 0 | 0.34 | 2009 |
| Efficient Broadcasting in Networks with Weighted Nodes | 2 | 0.41 | 2008 |
| Broadcasting in Weighted-Vertex Graphs | 3 | 0.45 | 2008 |
| An Efficient Vertex Addition Method For Broadcast Networks | 14 | 0.64 | 2008 |
| Near Optimal Broadcasting in Optimal Triple Loop Graphs | 0 | 0.34 | 2008 |
| On broadcasting in unicyclic graphs | 8 | 0.52 | 2008 |
| Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks | 0 | 0.34 | 2008 |
| Two Tree-Based Algorithms for Network Spare Capacity Design | 0 | 0.34 | 2007 |
| Path-based multicasting in multicomputers | 0 | 0.34 | 2007 |
| Efficient heuristics for message dissemination in networks | 0 | 0.34 | 2007 |
| New Construction of Broardcast Graphs | 0 | 0.34 | 2007 |
| A New Peer-to-Peer Network | 1 | 0.36 | 2007 |
| On the minimum path problem in Knödel graphs | 10 | 0.76 | 2007 |
| Linear algorithm for broadcasting in unicyclic graphs | 4 | 0.42 | 2007 |
| Minimum multiple message broadcast graphs | 13 | 0.68 | 2006 |
