Yongxi Cheng - Citegraph

Author Info

Name	Affiliation	Papers
YONGXI CHENG	School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi, China	30
Collaborators	Citations	PageRank
37	125	15.23
Referers	Referees	References
229	361	251

Search Limit

100361

Publications (30 rows)

Collaborators (37 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Group Scheduling and Due Date Assignment Without Restriction on a Single Machine	0	0.34	2021
On Optimal Randomized Group Testing With One Defective Item And A Constrained Number Of Positive Responses	0	0.34	2021
A class of asymptotically optimal group screening strategies with limited item participation	0	0.34	2019
A class of asymptotically optimal group testing strategies to identify good items.	0	0.34	2019
A randomized competitive group testing procedure.	0	0.34	2018
An improved online evacuation strategy from a convex region on grid networks.	0	0.34	2018
Online integrated production–distribution scheduling problems without preemption	1	0.35	2016
A new randomized algorithm for group testing with unknown number of defective items	1	0.36	2015
A Zig-Zag Approach for Competitive Group Testing	3	0.38	2014
An efficient FPRAS type group testing procedure to approximate the number of defectives	4	0.42	2014
Competitive strategies for an online generalized assignment problem with a service consecution constraint.	3	0.49	2013
Online interval scheduling on a single machine with finite lookahead	7	0.77	2013
Solving haplotype inference problem with non-genotyped founders via integer linear programming	0	0.34	2012
A generalization of Boesch's theorem	0	0.34	2012
An efficient randomized group testing procedure to determine the number of defectives.	6	0.46	2011
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem	18	1.19	2010
Semi voronoi diagrams	1	0.35	2010
On the parameterized complexity of pooling design.	0	0.34	2009
On the upper bounds of the minimum number of rows of disjunct matrices	2	0.59	2009
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix	0	0.34	2009
Searching monotone multi-dimensional arrays	2	0.36	2008
New constructions of one- and two-stage pooling designs.	31	1.17	2008
A new class of antimagic Cartesian product graphs	7	0.97	2008
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity	9	0.61	2008
On the complexity of non-unique probe selection	1	0.36	2008
Generating Combinations by Three Basic Operations.	2	0.40	2007
Efficient constructions of disjunct matrices with applications to DNA library screening.	12	0.75	2007
Lattice grids and prisms are antimagic	6	0.98	2007
On searching a table consistent with division poset	0	0.34	2007
Core role-based access control: efficient implementations by transformations	9	0.56	2006