| A survey of gossiping and broadcasting in communication networks SM Hedetniemi, ST Hedetniemi, AL Liestman Networks 18 (4), 319-349, 1988 | 1837 | 1988 |
| Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks YP Chen, AL Liestman Proceedings of the 3rd ACM international symposium on Mobile ad hoc …, 2002 | 384 | 2002 |
| A fault-tolerant scheduling problem AL Liestman, RH Campbell IEEE transactions on software engineering, 1089-1095, 1986 | 254 | 1986 |
| Clustering algorithms for ad hoc wireless networks Y Chen, A Liestman, J Liu Ad hoc and sensor networks 28, 76, 2004 | 201 | 2004 |
| A Zonal Algorithm for Clustering An Hoc Networks YP Chen, AL Liestman International Journal of Foundations of Computer Science 14 (02), 305-322, 2003 | 130 | 2003 |
| A hierarchical energy-efficient framework for data aggregation in wireless sensor networks YP Chen, AL Liestman, J Liu IEEE transactions on vehicular technology 55 (3), 789-796, 2006 | 123 | 2006 |
| Additive graph spanners AL Liestman, TC Shermer Networks 23 (4), 343-363, 1993 | 115 | 1993 |
| Broadcast networks of bounded degree AL Liestman, JG Peters SIAM journal on Discrete Mathematics 1 (4), 531-540, 1988 | 101 | 1988 |
| Sparse broadcast graphs JC Bermond, P Hell, AL Liestman, JG Peters Discrete applied mathematics 36 (2), 97-130, 1992 | 90 | 1992 |
| Broadcasting in bounded degree graphs JC Bermond, P Hell, AL Liestman, JG Peters SIAM Journal on Discrete Mathematics 5 (1), 10-24, 1992 | 89 | 1992 |
| A survey of broadcasting and gossiping in communication networks ST Hedetniemi, SM Hedetniemi, AL Liestman Networks 18 (4), 319-349, 1988 | 88 | 1988 |
| Fault‐tolerant broadcast graphs AL Liestman Networks 15 (2), 159-171, 1985 | 80 | 1985 |
| Generalizations of broadcasting and gossiping D Richards, AL Liestman Networks 18 (2), 125-138, 1988 | 69 | 1988 |
| A proposal for a fault-tolerant binary hypercube architecture SC Chau, AL Liestman 1989 The Nineteenth International Symposium on Fault-Tolerant Computing …, 1989 | 67 | 1989 |
| Constructing minimal broadcast networks SC Chau, AL Liestman J. Combin. Inform. Syst. Sci 10, 110-122, 1985 | 67 | 1985 |
| Energy-efficient data aggregation hierarchy for wireless sensor networks YP Chen, AL Liestman, J Liu Second international conference on quality of service in heterogeneous wired …, 2005 | 66 | 2005 |
| Grid spanners AL Liestman, TC Shermer Networks 23 (2), 123-133, 1993 | 61 | 1993 |
| A note on the dimensionality of modified Knödel graphs JC Bermond, HA Harutyunyan, AL Liestman, S Perennes International Journal of Foundations of Computer Science 8 (02), 109-116, 1997 | 60 | 1997 |
| More broadcast graphs HA Harutyunyan, AL Liestman Discrete Applied Mathematics 98 (1-2), 81-102, 1999 | 59 | 1999 |
| Broadcasting and gossiping HA Harutyunyan, AL Liestman, JG Peters, D Richards Handbook of graph theory, 1477-1494, 2013 | 48 | 2013 |
