Arthur L. Liestman

2.7k total citations · 1 hit paper
41 papers, 1.6k citations indexed

About

Arthur L. Liestman is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Arthur L. Liestman has authored 41 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computer Networks and Communications, 26 papers in Computational Theory and Mathematics and 8 papers in Geometry and Topology. Recurrent topics in Arthur L. Liestman's work include Interconnection Networks and Systems (18 papers), Advanced Graph Theory Research (16 papers) and Cooperative Communication and Network Coding (13 papers). Arthur L. Liestman is often cited by papers focused on Interconnection Networks and Systems (18 papers), Advanced Graph Theory Research (16 papers) and Cooperative Communication and Network Coding (13 papers). Arthur L. Liestman collaborates with scholars based in Canada, France and United States. Arthur L. Liestman's co-authors include Sandra M. Hedetniemi, Stephen T. Hedetniemi, Yuanzhu Peter Chen, Roy H. Campbell, Thomas C. Shermer, Hovhannes A. Harutyunyan, Joseph G. Peters, Jiangchuan Liu, Dana Richards and Jean‐Claude Bermond and has published in prestigious journals such as IEEE Transactions on Software Engineering, Ad Hoc Networks and Networks.

In The Last Decade

Arthur L. Liestman

40 papers receiving 1.4k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

A survey of gossiping and broadcasting in communication networks

1988 766 citations Arthur L. Liestman et al. Networks profile →

Peers

Arthur L. Liestman

CNC

CTM

EEE

HA

SNP

Pierre Fraigniaud France

Christian Scheideler Germany

Bernard Mans Australia

Lawrence T. Kou United States

L. Berman United States

Maurizio A. Bonuccelli Italy

Khaled Day Oman

Ralf Klasing France

Kemal Efe United States

Joseph Cheriyan Canada

Pierre Fraigniaud France

Arthur L. Liestman

948 ×0.7

CNC

265 ×0.6

CTM

134 ×0.4

EEE

62 ×0.4

HA

35 ×0.4

SNP

Citations per year, relative to Arthur L. Liestman Arthur L. Liestman (= 1×) peers Pierre Fraigniaud

Countries citing papers authored by Arthur L. Liestman

Since Specialization

Citations

This map shows the geographic impact of Arthur L. Liestman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Arthur L. Liestman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arthur L. Liestman more than expected).

Fields of papers citing papers by Arthur L. Liestman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Arthur L. Liestman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Arthur L. Liestman. The network helps show where Arthur L. Liestman may publish in the future.

Co-authorship network of co-authors of Arthur L. Liestman

This figure shows the co-authorship network connecting the top 25 collaborators of Arthur L. Liestman. A scholar is included among the top collaborators of Arthur L. Liestman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Arthur L. Liestman. Arthur L. Liestman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Harutyunyan, Hovhannes A. & Arthur L. Liestman. (2012). Upper bounds on the broadcast function using minimum dominating sets. Discrete Mathematics. 312(20). 2992–2996. 11 indexed citations

2.

Harutyunyan, Hovhannes A., Arthur L. Liestman, Kazuhisa Makino, & Thomas C. Shermer. (2010). Nonadaptive broadcasting in trees. Networks. 57(2). 157–168. 4 indexed citations

3.

Harutyunyan, Hovhannes A., Pavol Hell, & Arthur L. Liestman. (2010). Messy broadcasting — Decentralized broadcast schemes with limited knowledge. Discrete Applied Mathematics. 159(5). 322–327. 2 indexed citations

4.

Liestman, Arthur L., Dana Richards, & Ladislav Stacho. (2009). Broadcasting from multiple originators. Discrete Applied Mathematics. 157(13). 2886–2891. 1 indexed citations

5.

Liestman, Arthur L., Thomas C. Shermer, & Ladislav Stacho. (2008). Edge-disjoint spanners in tori. Discrete Mathematics. 309(8). 2239–2249. 4 indexed citations

6.

Fertin, Guillaume, Arthur L. Liestman, Thomas C. Shermer, & Ladislav Stacho. (2005). Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics. 296(2-3). 167–186. 3 indexed citations

7.

Chen, Yuanzhu Peter & Arthur L. Liestman. (2004). Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks. 3(5). 629–642. 23 indexed citations

8.

Alon, Noga, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, & Ladislav Stacho. (2003). Factor d-domatic colorings of graphs. Discrete Mathematics. 262(1-3). 17–25. 1 indexed citations

9.

Harutyunyan, Hovhannes A. & Arthur L. Liestman. (2003). On the monotonicity of the broadcast function. Discrete Mathematics. 262(1-3). 149–157. 10 indexed citations

10.

Chen, Yuanzhu Peter & Arthur L. Liestman. (2002). Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. 165–172. 156 indexed citations

11.

Harutyunyan, Hovhannes A. & Arthur L. Liestman. (2001). Improved upper and lower bounds fork-broadcasting. Networks. 37(2). 94–101. 15 indexed citations

12.

Harutyunyan, Hovhannes A. & Arthur L. Liestman. (1999). More broadcast graphs. Discrete Applied Mathematics. 98(1-2). 81–102. 17 indexed citations

13.

Liestman, Arthur L., et al.. (1999). Edge-disjoint spanners of complete graphs and complete digraphs. Discrete Mathematics. 203(1-3). 133–159. 3 indexed citations

14.

Liestman, Arthur L., et al.. (1996). Degree-constrained spanners for multidimensional grids. Discrete Applied Mathematics. 68(1-2). 119–144. 6 indexed citations

15.

Gargano, Luisa, Arthur L. Liestman, Joseph G. Peters, & Dana Richards. (1994). Reliable broadcasting. Discrete Applied Mathematics. 53(1-3). 135–148. 7 indexed citations

16.

Liestman, Arthur L., et al.. (1993). OPEN PROBLEMS. Parallel Processing Letters. 3(4). 507–524. 2 indexed citations

17.

Bermond, Jean‐Claude, Pavol Hell, Arthur L. Liestman, & Joseph G. Peters. (1992). Sparse broadcast graphs. Discrete Applied Mathematics. 36(2). 97–130. 35 indexed citations

18.

Liestman, Arthur L. & Thomas C. Shermer. (1991). ADDITIVE SPANNERS FOR HYPERCUBES. Parallel Processing Letters. 1(1). 35–42. 16 indexed citations

19.

Hell, Pavol & Arthur L. Liestman. (1988). Broadcasting in one dimension. Discrete Applied Mathematics. 21(2). 101–111. 6 indexed citations

20.

Liestman, Arthur L. & Dana Richards. (1984). Toward optimal gossiping schemes with conference calls. Discrete Applied Mathematics. 7(2). 183–189. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact