The following pages link to Ding-Zhu Du (Q166203):
Displayed 50 items.
- On Steiner minimal trees with \(L_ p\) distance (Q1186795) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- On the average number of \(k\)-sets (Q1193707) (← links)
- Connectivity of consecutive-\(d\) digraphs (Q1199422) (← links)
- A note of best fractions of a computable real number (Q1201155) (← links)
- Towards the spectrum of Room squares with subsquares (Q1207773) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- Minimally distant sets of lattice points (Q1260773) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- In memoriam Ronald V. Book (1937--1997) (Q1276318) (← links)
- An \(O(n\log n)\) average time algorithm for computing the shortest network under a given topology (Q1283683) (← links)
- On the construction of balanced Room squares (Q1292812) (← links)
- Endo-circulant digraphs: Connectivity and generalized cycles (Q1292822) (← links)
- Competitive group testing (Q1309810) (← links)
- The Hamiltonian property of consecutive-\(d\) digraphs (Q1310230) (← links)
- A family of perpendicular arrays achieving perfect 4-fold secrecy (Q1322248) (← links)
- Complex systems, complexity measures, grammars and model-inferring (Q1331210) (← links)
- Function-algebraic characterizations of log and polylog parallel time (Q1332666) (← links)
- Variational approach and Steiner minimal trees on four points (Q1336673) (← links)
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs (Q1336711) (← links)
- A continuous version of a result of Du and Hwang (Q1337128) (← links)
- A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
- The Steiner ratio (Q1347366) (← links)
- Approximations for a bottleneck Steiner tree problem (Q1348905) (← links)
- Full minimal Steiner trees on lattice sets (Q1356020) (← links)
- Cut and patch Steiner trees for ladders (Q1356409) (← links)
- A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem (Q1356538) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- A nonadaptive version of Ulam's problem with one lie (Q1360979) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- A special case for subset interconnection designs (Q1377654) (← links)
- On 1-rate wide-sense nonblocking for 3-stage Clos networks (Q1377657) (← links)
- Super line-connectivity of consecutive-\(d\) digraphs (Q1382814) (← links)
- Proof of the Alon-Tarsi conjecture for \(n=2^rp\) (Q1386553) (← links)
- A note on the tree decompositions of graphs (Q1387426) (← links)
- Lower bounds on the minus domination and \(k\)-subdomination numbers. (Q1401262) (← links)
- Trivial two-stage group testing for complexes using almost disjunct matrices. (Q1422408) (← links)
- Computing all parametric solutions for blending parametric surfaces (Q1432886) (← links)
- A coloring problem on the \(n\)-cube (Q1570845) (← links)
- The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables (Q1578507) (← links)
- Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle (Q1595898) (← links)
- Circular Tuscan-\(k\) arrays from permutation binomials (Q1604580) (← links)
- Rivest-Vuillemin conjecture is true for monotone Boolean functions with twelve variables (Q1613515) (← links)
- (Q1675630) (redirect page) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
- A class of asymptotically optimal group testing strategies to identify good items (Q1741503) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- On non-integer submodular set cover problem (Q1797564) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)