The following pages link to Du Ding-Zhu (Q166203):
Displaying 50 items.
- (Q4551377) (← links)
- (Q4551389) (← links)
- Optimization of wavelength assignment for QoS multicast in WDM networks (Q4552909) (← links)
- Converter placement supporting broadcast in WDM optical networks (Q4571337) (← links)
- Fault tolerance properties of pyramid networks (Q4571391) (← links)
- (Q4694729) (← links)
- (Q4736227) (← links)
- Minimizing a Combinatorial Function (Q4739915) (← links)
- Symmetric Skew Balanced Starters and Complete Balanced Howell Rotations (Q4740581) (← links)
- Optimal Consecutive-<i>k</i>-out-of-<i>n</i>: <i>G</i> Cycle for <i>n</i> \leq 2<i>k</i>+1 (Q4785686) (← links)
- (Q4786436) (← links)
- (Q4833808) (← links)
- (Q4840101) (← links)
- (Q4857782) (← links)
- (Q4859013) (← links)
- (Q4870158) (← links)
- (Q4883383) (← links)
- (Q4894397) (← links)
- (Q4942157) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- (Q5097949) (← links)
- Optimal Coverage in Wireless Sensor Networks (Q5119165) (← links)
- Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Black-Box and Data-Driven Computation (Q5153503) (← links)
- New approximations for Maximum Lifetime Coverage (Q5169461) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- (Q5324208) (← links)
- Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs (Q5375311) (← links)
- (Q5395177) (← links)
- Theory of Computational Complexity (Q5400669) (← links)
- (Q5457049) (← links)
- (Q5692514) (← links)
- Optimal Rectangular Partitions (Q5692518) (← links)
- Nonsubmodular Optimization (Q5864850) (← links)
- Friending (Q5864856) (← links)
- Multi-Document Extractive Summarization as a Non-linear Combinatorial Optimization Problem (Q5864859) (← links)
- On a minimum linear classification problem (Q5906983) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5927652) (← links)
- (Some of) the many uses of Eulerian graphs in graph theory (plus some applications) (Q5931407) (← links)
- \(V(m,t)\) and its variants (Q5935434) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- Steiner trees in general nonuniform orientations (Q5937569) (← links)
- Multirate multicast switching networks (Q5941437) (← links)
- Mathematical theory of optimization (Q5941763) (← links)
- Nontrivial critical networks. Singularities of Lagrangians and a criterion for criticality (Q5951083) (← links)
- Monotone routing in multirate rearrangeable Clos networks (Q5953221) (← links)
- Grade of service Steiner minimum trees in the Euclidean plane (Q5953596) (← links)
- New constructions of non-adaptive and error-tolerance pooling designs (Q5957704) (← links)
- Constructions for mutually orthogonal frequency hyperrectangles with a prescribed type (Q5957747) (← links)
