Mingyang Gong

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximation algorithms for scheduling with rejection in Green manufacturing Theoretical Computer Science	2026-08-25	Paper
Approximately partitioning vertices into short paths Theoretical Computer Science	2026-08-25	Paper
Randomized algorithms for fully online multiprocessor scheduling with testing Annals of Operations Research	2026-08-24	Paper
Approximation algorithms for non-sequential star packing problems Information and Computation	2026-02-02	Paper
Covering vertices by 4^+-paths: a simpler local search coupled with a more delicate amortization	2026-01-13	Paper
Approximation algorithms for the maximum path cover problem using long paths Information and Computation	2025-12-15	Paper
Approximately covering vertices by order-5 or longer paths Journal of Computer and System Sciences	2025-12-11	Paper
Semi-online multiprocessor scheduling with known largest job processing time	2025-10-29	Paper
Path cover using only short paths Theoretical Computer Science	2025-10-17	Paper
Improved approximation algorithms for multiprocessor indivisible coflow scheduling Journal of Combinatorial Optimization	2025-07-18	Paper
Approximately covering vertices by order-5 or longer paths	2025-06-17	Paper
Improved approximation algorithms for multiprocessor indivisible coflow scheduling	2025-06-17	Paper
An improved approximation algorithm for covering vertices by 4^+-paths Journal of Combinatorial Optimization	2025-04-28	Paper
Approximation algorithms for non-sequential star packing problems	2025-04-15	Paper
Approximation algorithms for the longest run subsequence problem	2024-10-21	Paper
An approximation algorithm for covering vertices by \(4^+\)-paths	2024-09-16	Paper
Approximation algorithms for covering vertices by long paths Algorithmica	2024-08-13	Paper
Approximation algorithms for covering vertices by long paths	2024-08-06	Paper
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops Annals of Operations Research	2024-05-30	Paper
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time Algorithmica	2024-04-24	Paper
Improved approximation algorithms for multiprocessor scheduling with testing Frontiers of Algorithmics	2023-08-10	Paper
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing Journal of Combinatorial Optimization	2022-08-26	Paper

Research outcomes over time

This page was built for person: Mingyang Gong