Yuchen Mao

Orcid: 0000-0002-1075-344X

Affiliations:
  • Zhejiang University, Hangzhou, Zhejiang, China


According to our database1, Yuchen Mao authored at least 12 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Note on Deterministic FPTAS for Partition.
CoRR, January, 2025

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Weakly Approximating Knapsack in Subquadratic Time.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Approximating Partition in Near-Linear Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

A Nearly Quadratic-Time FPTAS for Knapsack.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An Improved Pseudopolynomial Time Algorithm for Subset Sum.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

An Equally-Split Bin Packing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2024

2022
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm.
Algorithmica, 2022

2019
Restricted Max-Min Allocation: Approximation and Integrality Gap.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation.
CoRR, 2018

Restricted Max-Min Fair Allocation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018


  Loading...