Hui-Juan Wang

From MaRDI portal
Person:405154

Available identifiers

zbMath Open wang.huijuanMaRDI QIDQ405154

List of research outcomes

PublicationDate of PublicationType
Maximum modular graphs2023-07-26Paper
Minimum total coloring of planar graphs with maximum degree 82023-04-14Paper
Topological–temporal properties of evolving networks2023-03-10Paper
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice2023-01-05Paper
A Bernstein type theorem for entire graphic 2-dimensional \(\Lambda \)-submanifolds in \(\mathbf{R}^4 \)2022-07-27Paper
Impact of structural balance on self-avoiding pruning walk2022-07-26Paper
A Posteriori Error Estimates of Edge Residual-Type of Weak Galerkin Mixed FEM Solving Second-Order Elliptic Problems on Polytopal Mesh2022-06-24Paper
A rigidity result of spacelike \(\xi \)-submanifolds in pseudo-Euclidean spaces2022-03-09Paper
https://portal.mardi4nfdi.de/entity/Q49860522021-04-26Paper
Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic2021-04-16Paper
https://portal.mardi4nfdi.de/entity/Q51281532020-10-27Paper
Analysis of the \(\Xi_b(6227)\) as the \(\frac{1}{2}^{\pm}\) pentaquark molecular states with QCD sum rules2020-10-23Paper
A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles2020-08-25Paper
The correlation of metrics in complex networks with applications in functional brain networks2020-08-11Paper
Epidemic Spreading on Interconnected Networks2020-07-08Paper
Adaptive Networks2020-07-08Paper
Submanifolds with parallel Gaussian mean curvature vector in Euclidean spaces2020-02-18Paper
https://portal.mardi4nfdi.de/entity/Q52100602020-01-22Paper
Multicriteria decision making based on Archimedean Bonferroni mean operators of hesitant Fermatean 2-tuple linguistic terms2020-01-06Paper
Profit maximization problem with coupons in social networks2019-12-27Paper
https://portal.mardi4nfdi.de/entity/Q52064402019-12-18Paper
Hesitant picture 2-tuple linguistic aggregation operators based on Archimedean t-norm and t-conorm and their use in decision-making2019-11-13Paper
https://portal.mardi4nfdi.de/entity/Q51967772019-09-20Paper
Maximizing profit of multiple adoptions in social networks with a martingale approach2019-06-25Paper
Optimal channel assignment with list-edge coloring2019-06-25Paper
An efficient case for computing minimum linear arboricity with small maximum degree2019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46304052019-03-26Paper
Optimal channel assignment and \(L(p,1)\)-labeling2018-12-07Paper
A global pinching theorem for complete translating solitons of mean curvature flow2018-10-19Paper
Minimum choosability of planar graphs2018-07-26Paper
Equitable coloring of three classes of 1-planar graphs2018-05-29Paper
A general algorithm for evaluating nearly strong-singular (and beyond) integrals in three-dimensional boundary element analysis2018-03-14Paper
On general threshold and general cascade models of social influence2018-02-21Paper
https://portal.mardi4nfdi.de/entity/Q31324232018-01-29Paper
SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS2017-10-20Paper
Decentralized Protection Strategies Against SIS Epidemics in Networks2017-09-21Paper
Gap theorems for complete \(\lambda\)-hypersurfaces2017-05-23Paper
Total coloring of planar graphs without adjacent short cycles2017-03-03Paper
List edge and list total coloring of planar graphs with maximum degree 82016-10-20Paper
A note on the minimum total coloring of planar graphs2016-10-13Paper
A note on the minimum number of choosability of planar graphs2016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q31935152015-10-28Paper
Total coloring of planar graphs without chordal short cycles2015-09-24Paper
Total coloring of planar graphs without some chordal 6-cycles2015-04-21Paper
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic2014-12-02Paper
Minimum total coloring of planar graph2014-11-27Paper
An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times2014-11-24Paper
Minimum number of disjoint linear forests covering a planar graph2014-09-05Paper
Total colorings of \(F_5\)-free planar graphs with maximum degree 82014-09-04Paper
Total colorings of planar graphs without chordal 6-cycles2014-05-06Paper
On the linear arboricity of graphs embeddable in surfaces2014-05-05Paper
A note on list edge and list total coloring of planar graphs without adjacent short cycles2014-03-18Paper
GLS: New class of generalized Legendre sequences with optimal arithmetic cross-correlation2014-02-24Paper
Total coloring of planar graphs with maximum degree 82014-01-24Paper
Total coloring of embedded graphs with maximum degree at least seven2014-01-13Paper
https://portal.mardi4nfdi.de/entity/Q28608042013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q28608182013-11-11Paper
Non-consensus opinion models on complex networks2013-06-26Paper
Analysis of Scalar Doubly Heavy Tetraquark States with QCD Sum Rules2013-06-07Paper
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords2013-04-17Paper
Competition of Spatial and Temporal Instabilities under Time Delay near Codimension-Two Turing—Hopf Bifurcations2012-09-26Paper
https://portal.mardi4nfdi.de/entity/Q28954182012-07-02Paper
A note on the total coloring of planar graphs without adjacent 4-cycles2012-06-18Paper
https://portal.mardi4nfdi.de/entity/Q28856072012-06-01Paper
Bounds for the spectral radius of a graph when nodes are removed2012-05-14Paper
https://portal.mardi4nfdi.de/entity/Q31107752012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q30731232011-02-05Paper
Graphs with given diameter maximizing the algebraic connectivity2010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30522372010-11-05Paper
Sampling networks by the union of \(m\) shortest path trees2010-05-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hui-Juan Wang