The following pages link to Yongxi Cheng (Q281799):
Displayed 32 items.
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
- An efficient randomized group testing procedure to determine the number of defectives (Q408399) (← links)
- A generalization of Boesch's theorem (Q409456) (← links)
- Solving haplotype inference problem with non-genotyped founders via integer linear programming (Q434198) (← links)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
- An improved online evacuation strategy from a convex region on grid networks (Q724733) (← links)
- On searching a table consistent with division poset (Q868956) (← links)
- On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity (Q924146) (← links)
- A new class of antimagic Cartesian product graphs (Q998385) (← links)
- Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix (Q1003685) (← links)
- Lattice grids and prisms are antimagic (Q1022588) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders (Q1036927) (← links)
- A class of asymptotically optimal group testing strategies to identify good items (Q1741503) (← links)
- A randomized competitive group testing procedure (Q1743476) (← links)
- On optimal randomized group testing with one defective item and a constrained number of positive responses (Q2019424) (← links)
- The work function algorithm for the paging problem (Q2166767) (← links)
- An online trading problem with an increasing number of available products (Q2168746) (← links)
- Thermoelectric transport through strongly correlated double quantum dots with Kondo resonance (Q2235693) (← links)
- A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157) (← links)
- A class of asymptotically optimal group screening strategies with limited item participation (Q2334043) (← links)
- A new randomized algorithm for group testing with unknown number of defective items (Q2352359) (← links)
- Competitive strategies for an online generalized assignment problem with a service consecution constraint (Q2355803) (← links)
- An efficient FPRAS type group testing procedure to approximate the number of defectives (Q2444143) (← links)
- On the complexity of non-unique probe selection (Q2474080) (← links)
- Searching monotone multi-dimensional arrays (Q2483400) (← links)
- A Zig-Zag Approach for Competitive Group Testing (Q2940059) (← links)
- Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem (Q3013133) (← links)
- (Q3307331) (← links)
- Magnetic Field Dependent Kondo Transport through Double Quantum Dots System (Q6092842) (← links)
- Cartesian Products of Regular Graphs are Antimagic (Q6476721) (← links)