David A. Grable

409 total citations
22 papers, 254 citations indexed

About

David A. Grable is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, David A. Grable has authored 22 papers receiving a total of 254 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 11 papers in Discrete Mathematics and Combinatorics and 6 papers in Computer Networks and Communications. Recurrent topics in David A. Grable's work include Advanced Graph Theory Research (15 papers), Limits and Structures in Graph Theory (11 papers) and Complexity and Algorithms in Graphs (9 papers). David A. Grable is often cited by papers focused on Advanced Graph Theory Research (15 papers), Limits and Structures in Graph Theory (11 papers) and Complexity and Algorithms in Graphs (9 papers). David A. Grable collaborates with scholars based in Germany, United States and Denmark. David A. Grable's co-authors include Alessandro Panconesi, Devdatt Dubhashi, Kevin T. Phelps, Dan Archdeacon, Graham Brightwell and Hans Jürgen Prömel and has published in prestigious journals such as Theoretical Computer Science, Discrete Mathematics and Journal of Algorithms.

In The Last Decade

David A. Grable

22 papers receiving 217 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
David A. Grable Germany	10	169	114	71	51	46	22	254
Jonathan F. Buss Canada	8	215 1.3×	98 0.9×	48 0.7×	96 1.9×	33 0.7×	20	314
Robin A. Moser Switzerland	4	191 1.1×	55 0.5×	68 1.0×	78 1.5×	21 0.5×	5	259
Phyllis Zweig Chinn United States	4	227 1.3×	91 0.8×	35 0.5×	24 0.5×	59 1.3×	11	286
V. E. Alekseev Russia	9	242 1.4×	78 0.7×	97 1.4×	14 0.3×	52 1.1×	24	297
Zevi Miller United States	9	184 1.1×	63 0.6×	71 1.0×	32 0.6×	67 1.5×	29	261
Frank R. Bernhart United States	3	122 0.7×	43 0.4×	59 0.8×	29 0.6×	56 1.2×	5	240
Arie Matsliah Israel	9	254 1.5×	77 0.7×	76 1.1×	123 2.4×	32 0.7×	26	319
Ajai Kapoor Italy	10	213 1.3×	42 0.4×	84 1.2×	30 0.6×	59 1.3×	16	263
Lúcia Draque Penso Germany	9	203 1.2×	73 0.6×	58 0.8×	22 0.4×	21 0.5×	32	274
Luis Goddyn Canada	11	286 1.7×	42 0.4×	171 2.4×	30 0.6×	113 2.5×	30	372

Countries citing papers authored by David A. Grable

Since Specialization

Citations

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

Fields of papers citing papers by David A. Grable

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of David A. Grable

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

Grable, David A. & Alessandro Panconesi. (2000). Fast Distributed Algorithms for Brooks–Vizing Colorings. Journal of Algorithms. 37(1). 85–120. 19 indexed citations

Brightwell, Graham, David A. Grable, & Hans Jürgen Prömel. (1999). Forbidden induced partial orders. Discrete Mathematics. 201(1-3). 53–80. 5 indexed citations

Grable, David A. & Alessandro Panconesi. (1998). Fast distributed algorithms for Brooks-Vizing colourings. Symposium on Discrete Algorithms. 37(1). 473–480. 9 indexed citations

Dubhashi, Devdatt, David A. Grable, & Alessandro Panconesi. (1998). Near-optimal, distributed edge colouring via the nibble method. Theoretical Computer Science. 203(2). 225–251. 32 indexed citations

Grable, David A.. (1998). A Large Deviation Inequality for Functions of Independent, Multi-Way Choices. Combinatorics Probability Computing. 7(1). 57–63. 13 indexed citations

Grable, David A. & Alessandro Panconesi. (1997). Nearly optimal distributed edge colouring in O(log log n) rounds. Symposium on Discrete Algorithms. 278–285. 33 indexed citations

Grable, David A.. (1997). On Random Greedy Triangle Packing. The Electronic Journal of Combinatorics. 4(1). 12 indexed citations

Grable, David A. & Alessandro Panconesi. (1997). Nearly optimal distributed edge coloring in O(log log n) rounds. Random Structures and Algorithms. 10(3). 385–405. 35 indexed citations

Grable, David A. & Alessandro Panconesi. (1997). Nearly optimal distributed edge coloring in O(log log n) rounds. Random Structures and Algorithms. 10(3). 385–405. 15 indexed citations

10.

Grable, David A. & Alessandro Panconesi. (1997). Fast Distributed Algorithms for Brooks-Vizing Colourings (Extended Abstract). BRICS Report Series. 4(37). 8 indexed citations

11.

Dubhashi, Devdatt, David A. Grable, & Alessandro Panconesi. (1996). Near-Optimal, Distributed Edge Colouring via the Nibble Method. BRICS Report Series. 3(11). 1 indexed citations

12.

Grable, David A.. (1996). Nearly-perfect hypergraph packing is in NC. Information Processing Letters. 60(6). 295–299. 11 indexed citations

13.

Grable, David A. & Kevin T. Phelps. (1996). Random methods in design theory: A survey. Journal of Combinatorial Designs. 4(4). 255–273. 9 indexed citations

14.

Grable, David A., et al.. (1996). Set intersection representations for almost all graphs. Journal of Graph Theory. 23(3). 309–320. 4 indexed citations

15.

Archdeacon, Dan & David A. Grable. (1995). The genus of a random graph. Discrete Mathematics. 142(1-3). 21–37. 7 indexed citations

16.

Grable, David A.. (1995). The diameter of a random graph with bounded diameter. Random Structures and Algorithms. 6(2-3). 193–200. 2 indexed citations

17.

Grable, David A., et al.. (1995). The minimum independence number for designs. COMBINATORICA. 15(2). 175–185. 11 indexed citations

18.

Grable, David A.. (1994). Hypergraphs and sharpened sieve inequalities. Discrete Mathematics. 132(1-3). 75–82. 2 indexed citations

19.

Grable, David A.. (1993). Sharpened Bonferroni Inequalities. Journal of Combinatorial Theory Series B. 57(1). 131–137. 8 indexed citations

20.

Grable, David A.. (1991). Two Packing Problems on k-Matroid Trees. European Journal of Combinatorics. 12(4). 309–316. 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