default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQizhi Fang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Qi Zhao, Wenjing Liu
, Qingqin Nong, Qizhi Fang:
Constrained heterogeneous two-facility location games with sum-variant. J. Comb. Optim. 47(4): 65 (2024)- [j41]Tianhang Lu, Han Xiao, Qizhi Fang:
Approximate core allocations for edge cover games. Theor. Comput. Sci. 991: 114433 (2024) - [j40]Shufang Gong, Bin Liu, Qizhi Fang:
An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint. Theor. Comput. Sci. 1016: 114798 (2024) - [c31]Shufang Gong, Bin Liu, Qizhi Fang, Weili Wu:
Monotone Submodular Meta-learning under the Matroid Constraint. AAIM (1) 2024: 210-221 - [c30]Yuanyuan Wang, Xin Chen, Qizhi Fang, Qingqin Nong, Wenjing Liu:
Finding Fair and Efficient Allocations Under Budget Constraints. IJTCS-FAW 2024: 144-158 - [c29]Chenguang Zhao, Qizhi Fang, Yanpeng Sun:
Research and Design of Blended Learning of EDA Technology Course Based on CDIO. ICETT 2024: 16-21 - [c28]Jiazhu Fang, Qizhi Fang, Wenjing Liu, Qingqin Nong:
Mechanism Design with Predictions for Facility Location Games with Candidate Locations. TAMC 2024: 38-49 - [i10]Pengfei Liu, Han Xiao, Qizhi Fang:
On the Approximate Core and Nucleon of Flow Games. CoRR abs/2401.13535 (2024) - 2023
- [j39]Qi Zhao, Wenjing Liu, Qingqin Nong, Qizhi Fang:
Constrained heterogeneous facility location games with max-variant cost. J. Comb. Optim. 45(3): 90 (2023) - [j38]Shufang Gong, Bin Liu, Mengxue Geng, Qizhi Fang:
Algorithms for maximizing monotone submodular function minus modular function under noise. J. Comb. Optim. 45(3): 96 (2023) - [j37]Suning Gong, Qingqin Nong, Shuyu Bao, Qizhi Fang, Ding-Zhu Du:
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice. J. Glob. Optim. 85(1): 15-38 (2023) - [j36]Han Xiao, Qizhi Fang:
Arboricity games: the core and the nucleolus. Math. Program. 198(1): 1-25 (2023) - [j35]Feiteng Zhang, Bin Liu, Zhenming Liu, Qizhi Fang:
Order based algorithms for the core maintenance problem on edge-weighted graphs. Theor. Comput. Sci. 941: 140-155 (2023) - [c27]Tianhang Lu, Han Xiao, Qizhi Fang:
Approximate Core Allocations for Edge Cover Games. IJTCS-FAW 2023: 105-115 - 2022
- [j34]Han Xiao, Qizhi Fang:
Population monotonicity in matching games. J. Comb. Optim. 43(4): 699-709 (2022) - [j33]Xin Chen, Qizhi Fang, Wenjing Liu, Yuan Ding, Qingqin Nong:
Strategyproof mechanisms for 2-facility location games with minimax envy. J. Comb. Optim. 43(5): 1628-1644 (2022) - [j32]Xin Chen, Wenjing Liu, Qingqin Nong, Qizhi Fang:
Bounding quality of pure Nash equilibria in dual-role facility location games. J. Comb. Optim. 44(5): 3520-3534 (2022) - [c26]Qi Zhao, Wenjing Liu, Qizhi Fang, Qingqin Nong:
Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost. FAW 2022: 25-43 - [c25]Shufang Gong, Bin Liu, Qizhi Fang:
Streaming Submodular Maximization with the Chance Constraint. FAW 2022: 129-140 - [i9]Qi Zhao, Wenjing Liu, Qizhi Fang, Qingqin Nong:
Constrained Heterogeneous Two-facility Location Games with Max-variant Cost. CoRR abs/2207.03026 (2022) - 2021
- [j31]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) - [j30]Han Xiao, Yuanxi Wang, Qizhi Fang:
On the convexity of independent set games. Discret. Appl. Math. 291: 271-276 (2021) - [j29]Xin Chen, Qingqin Nong, Qizhi Fang:
An improved mechanism for selfish bin packing. J. Comb. Optim. 42(3): 636-656 (2021) - [j28]Suning Gong, Qingqin Nong, Tao Sun, Qizhi Fang, Ding-Zhu Du, Xiaoyu Shao:
Maximize a monotone function with a generic submodularity ratio. Theor. Comput. Sci. 853: 16-24 (2021) - [j27]Wenjing Liu, Yuan Ding, Xin Chen, Qizhi Fang, Qingqin Nong:
Multiple facility location games with envy ratio. Theor. Comput. Sci. 864: 1-9 (2021) - [i8]Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan, Weili Wu:
A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks. CoRR abs/2101.06239 (2021) - [i7]Han Xiao, Qizhi Fang:
Population Monotonicity in Matching Games. CoRR abs/2105.00621 (2021) - [i6]Han Xiao, Tianhang Lu, Qizhi Fang:
Approximate Core Allocations for Multiple Partners Matching Games. CoRR abs/2107.01442 (2021) - 2020
- [j26]Yuan Ding, Wenjing Liu, Xin Chen, Qizhi Fang, Qingqin Nong:
Facility location game with envy ratio. Comput. Ind. Eng. 148: 106710 (2020) - [j25]Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu:
Profit Maximization problem with Coupons in social networks. Theor. Comput. Sci. 803: 22-35 (2020) - [j24]Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan, Weili Wu:
A random algorithm for profit maximization in online social networks. Theor. Comput. Sci. 803: 36-47 (2020) - [j23]Qizhi Fang, Xin Chen, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Ding-Zhu Du:
General Rumor Blocking: An efficient random algorithm with martingale approach. Theor. Comput. Sci. 803: 82-93 (2020) - [j22]Han Xiao, Qizhi Fang, Ding-Zhu Du:
Population monotonic allocation schemes for vertex cover games. Theor. Comput. Sci. 842: 41-49 (2020) - [j21]Qizhi Fang, Yuxuan Liu, Lili Zhang:
Design and Implementation of a Lossless Compression System for Hyperspectral Images. Traitement du Signal 37(5): 745-752 (2020) - [c24]Wenjing Liu, Yuan Ding, Xin Chen, Qizhi Fang, Qingqin Nong:
Multiple Facility Location Games with Envy Ratio. AAIM 2020: 248-259 - [c23]Xin Chen, Qizhi Fang, Wenjing Liu, Yuan Ding:
Strategyproof Mechanisms for 2-Facility Location Games with Minimax Envy. AAIM 2020: 260-272 - [c22]Qingqin Nong, Suning Gong, Qizhi Fang, Ding-Zhu Du:
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions. Complexity and Approximation 2020: 172-186 - [c21]Feiteng Zhang, Bin Liu, Qizhi Fang:
Core Decomposition, Maintenance and Applications. Complexity and Approximation 2020: 205-218 - [i5]Han Xiao, Qizhi Fang, Ding-Zhu Du:
Population Monotonic Allocation Schemes for Vertex Cover Games. CoRR abs/2002.02824 (2020) - [i4]Han Xiao, Qizhi Fang:
Arboricity Games: the Core and the Nucleolus. CoRR abs/2010.08936 (2020)
2010 – 2019
- 2019
- [j20]Bin Liu, Yuxia Yan, Qizhi Fang, Junyu Dong, Weili Wu, Huijuan Wang:
Maximizing profit of multiple adoptions in social networks with a martingale approach. J. Comb. Optim. 38(1): 1-20 (2019) - [j19]Suning Gong, Qingqin Nong, Wenjing Liu, Qizhi Fang:
Parametric monotone function maximization with matroid constraints. J. Glob. Optim. 75(3): 833-849 (2019) - [j18]Tiantian Chen, Wenjing Liu, Qizhi Fang, Jianxiong Guo, Ding-Zhu Du:
Minimizing Misinformation Profit in Social Networks. IEEE Trans. Comput. Soc. Syst. 6(6): 1206-1218 (2019) - [c20]Qingqin Nong, Tao Sun, Suning Gong, Qizhi Fang, Ding-Zhu Du, Xiaoyu Shao:
Maximize a Monotone Function with a Generic Submodularity Ratio. AAIM 2019: 249-260 - [i3]Qizhi Fang, Yuanxi Wang, Han Xiao:
On the Convexity of Independent Set Games. CoRR abs/1911.03169 (2019) - 2018
- [j17]Qingqin Nong, Tao Sun, T. C. E. Cheng, Qizhi Fang:
Bin packing game with a price of anarchy of 3/2. J. Comb. Optim. 35(2): 632-640 (2018) - [j16]Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun:
Path cooperative games. J. Comb. Optim. 36(1): 211-229 (2018) - [c19]Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu:
Profit Maximization Problem with Coupons in Social Networks. AAIM 2018: 49-61 - [c18]Qizhi Fang, Xin Chen, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Ding-Zhu Du:
General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach. AAIM 2018: 161-176 - [c17]Xia Chen, Xin Chen, Qizhi Fang:
An Interest-Matrix-Based Mechanism for Selfish Bin Packing. NCTCS 2018: 80-92 - 2017
- [j15]Qingqin Nong, G. Q. Fan, Qizhi Fang:
A coordination mechanism for a scheduling game with parallel-batching machines. J. Comb. Optim. 33(2): 567-579 (2017) - [j14]Xin Chen, Qingqin Nong, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang, Ker-I Ko:
Centralized and decentralized rumor blocking problems. J. Comb. Optim. 34(1): 314-329 (2017) - [j13]Weian Li, Wenjing Liu, Tiantian Chen, Xiaoying Qu, Qizhi Fang, Ker-I Ko:
Competitive profit maximization in social networks. Theor. Comput. Sci. 694: 1-9 (2017) - [c16]Xin Chen, Qingqin Nong, Qizhi Fang:
An Improved Mechanism for Selfish Bin Packing. COCOA (2) 2017: 241-257 - 2016
- [j12]Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang, Jialin Zhang:
Computing the least-core and nucleolus for threshold cardinality matching games. Theor. Comput. Sci. 609: 500-510 (2016) - [c15]Weian Li, Qizhi Fang, Wenjing Liu:
An Incentive Mechanism for Selfish Bin Covering. COCOA 2016: 641-654 - [r6]Qizhi Fang:
Complexity of Core. Encyclopedia of Algorithms 2016: 372-375 - [r5]Qizhi Fang:
Majority Equilibrium. Encyclopedia of Algorithms 2016: 1183-1185 - [r4]Qizhi Fang:
Nucleolus. Encyclopedia of Algorithms 2016: 1419-1422 - 2015
- [c14]Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun:
The Least-Core and Nucleolus of Path Cooperative Games. COCOON 2015: 70-82 - [i2]Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun:
The Least-core and Nucleolus of Path Cooperative Games. CoRR abs/1503.04575 (2015) - 2014
- [c13]Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang, Jialin Zhang:
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games. WINE 2014: 474-479 - [i1]Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang, Jialin Zhang:
Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games. CoRR abs/1409.5987 (2014) - 2010
- [c12]Qizhi Fang, Han Xiao, Shanfeng Zhu:
Top-d Rank Aggregation in Web Meta-search Engine - (Extended Abstract). FAW 2010: 35-44
2000 – 2009
- 2009
- [j11]Xiaotie Deng, Qizhi Fang, Xiaoxun Sun:
Finding nucleolus of flow game. J. Comb. Optim. 18(1): 64-86 (2009) - 2008
- [j10]Qizhi Fang, Liang Kong, Jia Zhao:
Core Stability of Vertex Cover Games. Internet Math. 5(4): 383-394 (2008) - [c11]Mao-cheng Cai, Qizhi Fang:
Restricted Core Stability of Flow Games. WINE 2008: 454-464 - [r3]Qizhi Fang:
Complexity of Core. Encyclopedia of Algorithms 2008 - [r2]Qizhi Fang:
Majority Equilibrium. Encyclopedia of Algorithms 2008 - [r1]Qizhi Fang:
Nucleolus. Encyclopedia of Algorithms 2008 - 2007
- [j9]Yanzhi Liu, Qizhi Fang:
Balancedness of edge covering games. Appl. Math. Lett. 20(10): 1064-1069 (2007) - [c10]Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun:
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON 2007: 439-447 - [c9]Shuqiang Chen, Qizhi Fang:
Call Control and Routing in SONET Rings. ESCAPE 2007: 260-270 - [c8]Qizhi Fang, Liang Kong:
Core Stability of Vertex Cover Games. WINE 2007: 482-490 - [e1]Franco P. Preparata, Qizhi Fang:
Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings. Lecture Notes in Computer Science 4613, Springer 2007, ISBN 978-3-540-73813-8 [contents] - 2006
- [c7]Xiaotie Deng, Qizhi Fang, Xiaoxun Sun:
Finding nucleolus of flow game. SODA 2006: 124-131 - 2005
- [j8]Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian:
Condorcet Winners for Public Goods. Ann. Oper. Res. 137(1): 229-242 (2005) - [j7]Qizhi Fang, Hye Kyung Kim:
A Note on Balancedness of Dominating Set Games. J. Comb. Optim. 10(4): 303-310 (2005) - [c6]Xiaoxun Sun, Qizhi Fang:
Core Stability of Flow Games. CJCDGCGT 2005: 189-199 - [c5]Qizhi Fang, Hye Kyung Kim, Dae Sik Lee:
Total Dominating Set Games. WINE 2005: 520-530 - 2004
- [j6]Qizhi Fang:
On the computational complexity of upper total domination. Discret. Appl. Math. 136(1): 13-22 (2004) - [j5]Shanfeng Zhu, Qizhi Fang, Weimin Zheng:
Social Choice For Data Fusion. Int. J. Inf. Technol. Decis. Mak. 3(4): 619-631 (2004) - [j4]Francis Y. L. Chin, Xiaotie Deng, Qizhi Fang, Shanfeng Zhu:
Approximate and dynamic rank aggregation. Theor. Comput. Sci. 325(3): 409-424 (2004) - 2003
- [j3]Qizhi Fang, Mao-cheng Cai, Xiaotie Deng:
Total Balancedness Condition for Steiner Tree Games. Discret. Appl. Math. 127(3): 555-563 (2003) - [c4]Xiaotie Deng, Qizhi Fang, Shanfeng Zhu:
Approximate Rank Aggregation (Preliminary Version). COCOON 2003: 262-271 - [c3]Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian:
Majority Equilibrium for Public Facility Allocation (Preliminary Version). COCOON 2003: 435-444 - [c2]Shanfeng Zhu, Qizhi Fang, Xiaotie Deng, Weimin Zheng:
Metasearch via Voting. IDEAL 2003: 734-741 - 2002
- [j2]Qizhi Fang, Shanfeng Zhu:
Linear and Integer Programming Techniques for Cooperative Games. Int. J. Found. Comput. Sci. 13(5): 653-666 (2002) - [j1]Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng:
On computational complexity of membership test in flow games and linear production games. Int. J. Game Theory 31(1): 39-45 (2002) - 2001
- [c1]Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng:
Membership for Core of LP Games and Other Games. COCOON 2001: 247-256
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 2025-01-21 00:09 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:
