Arthur L. Liestman

Available identifiers

zbMath Open liestman.arthur-lMaRDI QIDQ186178

List of research outcomes

Publication	Date of Publication	Type
Minimum multiple originator broadcast graphs	2017-03-15	Paper
Upper bounds on the broadcast function using minimum dominating sets	2012-10-16	Paper
Nonadaptive broadcasting in trees	2011-03-16	Paper
Messy broadcasting - decentralized broadcast schemes with limited knowledge	2011-03-10	Paper
Broadcasting from multiple originators	2010-04-28	Paper
A linear algorithm for finding the k‐broadcast center of a tree	2009-07-28	Paper
Edge-disjoint spanners in tori	2009-06-19	Paper
A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS	2005-10-19	Paper
Edge-disjoint spanners in Cartesian products of graphs	2005-08-17	Paper
Factor \(d\)-domatic colorings of graphs	2003-04-28	Paper
On the monotonicity of the broadcast function	2003-04-28	Paper
Edge-disjoint spanners of complete bipartite graphs	2002-03-29	Paper
k-Broadcasting in trees	2002-01-14	Paper
Improved upper and lower bounds fork-broadcasting	2001-06-20	Paper
The even adjacency split problem for graphs	2000-11-27	Paper
Degree-Constrained Network Spanners with Nonconstant Delay	2000-07-04	Paper
More broadcast graphs	2000-05-08	Paper
Edge-disjoint spanners of complete graphs and complete digraphs	1999-12-20	Paper
A Note on the Dimensionality of Modified Knödel Graphs	1997-11-20	Paper
Degree-constrained spanners for multidimensional grids	1996-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4887889	1996-11-17	Paper
Reliable broadcasting	1995-03-05	Paper
Grid spanners	1993-09-05	Paper
Additive graph spanners	1993-08-23	Paper
Minimum broadcast digraphs	1993-01-16	Paper
Sparse broadcast graphs	1992-09-27	Paper
Broadcasting in Bounded Degree Graphs	1992-06-28	Paper
Broadcasting in one dimension	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3474496	1988-01-01	Paper
Generalizations of broadcasting and gossiping	1988-01-01	Paper
A survey of gossiping and broadcasting in communication networks	1988-01-01	Paper
Broadcast Networks of Bounded Degree	1988-01-01	Paper
A fault-tolerant scheduling problem	1986-01-01	Paper
Fault-tolerant broadcast graphs	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3710543	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3718624	1985-01-01	Paper
Toward optimal gossiping schemes with conference calls	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3337511	1984-01-01	Paper
Scheduling with slack time	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3663335	1982-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Arthur L. Liestman