default search action
Bo Li 0037
- > Home > Persons > Bo Li 0037
Publications
- 2025
- [c51]Zheng Chen, Bin Deng, Bo Li, Minming Li, Weidong Li, Guochuan Zhang:
Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities. COCOON (1) 2025: 293-306 - [e2]Bo Li, Minming Li, Xiaoming Sun:
Frontiers of Algorithmics - 18th International Joint Conference, IJTCS-FAW 2024, Hong Kong SAR, China, July 29-31, 2024, Proceedings. Lecture Notes in Computer Science 14752, Springer 2025, ISBN 978-981-97-7751-8 [contents] - 2024
- [c43]Zheng Chen, Bo Li, Minming Li, Guochuan Zhang:
Fair and Efficient Division of a Discrete Cake with Switching Utility Loss. AAMAS 2024: 2641-2649 - [c40]Bo Li, Lijun Li, Minming Li, Ruilong Zhang:
Public Event Scheduling with Busy Agents. IJCAI 2024: 2877-2885 - [c38]Yu Zhou, Tianze Wei, Minming Li, Bo Li:
A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna. IJCAI 2024: 3049-3056 - [i48]Bo Li, Lijun Li, Minming Li, Ruilong Zhang:
Public Event Scheduling with Busy Agents. CoRR abs/2404.11879 (2024) - [i44]Yu Zhou, Tianze Wei, Minming Li, Bo Li:
A Complete Landscape of EFX Allocations of Mixed Manna on Graphs. CoRR abs/2409.03594 (2024) - 2023
- [j10]Bo Li
, Minming Li, Xiaowei Wu
Well-behaved online load balancing against strategic jobs. J. Sched. 26(5): 443-455 (2023) - [c28]Tianze Wei
Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. IJCAI 2023: 2897-2905 - [i38]Tianze Wei, Bo Li, Minming Li:
Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents. CoRR abs/2308.15809 (2023) - 2022
- [i24]Zheng Chen, Bo Li, Minming Li, Guochuan Zhang
Fair Graphical Resource Allocation with Matching-Induced Utilities. CoRR abs/2212.01031 (2022) - 2021
- [j4]Xinping Xu, Bo Li
Two-facility Location Games with Minimum Distance Requirement. J. Artif. Intell. Res. 70: 719-756 (2021) - [c20]Hau Chan, Aris Filos-Ratsikas
Mechanism Design for Facility Location Problems: A Survey. IJCAI 2021: 4356-4365 - [c19]Bo Li, Minming Li, Ruilong Zhang:
Fair Scheduling for Time-dependent Resources. NeurIPS 2021: 21744-21756 - [i21]Hau Chan, Aris Filos-Ratsikas, Bo Li, Minming Li, Chenhao Wang:
Mechanism Design for Facility Location Problems: A Survey. CoRR abs/2106.03457 (2021) - [i19]Bo Li, Minming Li, Ruilong Zhang:
Fair Allocation with Interval Scheduling Constraints. CoRR abs/2107.11648 (2021) - 2019
- [c15]Bo Li, Minming Li, Xiaowei Wu:
Well-behaved Online Load Balancing Against Strategic Jobs. AAMAS 2019: 1243-1251 - [c14]Lingjie Duan, Bo Li, Minming Li, Xinping Xu:
Heterogeneous Two-facility Location Games with Minimum Distance Requirement. AAMAS 2019: 1461-1469 - [i8]Bo Li, Minming Li, Xiaowei Wu:
Well-behaved Online Load Balancing Against Strategic Jobs. CoRR abs/1909.04481 (2019)
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 2025-11-16 23:57 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: