Gregory J. Puleo

According to our database1, Gregory J. Puleo authored at least 32 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Motif and Hypergraph Correlation Clustering.
IEEE Trans. Inf. Theory, 2020

t-Cores for (Δ+t) -edge-coloring.
J. Graph Theory, 2020

Some Results on Multithreshold Graphs.
Graphs Comb., 2020

Packing and Covering Directed Triangles.
Graphs Comb., 2020

On the triangle clique cover and Kt clique cover problems.
Discret. Math., 2020

A lower bound on the saturation number, and graphs for which it is sharp.
CoRR, 2020

Strong coloring 2-regular graphs: Cycle restrictions and partial colorings.
CoRR, 2020

List-edge-colouring planar graphs with precoloured edges.
Eur. J. Comb., 2019

Online sum-paintability: Slow-coloring of trees.
Discret. Appl. Math., 2019

Upper bounds for inverse domination in graphs.
CoRR, 2019

Correlation Clustering and Biclustering With Locally Bounded Errors.
IEEE Trans. Inf. Theory, 2018

Graphs with α<sub>1</sub> and τ<sub>1</sub> Both Large.
Graphs Comb., 2018

The list chromatic index of simple graphs whose odd cycles intersect in at most one edge.
Discret. Math., 2018

Online sum-paintability: The slow-coloring game.
Discret. Math., 2018

Paired threshold graphs.
Discret. Appl. Math., 2018

Extension from Precoloured Sets of Edges.
Electron. J. Comb., 2018

On (4, 2)-Choosable Graphs.
J. Graph Theory, 2017

Maximal k-edge-colorable subgraphs, Vizing's Theorem, and Tuza's Conjecture.
Discret. Math., 2017

Computing similarity distances between rankings.
Discret. Appl. Math., 2017

Motif clustering and overlapping clustering for social network analysis.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Codes for DNA Sequence Profiles.
IEEE Trans. Inf. Theory, 2016

Complexity of a disjoint matching problem on bipartite graphs.
Inf. Process. Lett., 2016

A new correlation clustering method for cancer mutation analysis.
Bioinform., 2016

Doubly threshold graphs for social network modeling.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds.
SIAM J. Optim., 2015

On a Conjecture of Erdős, Gallai, and Tuza.
J. Graph Theory, 2015

Sum-Paintability of Generalized Theta-Graphs.
Graphs Comb., 2015

Tuza's Conjecture for graphs with maximum average degree less than 7.
Eur. J. Comb., 2015

Extremal aspects of the Erdős-Gallai-Tuza conjecture.
Discret. Math., 2015

Community Detection via Minimax Correlation Clustering and Biclustering.
CoRR, 2015

Codes for DNA storage channels.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Revolutionaries and spies: Spy-good and spy-bad graphs.
Theor. Comput. Sci., 2012