Arthur L. Liestman

	2011
45		Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman: Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discrete Applied Mathematics 159(5): 322-327 (2011)
44		Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer: Nonadaptive broadcasting in trees. Networks 57(2): 157-168 (2011)
	2009
43		Arthur L. Liestman, Dana S. Richards, Ladislav Stacho: Broadcasting from multiple originators. Discrete Applied Mathematics 157(13): 2886-2891 (2009)
42		Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in tori. Discrete Mathematics 309(8): 2239-2249 (2009)
41		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
40		Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu: Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks. QSHINE 2005: 7
39		Yuanzhu Peter Chen, Arthur L. Liestman: Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks 3(5): 629-642 (2005)
38		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
37		Roger Labahn, Arthur L. Liestman, Erich Prisner: Preface. Discrete Applied Mathematics 137(2): 125-126 (2004)
	2003
36		Hovhannes A. Harutyunyan, Arthur L. Liestman: On the monotonicity of the broadcast function. Discrete Mathematics 262(1-3): 149-157 (2003)
35		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)
34		Yuanzhu Peter Chen, Arthur L. Liestman: A Zonal Algorithm for Clustering An Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 305-322 (2003)
33		Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman: Messy Broadcasting in Multidimensional Directed Tori. Journal of Interconnection Networks 4(1): 37-51 (2003)
	2002
32		Yuanzhu Peter Chen, Arthur L. Liestman: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. MobiHoc 2002: 165-172
	2001
31		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)
30		Hovhannes A. Harutyunyan, Arthur L. Liestman: Improved upper and lower bounds for k-broadcasting. Networks 37(2): 94-101 (2001)
29		Hovhannes A. Harutyunyan, Arthur L. Liestman: k-Broadcasting in trees. Networks 38(3): 163-168 (2001)
	2000
28		Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman: Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281
27		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
26		Hovhannes A. Harutyunyan, Arthur L. Liestman: More Broadcast Graphs. Discrete Applied Mathematics 98(1-2): 81-102 (1999)
25		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
24		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)
23		Arthur L. Liestman, Natasa Przulj: Minimum Average Time Broadcast Graphs. Parallel Processing Letters 8(2): 139-140 (1998)
22		Hovhannes A. Harutyunyan, Arthur L. Liestman: Messy Broadcasting. Parallel Processing Letters 8(2): 149-159 (1998)
	1997
21		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
20		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
19		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
18		Dana S. Richards, Arthur L. Liestman: Degree-Constrained Pyramid Spanners. J. Parallel Distrib. Comput. 25(1): 1-6 (1995)
17		Arthur L. Liestman, Thomas C. Shermer: Degree-Constrained Network Spanners with Nonconstant Delay. SIAM J. Discrete Math. 8(2): 291-321 (1995)
	1994
16		Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards: Reliable broadcasting. Discrete Applied Mathematics 53(1-3): 135-148 (1994)
	1993
15		Arthur L. Liestman, Dana S. Richards: An Introduction to Perpetual Gossiping. ISAAC 1993: 259-266
14		Arthur L. Liestman, Dana S. Richards: Network Communication in Edge-Colored Graphs: Gossiping. IEEE Trans. Parallel Distrib. Syst. 4(4): 438-445 (1993)
13		Arthur L. Liestman, Dana S. Richards: Perpetual Gossiping. Parallel Processing Letters 3: 347-355 (1993)
12		Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau: Open Problems. Parallel Processing Letters 3: 507-524 (1993)
	1992
11		Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman: Fault Tolerance for Multistage Interconnection Networks. ICCI 1992: 430-435
10		Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Sparse broadcast graphs. Discrete Applied Mathematics 36(2): 97-130 (1992)
9		Arthur L. Liestman, Joseph G. Peters: Minimum Broadcast Digraphs. Discrete Applied Mathematics 37/38: 401-419 (1992)
8		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
7		Siu-Cheung Chau, Arthur L. Liestman: A Fault-Tolerant Binary Tree Architecture. ICCI 1991: 335-346
6		Arthur L. Liestman, Thomas C. Shermer: Additive Spanners for Hypercubes. Parallel Processing Letters 1: 35-42 (1991)
	1990
5		Arthur L. Liestman: Report on WOBCATS meeting. SIGACT News 21(2): 32 (1990)
	1989
4		Siu-Cheung Chau, Arthur L. Liestman: A proposal for a fault-tolerant binary hypercube architecture. FTCS 1989: 323-330
	1988
3		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	[35]
2	Jean-Claude Bermond	[8] [10] [20]
3	Siu-Cheung Chau	[4] [7] [11]
4	Yuanzhu Peter Chen	[32] [34] [39] [40]
5	Grant A. Cheston	[27]
6	Francesc Comellas	[33]
7	Guillaume Fertin	[35] [38]
8	Pierre Fraigniaud	[12]
9	Luisa Gargano	[16]
10	Hovhannes A. Harutyunyan	[20] [22] [26] [29] [30] [33] [36] [41] [44] [45]
11	Stephen T. Hedetniemi	[27]
12	Pavol Hell	[3] [8] [10] [45]
13	Roger Labahn	[37]
14	Christian Laforest	[21] [25] [31]
15	C. L. Liu (Chung Laung (Dave) Liu)	[1]
16	Jane W.-S. Liu	[1]
17	Jiangchuan Liu	[40]
18	Kazuhisa Makino	[44]
19	Jaroslav Opatrny	[24]
20	David Peleg	[25]
21	Stéphane Pérennes (Stephane Perennes)	[20]
22	Joseph G. Peters	[2] [8] [9] [10] [16]
23	Erich Prisner	[37]
24	Natasa Przulj	[23]
25	Dana S. Richards (Dana Richards)	[13] [14] [15] [16] [18] [43]
26	Bin Shao	[41]
27	Thomas C. Shermer	[6] [17] [19] [21] [25] [28] [31] [35] [38] [42] [44]
28	Dominique Sotteau	[12] [21] [25] [31]
29	Ladislav Stacho	[35] [38] [42] [43]
30	J. B. Stehman	[27]
31	Chris Stolte (Christopher R. Stolte)	[19]
32	Matthew Suderman (Matthew J. Suderman)	[28]
33	Marisa Zaragozá	[24]
34	Weining Zhang	[11]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page