2024
Green Edge Intelligence Scheme for Mobile Keyboard Emoji Prediction.
IEEE Trans. Mob. Comput., February, 2024
The Turán number of three disjoint paths.
Discuss. Math. Graph Theory, 2024
Counting triangles in graphs without vertex disjoint odd cycles.
Discret. Math., 2024
Faster coloring and embedding in dense hypergraphs via stability.
CoRR, 2024
A 2-Stable Family of Triple Systems.
Electron. J. Comb., 2024
Extremal Graphs for the Suspension of Edge-Critical Graphs.
Electron. J. Comb., 2024
The zero-error capacity of binary channels with 2-memories.
Adv. Math. Commun., 2024
2023
On L(p,q)-labelling of planar graphs without cycles of length four.
Appl. Math. Comput., June, 2023
Large induced subgraphs with three repeated degrees.
Discret. Math., May, 2023
On (2,r)-choosability of planar graphs without short cycles.
Appl. Math. Comput., May, 2023
Coloring Squares of Planar Graphs with Maximum Degree at Most Five.
Graphs Comb., April, 2023
Graph partitioning: an updated survey.
AKCE Int. J. Graphs Comb., January, 2023
ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee.
Proc. ACM Manag. Data, 2023
2022
Odd Induced Subgraphs in Planar Graphs with Large Girth.
Graphs Comb., 2022
On judicious bipartitions of directed graphs.
Discret. Math., 2022
Maximum bisections of graphs without cycles of length 4.
Discret. Math., 2022
2021
On bisections of graphs without complete bipartite graphs.
J. Graph Theory, 2021
Uniform tight frames as optimal signals.
Adv. Appl. Math., 2021
Design and implementation of a bluetooth data communication middleware on smart phone.
Proceedings of the 14th International Symposium on Computational Intelligence and Design, 2021
2020
Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.
SIAM J. Discret. Math., 2020
On bipartitions of directed graphs with small semidegree.
Eur. J. Comb., 2020
Choosability with union separation of triangle-free planar graphs.
Discret. Math., 2020
Max-Bisections of H-free graphs.
Discret. Math., 2020
Choosability with union separation of planar graphs without cycles of length 4.
Appl. Math. Comput., 2020
2019
HydraDoctor: real-time liquids intake monitoring by collaborative sensing.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019
2018
The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs.
SIAM J. Discret. Math., 2018
Bipartitions of oriented graphs.
J. Comb. Theory B, 2018
Partitioning dense uniform hypergraphs.
J. Comb. Optim., 2018
On partitions of K2, 3-free graphs under degree constraints.
Discret. Math., 2018
Bisections of Graphs Without Short Cycles.
Comb. Probab. Comput., 2018
Maximum cuts of graphs with forbidden cycles.
Ars Math. Contemp., 2018
Requirement Analysis of Operational Network Organization Based on PDOA.
Proceedings of the 14th International Conference on Semantics, Knowledge and Grids, 2018
Military Scenario Named Entity Recognition Method Based on Deep Neural Network.
Proceedings of the 2018 International Conference on Control, 2018
Operational Network Topology Reeonfiguration Based on Foeus of Guarantee.
Proceedings of the 2018 International Conference on Control, 2018
A Military Named Entity Relation Extraction Approach Based on Deep Learning.
Proceedings of the 2018 International Conference on Algorithms, 2018
2017
Bounds for pairs in judicious partitioning of graphs.
Random Struct. Algorithms, 2017
On a Problem of Judicious <i>k</i>-Partitions of Graphs.
J. Graph Theory, 2017
On bisections of directed graphs.
Eur. J. Comb., 2017
Discret. Appl. Math., 2017
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2.
Comb. Probab. Comput., 2017
The Application of Augmented Reality Based on Body Parts Recognition.
Proceedings of the Advances in Computer Science and Ubiquitous Computing, 2017
2016
On judicious partitions of uniform hypergraphs.
J. Comb. Theory A, 2016
Monochromatic Solutions for Multi-Term Unknowns.
Graphs Comb., 2016
2015
On total colorings of 1-planar graphs.
J. Comb. Optim., 2015
2014
A bound for judicious k-partitions of graphs.
Discret. Appl. Math., 2014
2013
Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs".
J. Graph Theory, 2013
An improved bound on acyclic chromatic index of planar graphs.
Discret. Math., 2013
Acyclic edge coloring of planar graphs with girth at least 5.
Discret. Appl. Math., 2013
2012
A Planar linear arboricity conjecture.
J. Graph Theory, 2012
Acyclic Edge Coloring of Planar Graphs Without Small Cycles.
Graphs Comb., 2012
A Bound on the bondage Number of toroidal Graphs.
Discret. Math. Algorithms Appl., 2012
Acyclic edge coloring of sparse graphs
CoRR, 2012
2011
Acyclic chromatic index of planar graphs with triangles.
Inf. Process. Lett., 2011
Improved bounds for acyclic chromatic index of planar graphs.
Discret. Appl. Math., 2011
Total coloring of planar graphs without 6-cycles.
Discret. Appl. Math., 2011
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.
Discret. Appl. Math., 2011
2010
The method of coloring in graphs and its application.
J. Syst. Sci. Complex., 2010
Acyclic edge chromatic number of outerplanar graphs.
J. Graph Theory, 2010
On the total choosability of planar graphs and of sparse graphs.
Inf. Process. Lett., 2010
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles.
Int. J. Comput. Math., 2010
2009
Acyclic edge coloring of planar graphs with large girth.
Theor. Comput. Sci., 2009
Edge-choosability of planar graphs without non-induced 5-cycles.
Inf. Process. Lett., 2009
Total colorings of planar graphs without adjacent triangles.
Discret. Math., 2009
Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discret. Math., 2009
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discret. Math., 2009
On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.
Ars Comb., 2009
The stability number and connected [k, k+1]-factor in graphs.
Appl. Math. Lett., 2009
2008
List edge and list total colorings of planar graphs without short cycles.
Inf. Process. Lett., 2008
Binding number and Hamiltonian (<i>g, f</i>)-factors in graphs II.
Int. J. Comput. Math., 2008
Total Colorings of Planar Graphs without Small Cycles.
Graphs Comb., 2008
2007
The linear arboricity of planar graphs with no short cycles.
Theor. Comput. Sci., 2007
Some results about <i>f</i>-critical graphs.
Networks, 2007
On <i>f</i> -Edge Cover-Coloring of Simple Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
Some Results on List Total Colorings of Planar Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
Binding Number and Connected ( <i>g</i> , <i>f</i> + 1)-Factors in Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
2006
List edge and list total colorings of planar graphs without 4-cycles.
Theor. Comput. Sci., 2006
