Arthur L. Liestman

From MaRDI portal
Person:186178

Available identifiers

zbMath Open liestman.arthur-lMaRDI QIDQ186178

List of research outcomes

PublicationDate of PublicationType
Minimum multiple originator broadcast graphs2017-03-15Paper
Upper bounds on the broadcast function using minimum dominating sets2012-10-16Paper
Nonadaptive broadcasting in trees2011-03-16Paper
Messy broadcasting - decentralized broadcast schemes with limited knowledge2011-03-10Paper
Broadcasting from multiple originators2010-04-28Paper
A linear algorithm for finding the k‐broadcast center of a tree2009-07-28Paper
Edge-disjoint spanners in tori2009-06-19Paper
A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS2005-10-19Paper
Edge-disjoint spanners in Cartesian products of graphs2005-08-17Paper
Factor \(d\)-domatic colorings of graphs2003-04-28Paper
On the monotonicity of the broadcast function2003-04-28Paper
Edge-disjoint spanners of complete bipartite graphs2002-03-29Paper
k-Broadcasting in trees2002-01-14Paper
Improved upper and lower bounds fork-broadcasting2001-06-20Paper
The even adjacency split problem for graphs2000-11-27Paper
Degree-Constrained Network Spanners with Nonconstant Delay2000-07-04Paper
More broadcast graphs2000-05-08Paper
Edge-disjoint spanners of complete graphs and complete digraphs1999-12-20Paper
A Note on the Dimensionality of Modified Knödel Graphs1997-11-20Paper
Degree-constrained spanners for multidimensional grids1996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48878891996-11-17Paper
Reliable broadcasting1995-03-05Paper
Grid spanners1993-09-05Paper
Additive graph spanners1993-08-23Paper
Minimum broadcast digraphs1993-01-16Paper
Sparse broadcast graphs1992-09-27Paper
Broadcasting in Bounded Degree Graphs1992-06-28Paper
Broadcasting in one dimension1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34744961988-01-01Paper
Generalizations of broadcasting and gossiping1988-01-01Paper
A survey of gossiping and broadcasting in communication networks1988-01-01Paper
Broadcast Networks of Bounded Degree1988-01-01Paper
A fault-tolerant scheduling problem1986-01-01Paper
Fault-tolerant broadcast graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37105431985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37186241985-01-01Paper
Toward optimal gossiping schemes with conference calls1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33375111984-01-01Paper
Scheduling with slack time1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36633351982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Arthur L. Liestman