The following pages link to Jiguo Yu (Q247819):
Displaying 43 items.
- Bounded information dissemination in multi-channel wireless networks (Q266016) (← links)
- Distributed wireless link scheduling in the SINR model (Q328722) (← links)
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models (Q346485) (← links)
- A nonlinear model to generate the winner-take-all competition (Q391435) (← links)
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks (Q663430) (← links)
- Circular list colorings of some graphs (Q815980) (← links)
- Combining trust region and linesearch algorithm for equality constrained optimization (Q1428992) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- Circular coloring of planar digraphs (Q1928289) (← links)
- A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← links)
- An upper bound for the choice number of star edge coloring of graphs (Q2008856) (← links)
- Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes (Q2012798) (← links)
- Adaptive seeding for profit maximization in social networks (Q2114590) (← links)
- Interaction-aware influence maximization and iterated sandwich method (Q2173299) (← links)
- Adaptive fault-tolerant consensus for a class of leader-following systems using neural network learning strategy (Q2185676) (← links)
- Winner-take-all based on discrete-time dynamic feedback (Q2250176) (← links)
- The hardness of resilience for nested aggregation query (Q2283020) (← links)
- Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)
- Triangle edge deletion on planar glasses-free RGB-digraphs (Q2317352) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- Maximizing target-temporal coverage of mission-driven camera sensor networks (Q2410049) (← links)
- Some results on fractional \(n\)-factor-critical graphs (Q2471336) (← links)
- Edge-disjoint paths in faulty augmented cubes (Q2656959) (← links)
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost (Q2686108) (← links)
- On the fractional<i>f</i>-chromatic index of a graph (Q3066980) (← links)
- (Q3417282) (← links)
- (Q3431163) (← links)
- (Q3572621) (← links)
- (Q3592449) (← links)
- Fractional Matchings of Graphs (Q3606061) (← links)
- Notes on Fractional (1,f)-Odd Factors of Graphs (Q3612597) (← links)
- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings (Q3637099) (← links)
- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings (Q3637100) (← links)
- (Q4241179) (← links)
- (Q4779618) (← links)
- (Q4803792) (← links)
- Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost (Q5024478) (← links)
- (Q5033176) (← links)
- (Q5062710) (← links)
- (Q5206433) (← links)
- (Q5490857) (← links)
- Information exchange with collision detection on multiple channels (Q5963613) (← links)
