Arthur L. Liestman

Hovhannes A. Harutyunyan, Arthur L. Liestman: Upper bounds on the broadcast function using minimum dominating sets. Discrete Mathematics 312(20): 2992-2996 (2012)

Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman: Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discrete Applied Mathematics 159(5): 322-327 (2011)

Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer: Nonadaptive broadcasting in trees. Networks 57(2): 157-168 (2011)

Arthur L. Liestman, Dana S. Richards, Ladislav Stacho: Broadcasting from multiple originators. Discrete Applied Mathematics 157(13): 2886-2891 (2009)

Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in tori. Discrete Mathematics 309(8): 2239-2249 (2009)

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)

Yuanzhu Peter Chen, Arthur L. Liestman: Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks 3(5): 629-642 (2005)

Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics 296(2-3): 167-186 (2005)

Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu: Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks. QSHINE 2005: 7

Roger Labahn, Arthur L. Liestman, Erich Prisner: Preface. Discrete Applied Mathematics 137(2): 125-126 (2004)

Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Factor d-domatic colorings of graphs. Discrete Mathematics 262(1-3): 17-25 (2003)

Hovhannes A. Harutyunyan, Arthur L. Liestman: On the monotonicity of the broadcast function. Discrete Mathematics 262(1-3): 149-157 (2003)

Yuanzhu Peter Chen, Arthur L. Liestman: A Zonal Algorithm for Clustering An Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 305-322 (2003)

Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman: Messy Broadcasting in Multidimensional Directed Tori. Journal of Interconnection Networks 4(1): 37-51 (2003)

Yuanzhu Peter Chen, Arthur L. Liestman: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. MobiHoc 2002: 165-172

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau: Edge-disjoint spanners of complete bipartite graphs. Discrete Mathematics 234(1-3): 65-76 (2001)

Hovhannes A. Harutyunyan, Arthur L. Liestman: Improved upper and lower bounds for k-broadcasting. Networks 37(2): 94-101 (2001)

Hovhannes A. Harutyunyan, Arthur L. Liestman: k-Broadcasting in trees. Networks 38(3): 163-168 (2001)

Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman: The even adjacency split problem for graphs. Discrete Applied Mathematics 102(3): 175-188 (2000)

Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman: Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281

Hovhannes A. Harutyunyan, Arthur L. Liestman: More Broadcast Graphs. Discrete Applied Mathematics 98(1-2): 81-102 (1999)

Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau: Edge-disjoint spanners of complete graphs and complete digraphs. Discrete Mathematics 203(1-3): 133-159 (1999)

Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá: Network Properties of Double and Triple Fixed Step Graphs. Int. J. Found. Comput. Sci. 9(1): 57-76 (1998)

Arthur L. Liestman, Natasa Przulj: Minimum Average Time Broadcast Graphs. Parallel Processing Letters 8(2): 139-140 (1998)

Hovhannes A. Harutyunyan, Arthur L. Liestman: Messy Broadcasting. Parallel Processing Letters 8(2): 149-159 (1998)

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-116 (1997)

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau: Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) 1997: 191-199

Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte: Degree-constrained Spanners for Multidimensional Grids. Discrete Applied Mathematics 68(1-2): 119-144 (1996)

Dana S. Richards, Arthur L. Liestman: Degree-Constrained Pyramid Spanners. J. Parallel Distrib. Comput. 25(1): 1-6 (1995)

Arthur L. Liestman, Thomas C. Shermer: Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discrete Math. 8(2): 291-321 (1995)

Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards: Reliable broadcasting. Discrete Applied Mathematics 53(1-3): 135-148 (1994)

Arthur L. Liestman, Thomas C. Shermer: Grid spanners. Networks 23(2): 123-133 (1993)

Arthur L. Liestman, Thomas C. Shermer: Additive graph spanners. Networks 23(4): 343-363 (1993)

Arthur L. Liestman, Dana S. Richards: Perpetual Gossiping. Parallel Processing Letters 3: 347-355 (1993)

Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau: Open Problems. Parallel Processing Letters 3: 507-524 (1993)

Arthur L. Liestman, Dana S. Richards: Network Communication in Edge-Colored Graphs: Gossiping. IEEE Trans. Parallel Distrib. Syst. 4(4): 438-445 (1993)

Arthur L. Liestman, Dana S. Richards: An Introduction to Perpetual Gossiping. ISAAC 1993: 259-266

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Sparse broadcast graphs. Discrete Applied Mathematics 36(2): 97-130 (1992)

Arthur L. Liestman, Joseph G. Peters: Minimum Broadcast Digraphs. Discrete Applied Mathematics 37/38: 401-419 (1992)

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Broadcasting in Bounded Degree Graphs. SIAM J. Discrete Math. 5(1): 10-24 (1992)

Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman: Fault Tolerance for Multistage Interconnection Networks. ICCI 1992: 430-435

Arthur L. Liestman, Thomas C. Shermer: Additive Spanners for Hypercubes. Parallel Processing Letters 1: 35-42 (1991)

Siu-Cheung Chau, Arthur L. Liestman: A Fault-Tolerant Binary Tree Architecture. ICCI 1991: 335-346

Arthur L. Liestman: Report on WOBCATS meeting. SIGACT News 21(2): 32 (1990)

Siu-Cheung Chau, Arthur L. Liestman: A proposal for a fault-tolerant binary hypercube architecture. FTCS 1989: 323-330

Pavol Hell, Arthur L. Liestman: Broadcasting in one dimension. Discrete Applied Mathematics 21(2): 101-111 (1988)

Dana Richards, Arthur L. Liestman: Generalizations of broadcasting and gossiping. Networks 18(2): 125-138 (1988)

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman: A survey of gossiping and broadcasting in communication networks. Networks 18(4): 319-349 (1988)

Arthur L. Liestman, Joseph G. Peters: Broadcast Networks of Bounded Degree. SIAM J. Discrete Math. 1(4): 531-540 (1988)

Arthur L. Liestman: Fault-tolerant broadcast graphs. Networks 15(2): 159-171 (1985)

C. L. Liu, Jane W.-S. Liu, Arthur L. Liestman: Scheduling with Slack Time. Acta Inf. 17: 31-41 (1982)