Gregory J. Puleo

435 total citations
23 papers, 202 citations indexed

About

Gregory J. Puleo is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Statistical and Nonlinear Physics. According to data from OpenAlex, Gregory J. Puleo has authored 23 papers receiving a total of 202 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 12 papers in Discrete Mathematics and Combinatorics and 5 papers in Statistical and Nonlinear Physics. Recurrent topics in Gregory J. Puleo's work include Advanced Graph Theory Research (13 papers), Limits and Structures in Graph Theory (12 papers) and Graph Labeling and Dimension Problems (9 papers). Gregory J. Puleo is often cited by papers focused on Advanced Graph Theory Research (13 papers), Limits and Structures in Graph Theory (12 papers) and Graph Labeling and Dimension Problems (9 papers). Gregory J. Puleo collaborates with scholars based in United States, China and Canada. Gregory J. Puleo's co-authors include Olgica Milenković, Han Mao Kiah, Son Hoang Dau, Li Pan, Wes Maciejewski, Pan Li, Douglas B. West, Thomas A. Mahoney, Jack P. Hou and Jian Ma and has published in prestigious journals such as Bioinformatics, IEEE Transactions on Information Theory and Journal of Theoretical Biology.

In The Last Decade

Gregory J. Puleo

20 papers receiving 198 citations

Peers

Gregory J. Puleo
David Eisenstat United States
Christian M. Reidys United States
Jonathan Jordan United Kingdom
David Witmer United States
Paul Ruet France
David Eisenstat United States
Gregory J. Puleo
Citations per year, relative to Gregory J. Puleo Gregory J. Puleo (= 1×) peers David Eisenstat

Countries citing papers authored by Gregory J. Puleo

Since Specialization
Citations

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

Fields of papers citing papers by Gregory J. Puleo

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Gregory J. Puleo

This figure shows the co-authorship network connecting the top 25 collaborators of Gregory J. Puleo. A scholar is included among the top collaborators of Gregory J. Puleo 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 Gregory J. Puleo. Gregory J. Puleo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Puleo, Gregory J., et al.. (2022). A lower bound on the saturation number, and graphs for which it is sharp. Discrete Mathematics. 345(7). 112867–112867. 3 indexed citations
2.
Puleo, Gregory J., et al.. (2021). Upper bounds for inverse domination in graphs. 8(2). 1–9. 2 indexed citations
3.
Li, Pan, Gregory J. Puleo, & Olgica Milenković. (2019). Motif and Hypergraph Correlation Clustering. IEEE Transactions on Information Theory. 66(5). 3065–3078. 11 indexed citations
4.
Dau, Son Hoang, Olgica Milenković, & Gregory J. Puleo. (2019). On the triangle clique cover and Kt clique cover problems. Discrete Mathematics. 343(1). 111627–111627. 3 indexed citations
5.
Ravanmehr, Vida, Gregory J. Puleo, Sadegh Bolouki, & Olgica Milenković. (2018). Paired threshold graphs. Discrete Applied Mathematics. 250. 291–308. 1 indexed citations
6.
Puleo, Gregory J.. (2018). Graphs with $$\alpha _1$$ α 1 and $$\tau _1$$ τ 1 Both Large. Graphs and Combinatorics. 34(4). 639–645.
7.
Puleo, Gregory J., et al.. (2018). List-edge-colouring planar graphs with precoloured edges. European Journal of Combinatorics. 75. 55–65. 2 indexed citations
8.
Mahoney, Thomas A., Gregory J. Puleo, & Douglas B. West. (2018). Online sum-paintability: The slow-coloring game. Discrete Mathematics. 341(4). 1084–1093. 1 indexed citations
9.
Puleo, Gregory J.. (2017). Maximal k-edge-colorable subgraphs, Vizing’s Theorem, and Tuza’s Conjecture. Discrete Mathematics. 340(7). 1573–1580. 2 indexed citations
10.
Pan, Li, Son Hoang Dau, Gregory J. Puleo, & Olgica Milenković. (2017). Motif clustering and overlapping clustering for social network analysis. RMIT Research Repository (RMIT University Library). 1–9. 39 indexed citations
11.
Hou, Jack P., et al.. (2016). A new correlation clustering method for cancer mutation analysis. Bioinformatics. 32(24). 3717–3728. 8 indexed citations
12.
Puleo, Gregory J., et al.. (2016). On (4, 2)‐Choosable Graphs. Journal of Graph Theory. 85(2). 412–428. 1 indexed citations
13.
Puleo, Gregory J.. (2015). Tuza’s Conjecture for graphs with maximum average degree less than 7. European Journal of Combinatorics. 49. 134–152. 7 indexed citations
14.
Puleo, Gregory J.. (2015). Extremal aspects of the Erdős–Gallai–Tuza conjecture. Discrete Mathematics. 338(8). 1394–1397.
15.
Puleo, Gregory J. & Olgica Milenković. (2015). Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds. SIAM Journal on Optimization. 25(3). 1857–1872. 13 indexed citations
16.
Maciejewski, Wes & Gregory J. Puleo. (2014). Environmental evolutionary graph theory. Journal of Theoretical Biology. 360. 117–128. 15 indexed citations
17.
Fox, Kyle, et al.. (2014). Spanning Paths in Fibonacci-Sum Graphs. ˜The œFibonacci quarterly. 52(1). 46–49.
18.
Puleo, Gregory J.. (2014). On a Conjecture of Erdős, Gallai, and Tuza. Journal of Graph Theory. 80(1). 12–17. 1 indexed citations
19.
Mahoney, Thomas A., et al.. (2014). Sum-Paintability of Generalized Theta-Graphs. Graphs and Combinatorics. 31(5). 1325–1334. 5 indexed citations
20.
Cranston, Daniel W., et al.. (2012). Revolutionaries and spies: Spy-good and spy-bad graphs. Theoretical Computer Science. 463. 35–53. 2 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

Rankless by CCL
2026