default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuchen Mao 0001
Person information
- affiliation: Zhejiang University, Hangzhou, Zhejiang, China
Other persons with the same name
- Yuchen Mao — disambiguation page
- Yuchen Mao 0002
![[0000-0002-4024-4048]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4024-4048")
— School of Economics and Management, University of Chinese Academy of Sciences, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j1]Siu-Wing Cheng, Yuchen Mao:
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm. Algorithmica 84(7): 1835-1874 (2022)
Conference and Workshop Papers
- 2024
- [c5]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. SODA 2024: 4828-4848 - [c4]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
A Nearly Quadratic-Time FPTAS for Knapsack. STOC 2024: 283-294 - [c3]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Approximating Partition in Near-Linear Time. STOC 2024: 307-318 - 2019
- [c2]Siu-Wing Cheng, Yuchen Mao:
Restricted Max-Min Allocation: Approximation and Integrality Gap. ICALP 2019: 38:1-38:13 - 2018
- [c1]Siu-Wing Cheng, Yuchen Mao:
Restricted Max-Min Fair Allocation. ICALP 2018: 37:1-37:13
Informal and Other Publications
- 2024
- [i7]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Approximating Partition in Near-Linear Time. CoRR abs/2402.11426 (2024) - [i6]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
An Improved Pseudopolynomial Time Algorithm for Subset Sum. CoRR abs/2402.14493 (2024) - 2023
- [i5]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. CoRR abs/2307.12582 (2023) - [i4]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
A Nearly Quadratic-Time FPTAS for Knapsack. CoRR abs/2308.07821 (2023) - 2019
- [i3]Siu-Wing Cheng, Yuchen Mao:
Restricted Max-Min Allocation: Approximation and Integrality Gap. CoRR abs/1905.06084 (2019) - 2018
- [i2]Siu-Wing Cheng, Yuchen Mao:
Restricted Max-Min Fair Allocation. CoRR abs/1804.10902 (2018) - [i1]Siu-Wing Cheng, Yuchen Mao:
Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation. CoRR abs/1807.04152 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 21:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
