Arthur L. Liestman

55 papers B 2C 3Journal 46Unranked 3

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