David W. Mauro

658 total citations
20 papers, 503 citations indexed

About

David W. Mauro is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, David W. Mauro has authored 20 papers receiving a total of 503 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 12 papers in Electrical and Electronic Engineering and 2 papers in Computer Networks and Communications. Recurrent topics in David W. Mauro's work include Graph Labeling and Dimension Problems (17 papers), Advanced Graph Theory Research (15 papers) and graph theory and CDMA systems (12 papers). David W. Mauro is often cited by papers focused on Graph Labeling and Dimension Problems (17 papers), Advanced Graph Theory Research (15 papers) and graph theory and CDMA systems (12 papers). David W. Mauro collaborates with scholars based in United States, South Korea and Ireland. David W. Mauro's co-authors include John P. Georges, Melanie Stein, David Erwin and Yan Wang and has published in prestigious journals such as Biometrika, The Annals of Statistics and Discrete Applied Mathematics.

In The Last Decade

David W. Mauro

19 papers receiving 422 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
David W. Mauro United States	10	479	333	66	38	20	20	503
John P. Georges United States	9	492 1.0×	339 1.0×	73 1.1×	39 1.0×	24 1.2×	21	508
David Kuo Taiwan	9	488 1.0×	302 0.9×	59 0.9×	56 1.5×	35 1.8×	25	519
Daphne Der‐Fen Liu United States	14	532 1.1×	232 0.7×	187 2.8×	40 1.1×	82 4.1×	41	552
Daniel Gonçalves France	7	231 0.5×	65 0.2×	47 0.7×	47 1.2×	32 1.6×	38	254
Pranava K. Jha United States	12	253 0.5×	205 0.6×	55 0.8×	76 2.0×	56 2.8×	39	331
V. E. Alekseev Russia	9	242 0.5×	52 0.2×	97 1.5×	78 2.1×	54 2.7×	24	297
János Barát Hungary	9	215 0.4×	71 0.2×	127 1.9×	36 0.9×	47 2.4×	42	270
Nora Hartsfield United States	7	199 0.4×	50 0.2×	33 0.5×	19 0.5×	41 2.0×	19	255
Tomáš Kaiser Czechia	12	348 0.7×	73 0.2×	194 2.9×	59 1.6×	109 5.5×	60	404
Raul Cordovil Portugal	9	130 0.3×	62 0.2×	105 1.6×	12 0.3×	55 2.8×	30	222

Countries citing papers authored by David W. Mauro

Since Specialization

Citations

This map shows the geographic impact of David W. Mauro'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 David W. Mauro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David W. Mauro more than expected).

Fields of papers citing papers by David W. Mauro

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David W. Mauro. 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 David W. Mauro. The network helps show where David W. Mauro may publish in the future.

Co-authorship network of co-authors of David W. Mauro

This figure shows the co-authorship network connecting the top 25 collaborators of David W. Mauro. A scholar is included among the top collaborators of David W. Mauro 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 David W. Mauro. David W. Mauro 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

Georges, John P., et al.. (2016). On zero-sum $$\mathbb {Z}_{2j}^k$$ Z 2 j k -magic graphs. Journal of Combinatorial Optimization. 34(1). 94–113. 1 indexed citations

Georges, John P., et al.. (2013). On Zero-Sum Zk-Magic Labelings of 3-Regular Graphs. 2 indexed citations

Georges, John P., et al.. (2013). The domination number of K_{n}^3. Discussiones Mathematicae Graph Theory. 34(3). 629–629.

Georges, John P., et al.. (2012). Relating edge-coverings to the classification of Z2k-magic graphs. Discrete Mathematics. 312(19). 2938–2945. 1 indexed citations

Georges, John P., et al.. (2012). On Zero-Sum $${\mathbb{Z}_k}$$ -Magic Labelings of 3-Regular Graphs. Graphs and Combinatorics. 29(3). 387–398. 2 indexed citations

Georges, John P., David W. Mauro, & Yan Wang. (2009). Labeling the r-path with a condition at distance two. Discrete Applied Mathematics. 157(15). 3203–3215. 1 indexed citations

Georges, John P. & David W. Mauro. (2005). On the Structure of Graphs with Non-Surjective L(2,1)-Labelings. SIAM Journal on Discrete Mathematics. 19(1). 208–223. 7 indexed citations

Erwin, David, John P. Georges, & David W. Mauro. (2005). On labeling the vertices of products of complete graphs with distance constraints. Naval Research Logistics (NRL). 52(2). 138–141. 10 indexed citations

Georges, John P. & David W. Mauro. (2004). Edge Labelings with a Condition at Distance Two.. Ars Combinatoria. 70. 8 indexed citations

10.

Georges, John P. & David W. Mauro. (2004). A note on collections of graphs with non-surjective lambda labelings. Discrete Applied Mathematics. 146(1). 92–98. 5 indexed citations

11.

Georges, John P. & David W. Mauro. (2003). On Regular Graphs Optimally Labeled with a Condition at Distance Two. SIAM Journal on Discrete Mathematics. 17(2). 320–331. 19 indexed citations

12.

Georges, John P. & David W. Mauro. (2002). Labeling trees with a condition at distance two. Discrete Mathematics. 269(1-3). 127–148. 42 indexed citations

13.

Georges, John P. & David W. Mauro. (2002). On generalized Petersen graphs labeled with a condition at distance two. Discrete Mathematics. 259(1-3). 311–318. 27 indexed citations

14.

Georges, John P., David W. Mauro, & Melanie Stein. (2001). Labeling Products of Complete Graphs with a Condition at Distance Two. SIAM Journal on Discrete Mathematics. 14(1). 28–35. 89 indexed citations

15.

Georges, John P. & David W. Mauro. (1996). On the size of graphs labeled with a condition at distance two. Journal of Graph Theory. 22(1). 47–57. 9 indexed citations

16.

Georges, John P. & David W. Mauro. (1996). On the size of graphs labeled with a condition at distance two. Journal of Graph Theory. 22(1). 47–57. 45 indexed citations

17.

Georges, John P., et al.. (1995). On the $\lambda$-Number of $Q_n $ and Related Graphs. SIAM Journal on Discrete Mathematics. 8(4). 499–506. 123 indexed citations

18.

Georges, John P., et al.. (1994). Relating path coverings to vertex labellings with a condition at distance two. Discrete Mathematics. 135(1-3). 103–111. 95 indexed citations

19.

Mauro, David W.. (1985). A Combinatoric Approach to the Kaplan-Meier Estimator. The Annals of Statistics. 13(1). 16 indexed citations

20.

Mauro, David W.. (1983). A note on the consistency of Kaplan-Meier least squares estimators. Biometrika. 70(2). 534–535. 1 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