Arthur L. Liestman

2009
39	EE	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)
2005
38	EE	Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu: Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks. QSHINE 2005: 7
37	EE	Yuanzhu Peter Chen, Arthur L. Liestman: Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks 3(5): 629-642 (2005)
36	EE	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)
2004
35	EE	Roger Labahn, Arthur L. Liestman, Erich Prisner: Preface. Discrete Applied Mathematics 137(2): 125-126 (2004)
2003
34	EE	Hovhannes A. Harutyunyan, Arthur L. Liestman: On the monotonicity of the broadcast function. Discrete Mathematics 262(1-3): 149-157 (2003)
33	EE	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)
32	EE	Yuanzhu Peter Chen, Arthur L. Liestman: A Zonal Algorithm for Clustering An Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 305-322 (2003)
31	EE	Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman: Messy Broadcasting in Multidimensional Directed Tori. Journal of Interconnection Networks 4(1): 37-51 (2003)
2002
30	EE	Yuanzhu Peter Chen, Arthur L. Liestman: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. MobiHoc 2002: 165-172
2001
29	EE	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)
28	EE	Hovhannes A. Harutyunyan, Arthur L. Liestman: Improved upper and lower bounds for k-broadcasting. Networks 37(2): 94-101 (2001)
27	EE	Hovhannes A. Harutyunyan, Arthur L. Liestman: k-Broadcasting in trees. Networks 38(3): 163-168 (2001)
2000
26	EE	Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman: Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281
25		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)
1999
24	EE	Hovhannes A. Harutyunyan, Arthur L. Liestman: More Broadcast Graphs. Discrete Applied Mathematics 98(1-2): 81-102 (1999)
23	EE	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)
1998
22		Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá: Network Properties of Double and Triple Fixed Step Graphs. Int. J. Found. Comput. Sci. 9(1): 57- (1998)
21		Arthur L. Liestman, Natasa Przulj: Minimum Average Time Broadcast Graphs. Parallel Processing Letters 8(2): 139-140 (1998)
20		Hovhannes A. Harutyunyan, Arthur L. Liestman: Messy Broadcasting. Parallel Processing Letters 8(2): 149-159 (1998)
1997
19	EE	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
18		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- (1997)
1996
17	EE	Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte: Degree-constrained Spanners for Multidimensional Grids. Discrete Applied Mathematics 68(1-2): 119-144 (1996)
1995
16		Dana S. Richards, Arthur L. Liestman: Degree-Constrained Pyramid Spanners. J. Parallel Distrib. Comput. 25(1): 1-6 (1995)
15	EE	Arthur L. Liestman, Thomas C. Shermer: Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discrete Math. 8(2): 291-321 (1995)
1994
14		Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards: Reliable broadcasting. Discrete Applied Mathematics 53(1-3): 135-148 (1994)
1993
13		Arthur L. Liestman, Dana S. Richards: An Introduction to Perpetual Gossiping. ISAAC 1993: 259-266
12	EE	Arthur L. Liestman, Dana S. Richards: Network Communication in Edge-Colored Graphs: Gossiping. IEEE Trans. Parallel Distrib. Syst. 4(4): 438-445 (1993)
11		Arthur L. Liestman, Dana S. Richards: Perpetual Gossiping. Parallel Processing Letters 3: 347-355 (1993)
10		Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau: Open Problems. Parallel Processing Letters 3: 507-524 (1993)
1992
9		Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman: Fault Tolerance for Multistage Interconnection Networks. ICCI 1992: 430-435
8	EE	Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Sparse broadcast graphs. Discrete Applied Mathematics 36(2): 97-130 (1992)
7	EE	Arthur L. Liestman, Joseph G. Peters: Minimum Broadcast Digraphs. Discrete Applied Mathematics 37/38: 401-419 (1992)
6		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)
1991
5		Siu-Cheung Chau, Arthur L. Liestman: A Fault-Tolerant Binary Tree Architecture. ICCI 1991: 335-346
4		Arthur L. Liestman, Thomas C. Shermer: Additive Spanners for Hypercubes. Parallel Processing Letters 1: 35-42 (1991)
1988
3	EE	Pavol Hell, Arthur L. Liestman: Broadcasting in one dimension. Discrete Applied Mathematics 21(2): 101-111 (1988)
2		Arthur L. Liestman, Joseph G. Peters: Broadcast Networks of Bounded Degree. SIAM J. Discrete Math. 1(4): 531-540 (1988)
1982
1		C. L. Liu, Jane W.-S. Liu, Arthur L. Liestman: Scheduling with Slack Time. Acta Inf. 17: 31-41 (1982)

Coauthor Index

1	Noga Alon	[33]
2	Jean-Claude Bermond	[6] [8] [18]
3	Siu-Cheung Chau	[5] [9]
4	Yuanzhu Peter Chen	[30] [32] [37] [38]
5	Grant A. Cheston	[25]
6	Francesc Comellas	[31]
7	Guillaume Fertin	[33] [36]
8	Pierre Fraigniaud	[10]
9	Luisa Gargano	[14]
10	Hovhannes A. Harutyunyan	[18] [20] [24] [27] [28] [31] [34] [39]
11	Stephen T. Hedetniemi	[25]
12	Pavol Hell	[3] [6] [8]
13	Roger Labahn	[35]
14	Christian Laforest	[19] [23] [29]
15	C. L. Liu (Chung Laung (Dave) Liu)	[1]
16	Jane W.-S. Liu	[1]
17	Jiangchuan Liu	[38]
18	Jaroslav Opatrny	[22]
19	David Peleg	[23]
20	Stéphane Pérennes (Stephane Perennes)	[18]
21	Joseph G. Peters	[2] [6] [7] [8] [14]
22	Erich Prisner	[35]
23	Natasa Przulj	[21]
24	Dana S. Richards	[11] [12] [13] [14] [16]
25	Bin Shao	[39]
26	Thomas C. Shermer	[4] [15] [17] [19] [23] [26] [29] [33] [36]
27	Dominique Sotteau	[10] [19] [23] [29]
28	Ladislav Stacho	[33] [36]
29	J. B. Stehman	[25]
30	Christopher R. Stolte	[17]
31	Matthew Suderman (Matthew J. Suderman)	[26]
32	Marisa Zaragozá	[22]
33	Weining Zhang	[9]

Colors in the list of coauthors