Arthur L. Liestman

Publication Activity (10 Years)

Years Active: 1982-2017
Publications (10 Years): 1

Top Topics

Sample Complexity

Top Venues

Discret. Appl. Math.

Publications

Arthur L. Liestman, Dana Richards
Minimum multiple originator broadcast graphs. Discret. Appl. Math. 216 (2017)
Hovhannes A. Harutyunyan, Arthur L. Liestman
Upper bounds on the broadcast function using minimum dominating sets. Discret. Math. 312 (20) (2012)
Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman
Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discret. Appl. Math. 159 (5) (2011)
Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer
Nonadaptive broadcasting in trees. Networks 57 (2) (2011)
Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
Edge-disjoint spanners in tori. Discret. Math. 309 (8) (2009)
Arthur L. Liestman, Dana S. Richards, Ladislav Stacho
Broadcasting from multiple originators. Discret. Appl. Math. 157 (13) (2009)
Hovhannes A. Harutyunyan, Arthur L. Liestman, Bin Shao
-broadcast center of a tree. Networks 53 (3) (2009)
Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu
A hierarchical energy-efficient framework for data aggregation in wireless sensor networks. IEEE Trans. Veh. Technol. 55 (3) (2006)
Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu
Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks. QSHINE (2005)
Yuanzhu Peter Chen, Arthur L. Liestman
Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks 3 (5) (2005)
Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. 296 (2-3) (2005)
Roger Labahn, Arthur L. Liestman, Erich Prisner
Preface. Discret. Appl. Math. 137 (2) (2004)
Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
-domatic colorings of graphs. Discret. Math. 262 (1-3) (2003)
Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman
Messy Broadcasting in Multidimensional Directed Tori. J. Interconnect. Networks 4 (1) (2003)
Yuanzhu Peter Chen, Arthur L. Liestman
A Zonal Algorithm for Clustering An Hoc Networks. Int. J. Found. Comput. Sci. 14 (2) (2003)
Hovhannes A. Harutyunyan, Arthur L. Liestman
On the monotonicity of the broadcast function. Discret. Math. 262 (1-3) (2003)
Yuanzhu Peter Chen, Arthur L. Liestman
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. MobiHoc (2002)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234 (1-3) (2001)
Hovhannes A. Harutyunyan, Arthur L. Liestman
k-Broadcasting in trees. Networks 38 (3) (2001)
Hovhannes A. Harutyunyan, Arthur L. Liestman
Improved upper and lower bounds for k-broadcasting. Networks 37 (2) (2001)
Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman
Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN (2000)
Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman
The even adjacency split problem for graphs. Discret. Appl. Math. 102 (3) (2000)
Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. 203 (1-3) (1999)
Hovhannes A. Harutyunyan, Arthur L. Liestman
More Broadcast Graphs. Discret. Appl. Math. 98 (1-2) (1999)
Hovhannes A. Harutyunyan, Arthur L. Liestman
Messy Broadcasting. Parallel Process. Lett. 8 (2) (1998)
Arthur L. Liestman, Natasa Przulj
Minimum Average Time Broadcast Graphs. Parallel Process. Lett. 8 (2) (1998)
Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá
Network Properties of Double and Triple Fixed Step Graphs. Int. J. Found. Comput. Sci. 9 (1) (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) (1997)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) (1997)
Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte
Degree-constrained Spanners for Multidimensional Grids. Discret. Appl. Math. 68 (1-2) (1996)
Arthur L. Liestman, Thomas C. Shermer
Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discret. Math. 8 (2) (1995)
Dana S. Richards, Arthur L. Liestman
Degree-Constrained Pyramid Spanners. J. Parallel Distributed Comput. 25 (1) (1995)
Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards
Reliable broadcasting. Discret. Appl. Math. 53 (1-3) (1994)
Arthur L. Liestman, Dana S. Richards
An Introduction to Perpetual Gossiping. ISAAC (1993)
Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
Open Problems. Parallel Process. Lett. 3 (1993)
Arthur L. Liestman, Thomas C. Shermer
Additive graph spanners. Networks 23 (4) (1993)
Arthur L. Liestman, Dana S. Richards
Network Communication in Edge-Colored Graphs: Gossiping. IEEE Trans. Parallel Distributed Syst. 4 (4) (1993)
Arthur L. Liestman, Thomas C. Shermer
Grid spanners. Networks 23 (2) (1993)
Arthur L. Liestman, Dana S. Richards
Perpetual Gossiping. Parallel Process. Lett. 3 (1993)
Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman
Fault Tolerance for Multistage Interconnection Networks. ICCI (1992)
Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
Sparse broadcast graphs. Discret. Appl. Math. 36 (2) (1992)
Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
Broadcasting in Bounded Degree Graphs. SIAM J. Discret. Math. 5 (1) (1992)
Arthur L. Liestman, Joseph G. Peters
Minimum Broadcast Digraphs. Discret. Appl. Math. (1992)
Siu-Cheung Chau, Arthur L. Liestman
A Fault-Tolerant Binary Tree Architecture. ICCI (1991)
Arthur L. Liestman, Thomas C. Shermer
Additive Spanners for Hypercubes. Parallel Process. Lett. 1 (1991)
Arthur L. Liestman
Report on WOBCATS meeting. SIGACT News 21 (2) (1990)
Siu-Cheung Chau, Arthur L. Liestman
A proposal for a fault-tolerant binary hypercube architecture. FTCS (1989)
Dana Richards, Arthur L. Liestman
Generalizations of broadcasting and gossiping. Networks 18 (2) (1988)
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman
A survey of gossiping and broadcasting in communication networks. Networks 18 (4) (1988)
Pavol Hell, Arthur L. Liestman
Broadcasting in one dimension. Discret. Appl. Math. 21 (2) (1988)
Arthur L. Liestman, Joseph G. Peters
Broadcast Networks of Bounded Degree. SIAM J. Discret. Math. 1 (4) (1988)
Arthur L. Liestman
Fault-tolerant broadcast graphs. Networks 15 (2) (1985)
Arthur L. Liestman, Dana S. Richards
Toward optimal gossiping schemes with conference calls. Discret. Appl. Math. 7 (2) (1984)
C. L. Liu, Jane W.-S. Liu, Arthur L. Liestman
Scheduling with Slack Time. Acta Informatica 17 (1982)