The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arthur L. Liestman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
    Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:191-199 [Conf]
  2. Siu-Cheung Chau, Arthur L. Liestman
    A Fault-Tolerant Binary Tree Architecture. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:335-346 [Conf]
  3. Siu-Cheung Chau, Weining Zhang, Arthur L. Liestman
    Fault Tolerance for Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:430-435 [Conf]
  4. Arthur L. Liestman, Dana S. Richards
    An Introduction to Perpetual Gossiping. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:259-266 [Conf]
  5. Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman
    Broadcasting Multiple Messages in Hypercubes (preliminary version). [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:274-281 [Conf]
  6. Yuanzhu Peter Chen, Arthur L. Liestman
    Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2002, pp:165-172 [Conf]
  7. Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu
    Energy-Efficient Data Aggregation Hierarchy for Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    QSHINE, 2005, pp:7- [Conf]
  8. C. L. Liu, Jane W.-S. Liu, Arthur L. Liestman
    Scheduling with Slack Time. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:31-41 [Journal]
  9. Yuanzhu Peter Chen, Arthur L. Liestman
    Maintaining weakly-connected dominating sets for clustering ad hoc networks. [Citation Graph (0, 0)][DBLP]
    Ad Hoc Networks, 2005, v:3, n:5, pp:629-642 [Journal]
  10. Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman
    The even adjacency split problem for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:175-188 [Journal]
  11. Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards
    Reliable broadcasting. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:135-148 [Journal]
  12. Hovhannes A. Harutyunyan, Arthur L. Liestman
    More Broadcast Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:81-102 [Journal]
  13. Roger Labahn, Arthur L. Liestman, Erich Prisner
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:125-126 [Journal]
  14. Arthur L. Liestman, Joseph G. Peters
    Minimum Broadcast Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:401-419 [Journal]
  15. Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte
    Degree-constrained Spanners for Multidimensional Grids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:119-144 [Journal]
  16. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Factor d-domatic colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:17-25 [Journal]
  17. Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Edge-disjoint spanners in Cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:296, n:2-3, pp:167-186 [Journal]
  18. Hovhannes A. Harutyunyan, Arthur L. Liestman
    On the monotonicity of the broadcast function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:149-157 [Journal]
  19. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:65-76 [Journal]
  20. Yuanzhu Peter Chen, Arthur L. Liestman
    A Zonal Algorithm for Clustering An Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:305-322 [Journal]
  21. Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
    A Note on the Dimensionality of Modified Knö;del Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:109-0 [Journal]
  22. Arthur L. Liestman, Jaroslav Opatrny, Marisa Zaragozá
    Network Properties of Double and Triple Fixed Step Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:1, pp:57-0 [Journal]
  23. Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman
    Messy Broadcasting in Multidimensional Directed Tori. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2003, v:4, n:1, pp:37-51 [Journal]
  24. Dana S. Richards, Arthur L. Liestman
    Degree-Constrained Pyramid Spanners. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:25, n:1, pp:1-6 [Journal]
  25. Hovhannes A. Harutyunyan, Arthur L. Liestman
    k-Broadcasting in trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:3, pp:163-168 [Journal]
  26. Hovhannes A. Harutyunyan, Arthur L. Liestman
    Improved upper and lower bounds for k-broadcasting. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:94-101 [Journal]
  27. Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
    Open Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:507-524 [Journal]
  28. Hovhannes A. Harutyunyan, Arthur L. Liestman
    Messy Broadcasting. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:149-159 [Journal]
  29. Arthur L. Liestman, Thomas C. Shermer
    Additive Spanners for Hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1991, v:1, n:, pp:35-42 [Journal]
  30. Arthur L. Liestman, Natasa Przulj
    Minimum Average Time Broadcast Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:139-140 [Journal]
  31. Arthur L. Liestman, Dana S. Richards
    Perpetual Gossiping. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:347-355 [Journal]
  32. Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
    Broadcasting in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:10-24 [Journal]
  33. Arthur L. Liestman, Joseph G. Peters
    Broadcast Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:4, pp:531-540 [Journal]
  34. Arthur L. Liestman, Thomas C. Shermer
    Degree-Constrained Network Spanners with Nonconstant Delay. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:291-321 [Journal]
  35. Arthur L. Liestman, Dana S. Richards
    Network Communication in Edge-Colored Graphs: Gossiping. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:4, pp:438-445 [Journal]
  36. Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete graphs and complete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:133-159 [Journal]

  37. Sparse broadcast graphs. [Citation Graph (, )][DBLP]


  38. Broadcasting in one dimension. [Citation Graph (, )][DBLP]


  39. Broadcasting from multiple originators. [Citation Graph (, )][DBLP]


  40. Edge-disjoint spanners in tori. [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.062secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002