default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBakhadyr Khoussainov
- > Home > Persons > Bakhadyr Khoussainov
Publications
- 2026
[j68]Zihui Liang
, Bakh Khoussainov, Mingyu Xiao:
Exponential time algorithms for deciding regular games. Inf. Comput. 310: 105443 (2026)- [j65]Binglin Tao, Mingyu Xiao, Junqiang Peng, Zimo Sheng, Bakh Khoussainov:
Optimal Shielding to Guarantee Region-Based Connectivity Between Multiple Pairs of Nodes. IEEE Trans. Netw. 34: 3564-3579 (2026) - 2025
- [j64]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Network control games played on graphs. Theor. Comput. Sci. 1034: 115123 (2025) - [c77]Yuhang Guo, Dong Hao, Bin Li, Mingyu Xiao, Bakh Khoussainov:
Strategyproofness and Monotone Allocation of Auction in Social Networks. IJCAI 2025: 3883-3890 - [c75]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Deciding Regular Games: a Playground for Exponential Time Algorithms. MFCS 2025: 66:1-66:18 - [i27]Yuhang Guo, Dong Hao, Bin Li, Mingyu Xiao, Bakh Khoussainov:
Strategyproofness and Monotone Allocation of Auction in Social Networks. CoRR abs/2507.14472 (2025) - 2024
- [j63]Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Finding small feedback arc sets on large graphs. Comput. Oper. Res. 169: 106724 (2024) - [i26]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Deciding regular games: a playground for exponential time algorithms. CoRR abs/2405.07188 (2024) - 2023
- [c68]Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov:
Facility Location Games with Entrance Fees. AAAI 2023: 5797-5804 - [c63]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao:
Multi-Unit Auction over a Social Network. ECAI 2023: 676-683 - [c62]Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song:
Characterizations of Network Auctions and Generalizations of VCG. ECAI 2023: 2736-2743 - [c61]Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the Presence of an Opponent. ESA 2023: 79:1-79:14 - [i19]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao:
Multi-unit Auction over a Social Network. CoRR abs/2302.08924 (2023) - [i18]Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song:
Characterizations of Network Auctions and Generalizations of VCG. CoRR abs/2302.09237 (2023) - [i17]Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the presence of an opponent. CoRR abs/2304.08783 (2023) - [i16]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Two new algorithms for solving Müller games and their applications. CoRR abs/2311.04655 (2023) - 2022
- [c59]Mingyu Xiao, Yuchao Song, Bakh Khoussainov:
Multi-Unit Auction in Social Networks with Budgets. AAAI 2022: 5228-5235 - [c58]Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng:
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM 2022: 1109-1118 - [c57]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. WWW 2022: 1517-1527 - [i15]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. CoRR abs/2202.08737 (2022) - [i14]Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov:
Facility Location with Entrance Fees. CoRR abs/2204.11282 (2022)
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 2026-06-23 01:28 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
