The following pages link to Yao Xu (Q1750351):
Displaying 32 items.
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- An approximation framework for bounded facility location problems (Q1790991) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- Finite-time synchronization of fractional-order complex-valued coupled systems (Q2164891) (← links)
- Adaptive finite-time synchronization control for fractional-order complex-valued dynamical networks with multiple weights (Q2204519) (← links)
- Periodically intermittent discrete observation control for synchronization of fractional-order coupled systems (Q2207457) (← links)
- Graph-theoretic approach to synchronization of fractional-order coupled systems with time-varying delays via periodically intermittent control (Q2212814) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Single-machine scheduling with job-dependent machine deterioration (Q2294893) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (Q2327083) (← links)
- Quantized feedback control scheme on coupled systems with time delay and distributed delay: a finite-time inner synchronization analysis (Q2335658) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Global asymptotic stability of fractional-order competitive neural networks with multiple time-varying-delay links (Q2660351) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- (Q4636539) (← links)
- Stabilisation of stochastic delayed systems with Lévy noise on networks via periodically intermittent control (Q4960180) (← links)
- Stability and synchronization of fractional‐order delayed multilink complex networks with nonlinear hybrid couplings (Q5004111) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- ANALYSIS OF A STOCHASTIC TWO-PREDATORS ONE-PREY SYSTEM WITH MODIFIED LESLIE-GOWER AND HOLLING-TYPE Ⅱ SCHEMES (Q5149601) (← links)
- Stabilisation of coupled delayed regime‐switching diffusion with continuous‐state‐dependent switching via intermittent control (Q5221105) (← links)
- Finite-time lag synchronization of coupled reaction–diffusion systems with time-varying delay via periodically intermittent control (Q5379434) (← links)
- Synchronization for fractional‐order multi‐linked complex network with two kinds of topological structure via periodically intermittent control (Q5380900) (← links)
- FINITE-TIME SYNCHRONIZATION FOR COUPLED SYSTEMS WITH TIME DELAY AND STOCHASTIC DISTURBANCE UNDER FEEDBACK CONTROL (Q5857995) (← links)
- A 21/16-Approximation for the Minimum 3-Path Partition Problem (Q5875609) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
