The following pages link to Du Ding-Zhu (Q166203):
Displaying 50 items.
- On complexity of subset interconnection designs (Q1804586) (← links)
- Line digraph iterations and diameter vulnerability (Q1809740) (← links)
- Paired-domination of trees (Q1810885) (← links)
- Extremal permutations with respect to weak majorizations (Q1815401) (← links)
- On inefficient special cases of NP-complete problems (Q1823688) (← links)
- Global convergence of Rosen's gradient projection method (Q1825143) (← links)
- On connectivity of consecutive-\(d\) digraphs (Q1850019) (← links)
- New bounds on a hypercube coloring problem. (Q1853150) (← links)
- Generalized de Bruijn digraphs and the distribution of patterns in \(\alpha\)-expansions (Q1869206) (← links)
- Polycyclic configurations (Q1873777) (← links)
- Correspondence and (2,1)-Bézier surfaces (Q1881790) (← links)
- Minimal enclosing parallelepiped in 3D (Q1886236) (← links)
- An approximation algorithm for cutting out convex polygons (Q1886238) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- Steiner minimal trees on regular polygons with centre (Q1894775) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs (Q1897350) (← links)
- Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439) (← links)
- Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions (Q1914000) (← links)
- On the diameter vulnerability of Kautz digraphs (Q1916380) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- On extremal permutations avoiding \(\omega_N=NN-1\dots 1\) (Q1970072) (← links)
- HOPs and COPs: Room frames with partitionable transversals (Q1970567) (← links)
- Rumor correction maximization problem in social networks (Q1998850) (← links)
- Population monotonic allocation schemes for vertex cover games (Q2006775) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Online hole healing for sensor coverage (Q2010111) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- On optimal randomized group testing with one defective item and a constrained number of positive responses (Q2019424) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Introduction to combinatorial optimization (Q2160145) (← links)
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709) (← links)
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Lower bounds for weak Byzantine agreement (Q2277850) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- General rumor blocking: an efficient random algorithm with martingale approach (Q2283009) (← links)
- On the metric dimension of the folded \(n\)-cube (Q2300649) (← links)
- Group testing with geometry of classical groups over finite fields (Q2313412) (← links)
- Set function optimization (Q2314057) (← links)
- A class of asymptotically optimal group screening strategies with limited item participation (Q2334043) (← links)
- Data-dependent approximation in social computing (Q2337588) (← links)
