Chi To Ng 0001

dblp:13/3613 · also C. T. Daniel Ng, C. T. Ng 0001, Chi-To Ng 0001 · DBLP profile ↗
← Back
28ranked-venue papers
6as first author
4since 2021 · last 2026
0000-0003-0020-8234ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 27 · 6 first-author · 4 since 2021Databases, data management, data science and information retrieval · 5 · 2 first-authorArtificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2026 Even cycles and perfect matchings in planar graphs
Xiumei Wang 0001, Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng
Discret. Appl. Math.4
2025 Sufficient conditions for k-factors and spanning trees of graphs
Guoyan Ao, Ruifang Liu, Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng
Discret. Appl. Math.4
2025 Claw-free minimal matching covered graphs
Yipei Zhang, Xiumei Wang 0001, Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng
Discret. Appl. Math.4
2024 Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
Fei Huang 0007, Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng
Discret. Appl. Math.4
2020 Single Bounded Parallel-Batch Machine Scheduling with an Unavailability Constraint and Job Delivery
Chi To Ng 0001, T. C. E. Cheng
AAIM2
2017 A Fast Algorithm for Detecting Hidden Objects by Smart Mobile Robots
abstract
The problem of searching for hidden or lost objects (called targets) by autonomous smart robots in an unknown environment arises in many applications, e.g., searching for and rescuing lost people during incidents in high-rise buildings, searching for fire sources and hazardous materials, searching for safe paths through the rubble during an emergency evacuation etc. Until the target is found, it may cause loss or damage whose extent depends on the location of the target and the search duration. The problem is to efficiently search for and detect the target as soon as possible with the help of a smart mobile robot. The autonomous mobile robot has no operator on board, as it is guided and controlled by on-board sensors and computer programs. In this paper we construct a mathematical model for the search process in an uncertain environment and provide a new fast algorithm for scheduling the activities of the autonomous robot used during an emergency evacuation.
T. C. E. Cheng, Chi To Ng 0001, Eugene Levner, Boris Kriheli
SMARTCOMP2
2015 Single-machine batch scheduling with job processing time compatibility
T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan
Theor. Comput. Sci.3
2012 An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Ji Tian, T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan
Discret. Appl. Math.3
2011 A closed-form solution for the optimal release times for the F2 deteriorating jobs ∑wjCj problem
Edouard Wagneur, T. C. E. Cheng, Chi To Ng 0001
Discret. Appl. Math.3
2011 Best semi-online algorithms for unbounded parallel batch scheduling
Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng
Discret. Appl. Math.2
2011 Online scheduling on unbounded parallel-batch machines with incompatible job families
Ji Tian, T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan
Theor. Comput. Sci.3
2010 Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
Ruyan Fu, T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan
Inf. Process. Lett.3
2010 Preemptive scheduling with simple linear deterioration on a single machine
Chi To Ng 0001, T. C. E. Cheng, Jinjiang Yuan
Theor. Comput. Sci.1
2010 A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Qingqin Nong, T. C. E. Cheng, Chi To Ng 0001
Theor. Comput. Sci.3
2009 Scheduling jobs with release dates on parallel batch processing machines
L. L. Liu, Chi To Ng 0001, T. C. E. Cheng
Discret. Appl. Math.2
2009 The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
Chi To Ng 0001, T. C. E. Cheng, Vladimir Kotov, Mikhail Y. Kovalyov
Discret. Appl. Math.1
2009 Online scheduling on unbounded parallel-batch machines to minimize the makespan
Ji Tian, T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan
Inf. Process. Lett.3
2009 Two semi-online scheduling problems on two uniform machines
Chi To Ng 0001, Zhiyi Tan 0001, Yong He 0014, T. C. E. Cheng
Theor. Comput. Sci.1
2007 Paired domination on interval and circular-arc graphs
T. C. E. Cheng, Liying Kang, Chi To Ng 0001
Discret. Appl. Math.3
2007 Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
L. L. Liu, Chi To Ng 0001, T. C. E. Cheng
Theor. Comput. Sci.2
2006 A note on acyclic domination number in graphs of diameter two
T. C. E. Cheng, Yaojun Chen, Chi To Ng 0001
Discret. Appl. Math.3
2006 A new algorithm for online uniform-machine scheduling to minimize the makespan
T. C. E. Cheng, Chi To Ng 0001, Vladimir Kotov
Inf. Process. Lett.2
2006 Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan
Theor. Comput. Sci.2
2005 Scheduling to Minimize Makespan with Time-Dependent Processing Times
Liying Kang, T. C. E. Cheng, Chi To Ng 0001
ISAAC3
2005 Minimizing Completion Time Variance with Compressible Processing Times
Chi To Ng 0001, Xiaoqiang Cai, T. C. E. Cheng, Sze Sing Lam
J. Glob. Optim.1
2004 The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
Jinjiang Yuan, Zhaohui Liu 0001, Chi To Ng 0001, T. C. E. Cheng
Theor. Comput. Sci.3
2002 Three scheduling problems with deteriorating jobs to minimize the total completion time
Chi To Ng 0001, T. C. E. Cheng, Aleksander Bachman, Adam Janiak
Inf. Process. Lett.1
2002 Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem
Chi To Ng 0001, T. C. E. Cheng, Jinjiang Yuan
Inf. Process. Lett.1