Gregory J. Puleo

J. Graph Theory, 2022

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

[BibT_eX]

[DOI]

Alex Cameron

Discret. Math., 2022

2020

Motif and Hypergraph Correlation Clustering.

[BibT_eX]

[DOI]

Pan Li

IEEE Trans. Inf. Theory, 2020

t-Cores for (Δ+t) -edge-coloring.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Some Results on Multithreshold Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Packing and Covering Directed Triangles.

[BibT_eX]

[DOI]

Craig Tennenhouse

Graphs Comb., 2020

On the triangle clique cover and Kt clique cover problems.

[BibT_eX]

[DOI]

Hoang Dau

Discret. Math., 2020

2019

List-edge-colouring planar graphs with precoloured edges.

[BibT_eX]

[DOI]

Joshua Harrelson

Eur. J. Comb., 2019

Online sum-paintability: Slow-coloring of trees.

[BibT_eX]

[DOI]

Douglas B. West

Discret. Appl. Math., 2019

Upper bounds for inverse domination in graphs.

[BibT_eX]

[DOI]

Elliot Krop

CoRR, 2019

2018

Correlation Clustering and Biclustering With Locally Bounded Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

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

[BibT_eX]

[DOI]

Graphs Comb., 2018

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

[BibT_eX]

[DOI]

Discret. Math., 2018

Online sum-paintability: The slow-coloring game.

[BibT_eX]

[DOI]

Thomas Mahoney

Douglas B. West

Discret. Math., 2018

Paired threshold graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Extension from Precoloured Sets of Edges.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Electron. J. Comb., 2018

2017

On (4, 2)-Choosable Graphs.

[BibT_eX]

[DOI]

Jixian Meng

Xuding Zhu

J. Graph Theory, 2017

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

[BibT_eX]

[DOI]

Farzad Farnoud Hassanzadeh

Discret. Math., 2017

Computing similarity distances between rankings.

[BibT_eX]

[DOI]

Lili Su

Discret. Appl. Math., 2017

Motif clustering and overlapping clustering for social network analysis.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016

Codes for DNA Sequence Profiles.

[BibT_eX]

[DOI]

Han Mao Kiah

IEEE Trans. Inf. Theory, 2016

Complexity of a disjoint matching problem on bipartite graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

A new correlation clustering method for cancer mutation analysis.

[BibT_eX]

[DOI]

Bioinform., 2016

Doubly threshold graphs for social network modeling.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015

Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

On a Conjecture of Erdős, Gallai, and Tuza.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Sum-Paintability of Generalized Theta-Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Tuza's Conjecture for graphs with maximum average degree less than 7.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Extremal aspects of the Erdős-Gallai-Tuza conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2015

Community Detection via Minimax Correlation Clustering and Biclustering.

[BibT_eX]

[DOI]

CoRR, 2015

Codes for DNA storage channels.

[BibT_eX]

[DOI]

Han Mao Kiah