H. A. Harutyunyan, A. L. Liestman, K. Makino, and T. C. Shermer, Non-adaptive Broadcasting in Trees, Networks: 57, 157-168, 2011.

    H. A. Harutyunyan, P. Hell, and A. L. Liestman, Messy Broadcasting - Decentralized broadcast schemes with limited knowledge, Discr. Appl. Math. 159: 322-327, 2011.

    A. L. Liestman, T. C. Shermer, and L. Stacho, Edge-Disjoint Spanners in Tori, Discrete Mathematics 309: 2239-2249, 2009.

    A. L. Liestman, D. Richards, and L. Stacho, Broadcasting from Multiple Originators, Discrete Applied Mathematics157: 2886-2891, 2009.

    H. A. Harutyunyan and A. L. Liestman, A Linear Algorithm for Finding the k-Broadcast Center of a Tree, Networks 53: 287-292, 2008.

    Y. P. Chen, A. L. Liestman and J. Liu, Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks, IEEE Trans. on Vehicular Technology 55: 789-796, 2006.

    G. Fertin and A. L. Liestman, T. C. Shermer, and L. Stacho, Edge-Disjoint Spanners in Cartesian Products of Graphs, Discrete Mathematics 296: 167-186, 2005.

    Y. P. Chen and A. L. Liestman, Maintaining Weakly-Connected Dominating Sets for Clustering Ad Hoc Networks, Ad Hoc Networks:3 629-642, 2005.

    Y. P. Chen, A. L. Liestman and J. Liu, Clustering Algorithms for Ad Hoc Wireless Networks, in Ad Hoc and Sensor Networks ed. Y. Pan and Y. Xiao, Nova Science Publishers, 2004.

    Y. P. Chen and A. L. Liestman, A Zonal Algorithm for Clustering Ad Hoc Networks, Int. J. Forks 4: 37-51, 2003.

    H. Harutyunyan and A. L. Liestman, k-Broadcasting in Trees, Networks 38: 163-168, 2001.

    C. Laforest, A. L. Liestman, T. C. Shermer, and D. Sotteau, Edge Disjoint Spanners of Complete Bipartite Graphs, Discr. Math. 234: 65-76, 2001.

    H. Harutyunyan and A. L. Liestman, Improved Upper and Lower Bounds for k-Broadcasting, Networks 37: 94-101, 2001.

    G. Cheston, S. T. Hedetniemi, A. L. Liestman, and J. B. Stehman, The Even Adjacency Split Problem for Graphs, Discr. Appl. Math. 102: 175-188, 2000.

    H. Harutyunyan and A. L. Liestman, More Broadcast Graphs, Discr. Appl. Math. 98: 81-102, 1999.

    C. Laforest, A. L. Liestman, D. Peleg, T. C. Shermer, and D. Sotteau, Edge Disjoint Spanners of Complete Graphs and Complete Digraphs, Discr. Math. 203: 133-159, 1999.

    A. L. Liestman and N. Przulj, Minimum Average Time Broadcast Graphs, Par. Proc. Lett. 8: 139-147, 1998.

    H. A. Harutyunyan and A. L. Liestman, Messy Broadcasting, Par. Proc. Lett. 8: 149-159, 1998.

    A. L. Liestman, J. Opatrny, and M. Zaragoza, Network Properties of Double and Triple Fixed-Step Graphs, Int. J. Found. Comp. Sci. 9: 57-76 1998.

    J. C. Bermond, H. A. Harutyunyan, A. L. Liestman, and S. Perennes, A Note on the Dimensionality of Modified Knödel Graphs, Int. J. Found. Comp. Sci. 8: 109-117, 1997.

    A. L. Liestman, T. C. Shermer, and C. R. Stolte. Degree constrained spanners for multi-dimensional grids. Discr. Appl. Math. 68(1-2): 119-144, 1996.

    A. L. Liestman and T. C. Shermer. Degree-Constrained Network Spanners With Non-constant Delay SIAM J. Discr. Math 8(2): 291-321, 1995.

    D. Richards and A. L. Liestman. Degree-constrained pyramid spanners. J. Parallel Distr. Comp. 25: 1-6, 1995.

    A. L. Liestman and T. C. Shermer. Additive graph spanners. Networks 23: 343-364, 1993.

    A. L. Liestman and T. C. Shermer. Grid spanners. Networks 23: 123-133, 1993.

    A. L. Liestman and J. G. Peters. Minimum broadcast digraphs. Discr. Appl. Math 37/38: 401-419, 1992. reprinted in Topics in Discrete Mathematics, Volume 5: Interconnection Networks, J.-C. Bermond (Ed.), 1992, pp.401-419.

    J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Broadcasting in bounded degree graphs. SIAM J. Discr. Math. 5: 10-24, 1992.

    J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Sparse broadcast graphs. Discr. Appl. Math. 36: 97-130, 1992.

    A. L. Liestman and T. C. Shermer. Additive spanners for hypercubes. Par. Proc. Lett. 1: 35-42, 1991. reprinted in Centre For Systems Science Research Review 2, B. Shell (Ed.), 1992, pp.19-22.

    D. Richards and A. L. Liestman. Generalizations of broadcasting and gossiping. Networks 18: 125-138, 1988.

    P. Hell and A. L. Liestman. Broadcasting in One Dimension. Discrete Applied Mathematics 21(2): 101-111, 1988.

    A. L. Liestman and R. H. Campbell. A fault-tolerant scheduling problem. IEEE Trans. Soft. Eng. 12: 1089-1095, 1986. reprinted in Hard Real Time Systems, J. A. Stankovic and K. Ramamritham (Eds.), IEEE Computer Society, 1988, pp.524-530.

    S.-C. Chau and A. L. Liestman. Constructing fault-tolerant minimal broadcast networks. J. Comb. Inf. & Sys. Sci. 11(1): 1-18, 1986.

    S.-C. Chau and A. L. Liestman. Constructing minimal broadcast networks. J. Comb. Inf. & Sys. Sci. 10(3-4): 110-122, 1985.

    A. L. Liestman. Fault-tolerant broadcast graphs. Networks 15: 159-171, 1985.

    D. Richards and A. L. Liestman. Finding cycles of a given length. Annals Discr. Math. 27: 249-256, 1985.

    A. L. Liestman and D. Richards. Toward optimal gossiping schemes with conference calls. Discr. Appl. Math. 7: 183-189, 1984.

    C. L. Liu, J. W. S. Liu, and A. L. Liestman. Scheduling with slack time. Acta Informatica 17: 31-41, 1982.


Back to Dr. Liestman's Home Page