Arthur L. Liestman

According to our database1, Arthur L. Liestman authored at least 54 papers between 1982 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Minimum multiple originator broadcast graphs.
Discret. Appl. Math., 2017

2012
Upper bounds on the broadcast function using minimum dominating sets.
Discret. Math., 2012

2011
Nonadaptive broadcasting in trees.
Networks, 2011

Messy broadcasting - Decentralized broadcast schemes with limited knowledge.
Discret. Appl. Math., 2011

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

Edge-disjoint spanners in tori.
Discret. Math., 2009

Broadcasting from multiple originators.
Discret. Appl. Math., 2009

2006
A hierarchical energy-efficient framework for data aggregation in wireless sensor networks.
IEEE Trans. Veh. Technol., 2006

2005
Edge-disjoint spanners in Cartesian products of graphs.
Discret. Math., 2005

Maintaining weakly-connected dominating sets for clustering ad hoc networks.
Ad Hoc Networks, 2005

Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks.
Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2005), 2005

2004
Preface.
Discret. Appl. Math., 2004

2003
Messy Broadcasting in Multidimensional Directed Tori.
J. Interconnect. Networks, 2003

A Zonal Algorithm for Clustering An Hoc Networks.
Int. J. Found. Comput. Sci., 2003

On the monotonicity of the broadcast function.
Discret. Math., 2003

Factor <i>d</i>-domatic colorings of graphs.
Discret. Math., 2003

2002
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks.
Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

2001
Improved upper and lower bounds for k-broadcasting.
Networks, 2001

k-Broadcasting in trees.
Networks, 2001

Edge-disjoint spanners of complete bipartite graphs.
Discret. Math., 2001

2000
The even adjacency split problem for graphs.
Discret. Appl. Math., 2000

Broadcasting Multiple Messages in Hypercubes (preliminary version).
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

1999
Edge-disjoint spanners of complete graphs and complete digraphs.
Discret. Math., 1999

More Broadcast Graphs.
Discret. Appl. Math., 1999

1998
Minimum Average Time Broadcast Graphs.
Parallel Process. Lett., 1998

Messy Broadcasting.
Parallel Process. Lett., 1998

Network Properties of Double and Triple Fixed Step Graphs.
Int. J. Found. Comput. Sci., 1998

1997
A Note on the Dimensionality of Modified Knö;del Graphs.
Int. J. Found. Comput. Sci., 1997

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996
Degree-constrained Spanners for Multidimensional Grids.
Discret. Appl. Math., 1996

1995
Degree-Constrained Network Spanners with Nonconstant Delay.
SIAM J. Discret. Math., 1995

Degree-Constrained Pyramid Spanners.
J. Parallel Distributed Comput., 1995

1994
Reliable broadcasting.
Discret. Appl. Math., 1994

1993
Network Communication in Edge-Colored Graphs: Gossiping.
IEEE Trans. Parallel Distrib. Syst., 1993

Perpetual Gossiping.
Parallel Process. Lett., 1993

Open Problems.
Parallel Process. Lett., 1993

Additive graph spanners.
Networks, 1993

Grid spanners.
Networks, 1993

An Introduction to Perpetual Gossiping.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Broadcasting in Bounded Degree Graphs.
SIAM J. Discret. Math., 1992

Minimum Broadcast Digraphs.
Discret. Appl. Math., 1992

Sparse broadcast graphs.
Discret. Appl. Math., 1992

Fault Tolerance for Multistage Interconnection Networks.
Proceedings of the Computing and Information, 1992

1991
Additive Spanners for Hypercubes.
Parallel Process. Lett., 1991

A Fault-Tolerant Binary Tree Architecture.
Proceedings of the Advances in Computing and Information, 1991

1990
Report on WOBCATS meeting.
SIGACT News, 1990

1989
A proposal for a fault-tolerant binary hypercube architecture.
Proceedings of the Nineteenth International Symposium on Fault-Tolerant Computing, 1989

1988
Broadcast Networks of Bounded Degree.
SIAM J. Discret. Math., 1988

Generalizations of broadcasting and gossiping.
Networks, 1988

A survey of gossiping and broadcasting in communication networks.
Networks, 1988

Broadcasting in one dimension.
Discret. Appl. Math., 1988

1985
Fault-tolerant broadcast graphs.
Networks, 1985

1984
Toward optimal gossiping schemes with conference calls.
Discret. Appl. Math., 1984

1982
Scheduling with Slack Time.
Acta Informatica, 1982


  Loading...