| Publication | Date of Publication | Type |
|---|
| Broadcasting in split graphs | 2023-10-04 | Paper |
| Online Domination: The Value of Getting to Know All Your Neighbors. | 2023-08-08 | Paper |
| Broadcast graphs using new dimensional broadcast schemes for Knödel graphs | 2023-06-05 | Paper |
| Approximation algorithms in graphs with known broadcast time of the base graph | 2023-05-08 | Paper |
| A new metric to compare local community detection algorithms in social networks using geodesic distance | 2022-10-18 | Paper |
| The complexity of finding a broadcast center | 2022-07-01 | Paper |
| A new construction of broadcast graphs | 2020-05-18 | Paper |
| A simple construction of broadcast graphs | 2020-02-24 | Paper |
| Improved lower bound on broadcast function based on graph partition | 2018-06-15 | Paper |
| Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs | 2017-04-07 | Paper |
| Efficient broadcast trees for weighted vertices | 2017-03-15 | Paper |
| A New Construction of Broadcast Graphs | 2016-03-23 | Paper |
| On the complexity of the shortest-path broadcast problem | 2015-12-10 | Paper |
| New Lower Bounds on Broadcast Function | 2015-05-20 | Paper |
| Broadcast Networks with Near Optimal Cost | 2015-05-20 | Paper |
| The shortest path problem in the Knödel graph | 2015-03-24 | Paper |
| Constant Approximation for Broadcasting in k-cycle Graph | 2015-02-19 | Paper |
| The worst case behavior of randomized gossip protocols | 2014-12-02 | Paper |
| Broadcast Problem in Hypercube of Trees | 2014-09-02 | Paper |
| Tight lower bounds on broadcast function for \(n = 24\) and 25 | 2014-08-26 | Paper |
| Diametral broadcast graphs | 2014-05-06 | Paper |
| Tight Bound on the Diameter of the Knödel Graph | 2014-01-17 | Paper |
| Upper bounds on the broadcast function using minimum dominating sets | 2012-10-16 | Paper |
| The Worst Case Behavior of Randomized Gossip | 2012-07-16 | Paper |
| Nonadaptive broadcasting in trees | 2011-03-16 | Paper |
| Messy broadcasting - decentralized broadcast schemes with limited knowledge | 2011-03-10 | Paper |
| Optimum Broadcasting in Complete Weighted-Vertex Graphs | 2010-01-28 | Paper |
| An Efficient Vertex Addition Method for Broadcast Networks | 2010-01-27 | Paper |
| A linear algorithm for finding the k‐broadcast center of a tree | 2009-07-28 | Paper |
| On broadcasting in unicyclic graphs | 2009-07-13 | Paper |
| Linear Algorithm for Broadcasting in Unicyclic Graphs | 2009-03-06 | Paper |
| On the minimum path problem in Knödel graphs | 2007-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3418608 | 2007-02-05 | Paper |
| Minimum multiple message broadcast graphs | 2006-09-12 | Paper |
| An efficient heuristic for broadcasting in networks | 2006-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464786 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405771 | 2003-11-27 | Paper |
| On the monotonicity of the broadcast function | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529448 | 2002-10-13 | Paper |
| k-Broadcasting in trees | 2002-01-14 | Paper |
| Improved upper and lower bounds fork-broadcasting | 2001-06-20 | Paper |
| More broadcast graphs | 2000-05-08 | Paper |
| A Note on the Dimensionality of Modified Knödel Graphs | 1997-11-20 | Paper |
