default search action
Gregory J. Puleo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j27]Alex Cameron, Gregory J. Puleo:
A lower bound on the saturation number, and graphs for which it is sharp. Discret. Math. 345(7): 112867 (2022) - [j26]Jessica McDonald, Gregory J. Puleo:
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings. J. Graph Theory 100(4): 653-670 (2022) - 2020
- [j25]Hoang Dau, Olgica Milenkovic, Gregory J. Puleo:
On the triangle clique cover and Kt clique cover problems. Discret. Math. 343(1): 111627 (2020) - [j24]Gregory J. Puleo:
Some Results on Multithreshold Graphs. Graphs Comb. 36(3): 913-919 (2020) - [j23]Jessica McDonald, Gregory J. Puleo, Craig Tennenhouse:
Packing and Covering Directed Triangles. Graphs Comb. 36(4): 1059-1063 (2020) - [j22]Jessica McDonald, Gregory J. Puleo:
t-Cores for (Δ+t) -edge-coloring. J. Graph Theory 95(2): 165-180 (2020) - [j21]Pan Li, Gregory J. Puleo, Olgica Milenkovic:
Motif and Hypergraph Correlation Clustering. IEEE Trans. Inf. Theory 66(5): 3065-3078 (2020) - [i14]Jessica McDonald, Gregory J. Puleo:
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings. CoRR abs/2001.05051 (2020) - [i13]Alex Cameron, Gregory J. Puleo:
A lower bound on the saturation number, and graphs for which it is sharp. CoRR abs/2004.05410 (2020)
2010 – 2019
- 2019
- [j20]Gregory J. Puleo, Douglas B. West:
Online sum-paintability: Slow-coloring of trees. Discret. Appl. Math. 262: 158-168 (2019) - [j19]Joshua Harrelson, Jessica McDonald, Gregory J. Puleo:
List-edge-colouring planar graphs with precoloured edges. Eur. J. Comb. 75: 55-65 (2019) - [i12]Gregory J. Puleo:
Some results on multithreshold graphs. CoRR abs/1905.00099 (2019) - [i11]Elliot Krop, Jessica McDonald, Gregory J. Puleo:
Upper bounds for inverse domination in graphs. CoRR abs/1907.05966 (2019) - 2018
- [j18]Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni:
Extension from Precoloured Sets of Edges. Electron. J. Comb. 25(3): 3 (2018) - [j17]Vida Ravanmehr, Gregory J. Puleo, Sadegh Bolouki, Olgica Milenkovic:
Paired threshold graphs. Discret. Appl. Math. 250: 291-308 (2018) - [j16]Jessica McDonald, Gregory J. Puleo:
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge. Discret. Math. 341(3): 713-722 (2018) - [j15]Thomas Mahoney, Gregory J. Puleo, Douglas B. West:
Online sum-paintability: The slow-coloring game. Discret. Math. 341(4): 1084-1093 (2018) - [j14]Gregory J. Puleo:
Graphs with α1 and τ1 Both Large. Graphs Comb. 34(4): 639-645 (2018) - [j13]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering and Biclustering With Locally Bounded Errors. IEEE Trans. Inf. Theory 64(6): 4105-4119 (2018) - [i10]Pan Li, Gregory J. Puleo, Olgica Milenkovic:
Motif and Hypergraph Correlation Clustering. CoRR abs/1811.02089 (2018) - 2017
- [j12]Farzad Farnoud Hassanzadeh, Olgica Milenkovic, Gregory J. Puleo, Lili Su:
Computing similarity distances between rankings. Discret. Appl. Math. 232: 157-175 (2017) - [j11]Gregory J. Puleo:
Maximal k-edge-colorable subgraphs, Vizing's Theorem, and Tuza's Conjecture. Discret. Math. 340(7): 1573-1580 (2017) - [j10]Jixian Meng, Gregory J. Puleo, Xuding Zhu:
On (4, 2)-Choosable Graphs. J. Graph Theory 85(2): 412-428 (2017) - [c5]Pan Li, Hoang Dau, Gregory J. Puleo, Olgica Milenkovic:
Motif clustering and overlapping clustering for social network analysis. INFOCOM 2017: 1-9 - 2016
- [j9]Jack P. Hou, Amin Emad, Gregory J. Puleo, Jian Ma, Olgica Milenkovic:
A new correlation clustering method for cancer mutation analysis. Bioinform. 32(24): 3717-3728 (2016) - [j8]Gregory J. Puleo:
Complexity of a disjoint matching problem on bipartite graphs. Inf. Process. Lett. 116(10): 649-652 (2016) - [j7]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA Sequence Profiles. IEEE Trans. Inf. Theory 62(6): 3125-3146 (2016) - [c4]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering and Biclustering with Locally Bounded Errors. ICML 2016: 869-877 - [c3]Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly threshold graphs for social network modeling. ITW 2016: 231-235 - [i9]Jack P. Hou, Amin Emad, Gregory J. Puleo, Jian Ma, Olgica Milenkovic:
A new correlation clustering method for cancer mutation analysis. CoRR abs/1601.06476 (2016) - [i8]Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly Threshold Graphs for Social Network Modeling. CoRR abs/1603.09701 (2016) - [i7]Pan Li, Son Hoang Dau, Gregory J. Puleo, Olgica Milenkovic:
Motif Clustering and Overlapping Clustering for Social Network Analysis. CoRR abs/1612.00895 (2016) - 2015
- [j6]Gregory J. Puleo:
Extremal aspects of the Erdős-Gallai-Tuza conjecture. Discret. Math. 338(8): 1394-1397 (2015) - [j5]Gregory J. Puleo:
Tuza's Conjecture for graphs with maximum average degree less than 7. Eur. J. Comb. 49: 134-152 (2015) - [j4]James M. Carraher, Thomas Mahoney, Gregory J. Puleo, Douglas B. West:
Sum-Paintability of Generalized Theta-Graphs. Graphs Comb. 31(5): 1325-1334 (2015) - [j3]Gregory J. Puleo:
On a Conjecture of Erdős, Gallai, and Tuza. J. Graph Theory 80(1): 12-17 (2015) - [j2]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds. SIAM J. Optim. 25(3): 1857-1872 (2015) - [c2]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA sequence profiles. ISIT 2015: 814-818 - [c1]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA storage channels. ITW 2015: 1-5 - [i6]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA Sequence Profiles. CoRR abs/1502.00517 (2015) - [i5]Gregory J. Puleo:
Complexity of a Disjoint Matching Problem on Bipartite Graphs. CoRR abs/1506.06157 (2015) - [i4]Gregory J. Puleo, Olgica Milenkovic:
Community Detection via Minimax Correlation Clustering and Biclustering. CoRR abs/1506.08189 (2015) - 2014
- [i3]Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA Storage Channels. CoRR abs/1410.8837 (2014) - [i2]Gregory J. Puleo, Olgica Milenkovic:
Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds. CoRR abs/1411.0547 (2014) - 2012
- [j1]Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani:
Revolutionaries and spies: Spy-good and spy-bad graphs. Theor. Comput. Sci. 463: 35-53 (2012) - [i1]Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani:
Revolutionaries and spies: Spy-good and spy-bad graphs. CoRR abs/1202.2910 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint