default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiao Mao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Xiao Mao
:
(1 - ε)-Approximation of Knapsack in Nearly Quadratic Time. STOC 2024: 295-306- [c4]Xiao Mao:
Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time. STOC 2024: 1141-1152 - 2023
- [j3]Guohua Wu, Xiao Mao, Yingguo Chen, Xinwei Wang, Wenkun Liao, Witold Pedrycz:
Coordinated Scheduling of Air and Space Observation Resources via Divide-and-Conquer Framework and Iterative Optimization. IEEE Trans. Aerosp. Electron. Syst. 59(4): 3631-3642 (2023) - [j2]Jiaxing Li, Guohua Wu, Tianjun Liao, Mingfeng Fan, Xiao Mao, Witold Pedrycz:
Task Scheduling Under a Novel Framework for Data Relay Satellite Network via Deep Reinforcement Learning. IEEE Trans. Veh. Technol. 72(5): 6654-6668 (2023) - [c3]Mingyang Deng, Ce Jin, Xiao Mao:
Approximating Knapsack and Partition via Dense Subset Sums. SODA 2023: 2961-2979 - [c2]Mingyang Deng, Xiao Mao, Ziqian Zhong:
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach. SODA 2023: 2980-2990 - [i8]Mingyang Deng, Ce Jin, Xiao Mao:
Approximating Knapsack and Partition via Dense Subset Sums. CoRR abs/2301.09333 (2023) - [i7]Xiao Mao:
Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time. CoRR abs/2306.02662 (2023) - [i6]Xiao Mao:
(1-ε)-Approximation of Knapsack in Nearly Quadratic Time. CoRR abs/2308.07004 (2023) - 2022
- [i5]Mingyang Deng, Xiao Mao, Ziqian Zhong:
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach. CoRR abs/2202.13484 (2022) - [i4]Xiao Mao, Guohua Wu, Mingfeng Fan:
DL-DRL: A double-layer deep reinforcement learning approach for large-scale task scheduling of multi-UAV. CoRR abs/2208.02447 (2022) - 2021
- [c1]Xiao Mao:
Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance. FOCS 2021: 792-803 - [i3]Xiao Mao:
Shortest non-separating st-path on chordal graphs. CoRR abs/2101.03519 (2021) - [i2]Xiao Mao:
Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance. CoRR abs/2106.02026 (2021) - 2020
- [i1]Xiao Mao:
A natural extension to the convex hull problem and a novel solution. CoRR abs/2012.01216 (2020)
2010 – 2019
- 2017
- [j1]Xiao Mao, Lifang He, Qingping Wang:
基于改进萤火虫优化算法的多阈值彩色图像分割 (Multilevel Color Image Segmentation Based on Improved Glowworm Swarm Optimization Algorithm). 计算机科学 44(Z6): 206-211 (2017)
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-06-19 21:46 CEST 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:
