default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHan Xiao 0003
Person information
- unicode name: 肖汉
- affiliation: Ocean University of China, School of Mathematical Sciences, Qingdao, China
- affiliation (PhD 2016): University of Hong Kong, Department of Mathematics, Hong Kong
Other persons with the same name
- Han Xiao — disambiguation page
- Han Xiao 0001 — Huazhong University of Science and Technology, Wuhan, Hubei, China
- Han Xiao 0002 — TU München, Germany
- Han Xiao 0004 — Shenzhen University, China
- Han Xiao 0005 — Tsinghua University, Beijing, China
- Han Xiao 0006 — Peking University, Beijing, China
- Han Xiao 0007 — University of Chicago, IL, USA
- Han Xiao 0008
![[0000-0002-5571-2043]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5571-2043")
— Wuhan University of Science and Technology, Key Laboratory of Metallurgical Equipment and Control Technology / Mechanical Transmission and Manufacturing Engineering, China - Han Xiao 0009 — Aalto University, Espoo, Finland (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Tianhang Lu, Han Xiao, Qizhi Fang:
Approximate core allocations for edge cover games. Theor. Comput. Sci. 991: 114433 (2024)- [i8]Pengfei Liu, Han Xiao, Qizhi Fang:
On the Approximate Core and Nucleon of Flow Games. CoRR abs/2401.13535 (2024) - 2023
- [j10]Suning Gong, Qingqin Nong, Han Xiao, Ding-Zhu Du:
Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning. Asia Pac. J. Oper. Res. 40(1): 2340006:1-2340006:16 (2023) - [j9]Han Xiao, Qizhi Fang:
Arboricity games: the core and the nucleolus. Math. Program. 198(1): 1-25 (2023) - [c2]Tianhang Lu, Han Xiao, Qizhi Fang:
Approximate Core Allocations for Edge Cover Games. IJTCS-FAW 2023: 105-115 - 2022
- [j8]Han Xiao, Qizhi Fang:
Population monotonicity in matching games. J. Comb. Optim. 43(4): 699-709 (2022) - [j7]Libing Wang, Han Xiao, Donglei Du, Dachuan Xu:
On the population monotonicity of independent set games. Oper. Res. Lett. 50(5): 470-474 (2022) - [i7]Han Xiao, Libing Wang, Donglei Du, Dachuan Xu:
On the Population Monotonicity of Independent Set Games. CoRR abs/2203.17041 (2022) - 2021
- [j6]Bin Liu, Han Xiao, Qizhi Fang:
A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games. Asia Pac. J. Oper. Res. 38(5): 2140006:1-2140006:9 (2021) - [j5]Han Xiao, Yuanxi Wang, Qizhi Fang:
On the convexity of independent set games. Discret. Appl. Math. 291: 271-276 (2021) - [i6]Han Xiao, Qizhi Fang:
Population Monotonicity in Matching Games. CoRR abs/2105.00621 (2021) - [i5]Han Xiao, Tianhang Lu, Qizhi Fang:
Approximate Core Allocations for Multiple Partners Matching Games. CoRR abs/2107.01442 (2021) - 2020
- [j4]Han Xiao:
On ideal semicomplete digraphs. Inf. Process. Lett. 157: 105903 (2020) - [j3]Han Xiao, Qizhi Fang, Ding-Zhu Du:
Population monotonic allocation schemes for vertex cover games. Theor. Comput. Sci. 842: 41-49 (2020) - [i4]Han Xiao, Qizhi Fang, Ding-Zhu Du:
Population Monotonic Allocation Schemes for Vertex Cover Games. CoRR abs/2002.02824 (2020) - [i3]Han Xiao, Qizhi Fang:
Arboricity Games: the Core and the Nucleolus. CoRR abs/2010.08936 (2020)
2010 – 2019
- 2019
- [i2]Qizhi Fang, Yuanxi Wang, Han Xiao:
On the Convexity of Independent Set Games. CoRR abs/1911.03169 (2019) - 2018
- [j2]Xiaoqi Sun, Han Xiao:
Numerical Modeling and Investigation on Aerodynamic Noise Characteristics of Pantographs in High-Speed Trains. Complex. 2018: 6932596:1-6932596:12 (2018) - 2016
- [j1]Han Xiao:
Packing feedback arc sets in reducible flow graphs. J. Comb. Optim. 32(3): 951-959 (2016) - 2015
- [i1]Han Xiao:
On Kernel Mengerian Orientations of Line Multigraphs. CoRR abs/1507.06053 (2015) - 2010
- [c1]Qizhi Fang, Han Xiao, Shanfeng Zhu:
Top-d Rank Aggregation in Web Meta-search Engine - (Extended Abstract). FAW 2010: 35-44
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-07 21:37 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:
