The following pages link to Xiaoyan Zhang (Q387815):
Displayed 50 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- Image encryption scheme based on balanced two-dimensional cellular automata (Q473833) (← links)
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Contractible cliques in \(k\)-connected graphs (Q855302) (← links)
- The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
- Extremal solutions for singular fractional \(p\)-Laplacian differential equations with nonlinear boundary conditions (Q1627979) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- Weak solutions for a \(p\)-Laplacian impulsive differential equation (Q2016601) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Online BP functions maximization (Q2039657) (← links)
- Note on the vertex-rainbow index of a graph (Q2048994) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Two-stage submodular maximization problem beyond non-negative and monotone (Q2110706) (← links)
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619) (← links)
- Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
- Online algorithms for BP functions maximization (Q2222096) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- Solutions to all-colors problem on graph cellular automata (Q2325123) (← links)
- A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) (← links)
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
- Extremality of VDB topological indices over f-benzenoids with given order (Q2662598) (← links)
- (Q2816508) (← links)
- Notes on factor-criticality, extendibility and independence number (Q3070279) (← links)
- (Q3114982) (← links)
- Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (Q3439135) (← links)
- Contractible subgraphs ink-connected graphs (Q3445507) (← links)
- The Minimum All-Ones Problem for Trees (Q4651469) (← links)
- (Q4830189) (← links)
- (Q5016980) (← links)
- Some degree conditions for 𝒫<sub>≥<i>k</i></sub>-factor covered graphs (Q5034714) (← links)
- Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths (Q5088514) (← links)
- Sufficient conditions for graphs with {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factors (Q5104638) (← links)
- Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs (Q5300495) (← links)
- (Q5318998) (← links)
- (Q5320543) (← links)
- Extremal and Degree Conditions for Path Extendability in Digraphs (Q5357959) (← links)
- ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS (Q5370790) (← links)
- (Q5409294) (← links)
- (Q5747401) (← links)
- Two-stage submodular maximization under curvature (Q5918724) (← links)
- Improved algorithms for non-submodular function maximization problem (Q5918732) (← links)
- Two-stage submodular maximization under curvature (Q5925698) (← links)
- Improved algorithms for non-submodular function maximization problem (Q5970837) (← links)
- Remarks on component factors in <i>K</i><sub>1,<i>r</i></sub>-free graphs (Q6045046) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)
- (Q6076150) (← links)