Yongxi Cheng

From MaRDI portal
Person:281799

Available identifiers

zbMath Open cheng.yongxiMaRDI QIDQ281799

List of research outcomes





PublicationDate of PublicationType
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints2024-06-17Paper
A single machine group scheduling problem with due date assignment and position-dependent costs2024-05-23Paper
Magnetic Field Dependent Kondo Transport through Double Quantum Dots System2023-11-23Paper
An online trading problem with an increasing number of available products2022-08-26Paper
The work function algorithm for the paging problem2022-08-25Paper
Thermoelectric transport through strongly correlated double quantum dots with Kondo resonance2021-10-21Paper
On optimal randomized group testing with one defective item and a constrained number of positive responses2021-04-21Paper
https://portal.mardi4nfdi.de/entity/Q33073312020-08-12Paper
A new upper bound on the work function algorithm for the \(k\)-server problem2020-02-03Paper
A class of asymptotically optimal group screening strategies with limited item participation2019-11-06Paper
A class of asymptotically optimal group testing strategies to identify good items2019-05-03Paper
An improved online evacuation strategy from a convex region on grid networks2018-07-26Paper
A randomized competitive group testing procedure2018-04-13Paper
Online interval scheduling on a single machine with finite lookahead2016-11-11Paper
Online integrated production-distribution scheduling problems without preemption2016-05-11Paper
A new strongly competitive group testing algorithm with small sequentiality2015-08-21Paper
Competitive strategies for an online generalized assignment problem with a service consecution constraint2015-07-28Paper
A new randomized algorithm for group testing with unknown number of defective items2015-07-01Paper
A Zig-Zag Approach for Competitive Group Testing2015-01-26Paper
An efficient FPRAS type group testing procedure to approximate the number of defectives2014-04-08Paper
Solving haplotype inference problem with non-genotyped founders via integer linear programming2012-07-10Paper
A generalization of Boesch's theorem2012-04-13Paper
An efficient randomized group testing procedure to determine the number of defectives2012-04-05Paper
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem2011-07-18Paper
Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders2009-11-13Paper
Lattice grids and prisms are antimagic2009-06-22Paper
On the upper bounds of the minimum number of rows of disjunct matrices2009-06-17Paper
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix2009-03-04Paper
A new class of antimagic Cartesian product graphs2009-01-28Paper
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity2008-05-28Paper
Searching monotone multi-dimensional arrays2008-04-28Paper
On the complexity of non-unique probe selection2008-03-05Paper
On searching a table consistent with division poset2007-02-26Paper
Cartesian Products of Regular Graphs are Antimagic2006-02-14Paper
An Improved Adaptive Algorithm for Competitive Group TestingN/APaper

Research outcomes over time

This page was built for person: Yongxi Cheng