Arthur L. Liestman

According to our database, Arthur L. Liestman authored at least 55 papers between 1981 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2017

Minimum multiple originator broadcast graphs.

Arthur L. Liestman, Dana Richards

Discret. Appl. Math., 2017

2012

Upper bounds on the broadcast function using minimum dominating sets.

Hovhannes A. Harutyunyan, Arthur L. Liestman

Discret. Math., 2012

2011

Nonadaptive broadcasting in trees.

Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer

Networks, 2011

Messy broadcasting - Decentralized broadcast schemes with limited knowledge.

Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman

Discret. Appl. Math., 2011

2009

A linear algorithm for finding the <i>k</i>-broadcast center of a tree.

Hovhannes A. Harutyunyan, Arthur L. Liestman, Bin Shao

Networks, 2009

Edge-disjoint spanners in tori.

Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Discret. Math., 2009

Broadcasting from multiple originators.

Arthur L. Liestman, Dana S. Richards, Ladislav Stacho

Discret. Appl. Math., 2009

2006

A hierarchical energy-efficient framework for data aggregation in wireless sensor networks.

Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu

IEEE Trans. Veh. Technol., 2006

2005

Edge-disjoint spanners in Cartesian products of graphs.

Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Discret. Math., 2005

Maintaining weakly-connected dominating sets for clustering ad hoc networks.

Yuanzhu Peter Chen, Arthur L. Liestman

Ad Hoc Networks, 2005

Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks.

Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu

Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2005), 2005

2004

Preface.

Roger Labahn, Arthur L. Liestman, Erich Prisner

Discret. Appl. Math., 2004

2003

Messy Broadcasting in Multidimensional Directed Tori.

Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman

J. Interconnect. Networks, 2003

A Zonal Algorithm for Clustering An Hoc Networks.

Yuanzhu Peter Chen, Arthur L. Liestman

Int. J. Found. Comput. Sci., 2003

On the monotonicity of the broadcast function.

Hovhannes A. Harutyunyan, Arthur L. Liestman

Discret. Math., 2003

Factor <i>d</i>-domatic colorings of graphs.

Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Discret. Math., 2003

2002

Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks.

Yuanzhu Peter Chen, Arthur L. Liestman

Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

2001

Improved upper and lower bounds for k-broadcasting.

Hovhannes A. Harutyunyan, Arthur L. Liestman

Networks, 2001

k-Broadcasting in trees.

Hovhannes A. Harutyunyan, Arthur L. Liestman

Networks, 2001

Edge-disjoint spanners of complete bipartite graphs.

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau

Discret. Math., 2001

2000

The even adjacency split problem for graphs.

Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman

Discret. Appl. Math., 2000

Broadcasting Multiple Messages in Hypercubes (preliminary version).

Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

1999

Edge-disjoint spanners of complete graphs and complete digraphs.

Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau

Discret. Math., 1999

More Broadcast Graphs.

Hovhannes A. Harutyunyan, Arthur L. Liestman

Discret. Appl. Math., 1999

1998

Minimum Average Time Broadcast Graphs.

Arthur L. Liestman, Natasa Przulj

Parallel Process. Lett., 1998

Messy Broadcasting.

Hovhannes A. Harutyunyan, Arthur L. Liestman

Parallel Process. Lett., 1998

Network Properties of Double and Triple Fixed Step Graphs.

Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá

Int. J. Found. Comput. Sci., 1998

1997

A Note on the Dimensionality of Modified Knö;del Graphs.

Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes

Int. J. Found. Comput. Sci., 1997

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996

Degree-constrained Spanners for Multidimensional Grids.

Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte

Discret. Appl. Math., 1996

1995

Degree-Constrained Network Spanners with Nonconstant Delay.

Arthur L. Liestman, Thomas C. Shermer

SIAM J. Discret. Math., 1995

Degree-Constrained Pyramid Spanners.

Dana S. Richards, Arthur L. Liestman

J. Parallel Distributed Comput., 1995

1994

Reliable broadcasting.

Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards

Discret. Appl. Math., 1994

1993

Network Communication in Edge-Colored Graphs: Gossiping.

Arthur L. Liestman, Dana S. Richards

IEEE Trans. Parallel Distributed Syst., 1993

Perpetual Gossiping.

Arthur L. Liestman, Dana S. Richards

Parallel Process. Lett., 1993

Open Problems.

Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau

Parallel Process. Lett., 1993

Additive graph spanners.

Arthur L. Liestman, Thomas C. Shermer

Networks, 1993

Grid spanners.

Arthur L. Liestman, Thomas C. Shermer

Networks, 1993

An Introduction to Perpetual Gossiping.

Arthur L. Liestman, Dana S. Richards

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Broadcasting in Bounded Degree Graphs.

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters

SIAM J. Discret. Math., 1992

Minimum Broadcast Digraphs.

Arthur L. Liestman, Joseph G. Peters

Discret. Appl. Math., 1992

Sparse broadcast graphs.

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters

Discret. Appl. Math., 1992

Fault Tolerance for Multistage Interconnection Networks.

Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman

Proceedings of the Computing and Information, 1992

1991

Additive Spanners for Hypercubes.

Arthur L. Liestman, Thomas C. Shermer

Parallel Process. Lett., 1991

A Fault-Tolerant Binary Tree Architecture.

Siu-Cheung Chau, Arthur L. Liestman

Proceedings of the Advances in Computing and Information, 1991

1990

Report on WOBCATS meeting.

Arthur L. Liestman

SIGACT News, 1990

1989

A proposal for a fault-tolerant binary hypercube architecture.

Siu-Cheung Chau, Arthur L. Liestman

Proceedings of the Nineteenth International Symposium on Fault-Tolerant Computing, 1989

1988

Broadcast Networks of Bounded Degree.

Arthur L. Liestman, Joseph G. Peters

SIAM J. Discret. Math., 1988

Generalizations of broadcasting and gossiping.

Dana Richards, Arthur L. Liestman

Networks, 1988

A survey of gossiping and broadcasting in communication networks.

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman

Networks, 1988

Broadcasting in one dimension.

Pavol Hell, Arthur L. Liestman

Discret. Appl. Math., 1988

1985

Fault-tolerant broadcast graphs.

Arthur L. Liestman

Networks, 1985

1984

Toward optimal gossiping schemes with conference calls.

Arthur L. Liestman, Dana S. Richards

Discret. Appl. Math., 1984

1982

Scheduling with Slack Time.

C. L. Liu, Jane W.-S. Liu, Arthur L. Liestman

Acta Informatica, 1982

1981

Fault-Tolerant Scheduling and Broadcast Problems

Arthur L. Liestman

PhD thesis, 1981