Automatic Presentations of Structures. - Bakhadyr Khoussainov; Anil Nerode (LCC, 1994)

The Notion of Rank and Games. - Bakhadyr Khoussainov; Anil Nerode (LFCS, 1994)

Recursive Unary Algebras and Trees. - Bakhadyr Khoussainov (Ann. Pure Appl. Log., 1994)

Categoricity and Scott Families. - Bakhadyr Khoussainov; Richard A. Shore (DMTCS, 1996)

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. - Cristian S. Calude; Elena Calude; Bakhadyr Khoussainov (Developments in Language Theory, 1997)

Deterministic Automata: Simulation, Universality and Minimality. - Cristian Calude; Elena Calude; Bakhadyr Khoussainov (Ann. Pure Appl. Log., 1997)

Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? - Cristian Calude; Peter Hertling; Bakhadyr Khoussainov (Bull. EATCS, 1997)

Logic in Computer Science. - Douglas S. Bridges; Cristian Calude; Michael J. Dinneen; Bakhadyr Khoussainov (J. Univers. Comput. Sci., 1997)

Effectiveness of the Completeness Theorem for an Intermediate Logic. - Hajime Ishihara; Bakhadyr Khoussainov (J. Univers. Comput. Sci., 1997)

Computable Models of Theories with Few Models. - Bakhadyr Khoussainov; André Nies; Richard A. Shore (Notre Dame J. Formal Log., 1997)

Decidable Kripke Models of Intuitionistic Theories. - Hajime Ishihara; Bakhadyr Khoussainov; Anil Nerode (Ann. Pure Appl. Log., 1998)

Randomness, Computability, and Algebraic Specifications. - Bakhadyr Khoussainov (Ann. Pure Appl. Log., 1998)

Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. - Bakhadyr Khoussainov; Richard A. Shore (Ann. Pure Appl. Log., 1998)

Computable Kripke Models and Intermediate Logics. - Hajime Ishihara; Bakhadyr Khoussainov; Anil Nerode (Inf. Comput., 1998)

Games with Unknown Past. - Bakhadyr Khoussainov; Alexander Yakhnis; Vladimir Yakhnis (Math. Log. Q., 1998)

Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". - Bakhadyr Khoussainov; Richard A. Shore (Ann. Pure Appl. Log., 1999)

Computably Categorical Structures and Expansions by Constants. - Peter Cholak; Sergei S. Goncharov; Bakhadyr Khoussainov; Richard A. Shore (J. Symb. Log., 1999)

Update Networks and Their Routing Strategies. - Michael J. Dinneen; Bakhadyr Khoussainov (WG, 2000)

On Computability Theoretic Properties of Structures and Their Cartesian Products. - Bakhadyr Khoussainov (Math. Log. Q., 2000)

Finite nondeterministic automata: Simulation and minimality. - Cristian Calude; Elena Calude; Bakhadyr Khoussainov (Theor. Comput. Sci., 2000)

Algebraic constraints, automata, and regular languages. - Bakhadyr Khoussainov (CATS, 2000)

On Game-Theoretic Models of Networks. - Hans L. Bodlaender; Michael J. Dinneen; Bakhadyr Khoussainov (ISAAC, 2001)

Graphs with Automatic Presentations over a Unary Alphabet. - Bakhadyr Khoussainov; Sasha Rubin (J. Autom. Lang. Comb., 2001)

Recursively enumerable reals and Chaitin Omega numbers. - Cristian Calude; Peter Hertling; Bakhadyr Khoussainov; Yongge Wang (Theor. Comput. Sci., 2001)

Some Results on Automatic Structures. - Hajime Ishihara; Bakhadyr Khoussainov; Sasha Rubin (LICS, 2002)

Complexity of Some Infinite Games Played on Finite Graphs. - Hajime Ishihara; Bakhadyr Khoussainov (WG, 2002)

Degree spectra and computable dimensions in algebraic structures. - Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore; Arkadii M. Slinko (Ann. Pure Appl. Log., 2002)

Relaxed Update and Partition Network Games. - Hans L. Bodlaender; Michael J. Dinneen; Bakhadyr Khoussainov (Fundam. Informaticae, 2002)

On Algebraic Specifications of Abstract Data Types. - Bakhadyr Khoussainov (CSL, 2003)

Finite State Strategies in One Player McNaughton Games. - Bakhadyr Khoussainov (DMTCS, 2003)

On Automatic Partial Orders. - Bakhadyr Khoussainov; Sasha Rubin; Frank Stephan 001 (LICS, 2003)

Automatic Structures: Overview and Future Directions. - Bakhadyr Khoussainov; Sasha Rubin (J. Autom. Lang. Comb., 2003)

Update games and update networks. - Michael J. Dinneen; Bakhadyr Khoussainov (J. Discrete Algorithms, 2003)

A computably categorical structure whose expansion by a constant has infinite computable dimension. - Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore (J. Symb. Log., 2003)

On algebraic and logical specifications of classes of regular languages. - Bakhadyr Khoussainov (Theor. Comput. Sci., 2003)

Definability and Regularity in Automatic Structures. - Bakhadyr Khoussainov; Sasha Rubin; Frank Stephan 001 (STACS, 2004)

Decidability of Term Algebras Extending Partial Algebras. - Bakhadyr Khoussainov; Sasha Rubin (CSL, 2005)

Adaptive Verification using Forced Simulation. - Roopak Sinha; Partha S. Roop; Bakhadyr Khoussainov (FESCA@ETAPS, 2005)

Computably Enumerable Algebras, Their Expansions, and Isomorphisms. - Bakhadyr Khoussainov; Steffen Lempp; Theodore A. Slaman (Int. J. Algebra Comput., 2005)

Automatic linear orders and trees. - Bakhadyr Khoussainov; Sasha Rubin; Frank Stephan 001 (ACM Trans. Comput. Log., 2005)

P01-Presentations of Algebras. - Bakhadyr Khoussainov; Theodore A. Slaman; Pavel Semukhin (Arch. Math. Log., 2006)

An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated. - Bakhadyr Khoussainov; Denis R. Hirschfeldt; Pavel Semukhin (Notre Dame J. Formal Log., 2006)

07441 Summary – Algorithmic-Logical Theory of Infinite Structures. - Rod Downey; Bakhadyr Khoussainov; Dietrich Kuske; Markus Lohrey; Moshe Y. Vardi (Algorithmic-Logical Theory of Infinite Structures, 2007)

07441 Abstracts Collection – Algorithmic-Logical Theory of Infinite Structures. - Rod Downey; Bakhadyr Khoussainov; Dietrich Kuske; Markus Lohrey; Moshe Y. Vardi (Algorithmic-Logical Theory of Infinite Structures, 2007)

Applications of Kolmogorov complexity to computable model theory. - Bakhadyr Khoussainov; Pavel Semukhin; Frank Stephan 001 (J. Symb. Log., 2007)

Automatic Structures: Richness and Limitations. - Bakhadyr Khoussainov; André Nies; Sasha Rubin; Frank Stephan 001 (Log. Methods Comput. Sci., 2007)

Sequential Automatic Algebras. - Michael Brough; Bakhadyr Khoussainov; Peter Nelson (CiE, 2008)

Computable Categoricity of Graphs with Finite Components. - Barbara F. Csima; Bakhadyr Khoussainov; Jiamou Liu (CiE, 2008)

When Is Reachability Intrinsically Decidable?. - Barbara F. Csima; Bakhadyr Khoussainov (Developments in Language Theory, 2008)

From Automatic Structures to Borel Structures. - Greg Hjorth; Bakhadyr Khoussainov; Antonio Montalbán; André Nies (LICS, 2008)

Model Theoretic Complexity of Automatic Structures (Extended Abstract). - Bakhadyr Khoussainov; Mia Minnes (TAMC, 2008)

Computable categoricity and the Ershov hierarchy. - Bakhadyr Khoussainov; Frank Stephan 001; Yue Yang 004 (Ann. Pure Appl. Log., 2008)

Open Questions in the Theory of Automatic Structures. - Bakhadyr Khoussainov; Anil Nerode (Bull. EATCS, 2008)

A Dynamic Algorithm for Reachability Games Played on Trees. - Bakhadyr Khoussainov; Jiamou Liu; Imran Khaliq (MFCS, 2009)

Linear orders with distinguished function symbol. - Douglas A. Cenzer; Barbara F. Csima; Bakhadyr Khoussainov (Arch. Math. Log., 2009)

On complexity of Ehrenfeucht-Fraïssé games. - Bakhadyr Khoussainov; Jiamou Liu (Ann. Pure Appl. Log., 2009)

Model-theoretic complexity of automatic structures. - Bakhadyr Khoussainov; Mia Minnes (Ann. Pure Appl. Log., 2009)

Unary automatic graphs: an algorithmic perspective. - Bakhadyr Khoussainov; Jiamou Liu; Mia Minnes (Math. Struct. Comput. Sci., 2009)

On Index Sets of Some Properties of Computable Algebras. - Bakhadyr Khoussainov; Andrei S. Morozov (CiE, 2010)

A computable Alef0-categorical structure whose theory computes true arithmetic. - Bakhadyr Khoussainov; Antonio Montalbán (J. Symb. Log., 2010)

Descriptional Complexity of Determinization and Complementation for Finite Automata. - Aniruddh Gandhi; Nan Rosemary Ke; Bakhadyr Khoussainov (CATS, 2011)

Extracting Winning Strategies in Update Games. - Imran Khaliq; Bakhadyr Khoussainov; Jiamou Liu (CiE, 2011)

Automatic Structures and Groups. - Bakhadyr Khoussainov (LATA, 2011)

From automatic structures to automatic groups - Olga Kharlampovich; Bakhadyr Khoussainov; Alexei Miasnikov (CoRR, 2011)

Efficient Algorithms for Games Played on Trees with Back-edges. - Aniruddh Gandhi; Bakhadyr Khoussainov; Jiamou Liu (Fundam. Informaticae, 2011)

Lectures on Discrete Mathematics for Computer Science - Bakhadyr Khoussainov; Nodira Khoussainova (World Scientific, 2012)

Solving infinite games on trees with back-edges. - Aniruddh Gandhi; Bakhadyr Khoussainov; Jiamou Liu (CATS, 2012)

On State Complexity of Finite Word and Tree Languages. - Aniruddh Gandhi; Bakhadyr Khoussainov; Jiamou Liu (Developments in Language Theory, 2012)

Finite Automata over Structures - (Extended Abstract). - Aniruddh Gandhi; Bakhadyr Khoussainov; Jiamou Liu (TAMC, 2012)

Computable Isomorphisms of Boolean Algebras with Operators. - Bakhadyr Khoussainov; Tomasz Kowalski (Stud Logica, 2012)

A Robust Service Recommendation Scheme. - Xinfeng Ye; Jupeng Zheng; Bakh Khoussainov (IEEE SCC, 2013)

On Decidable and Computable Models of Theories. - Alexander Gavruskin; Bakhadyr Khoussainov (CiE, 2013)

Dynamising Interval Scheduling: The Monotonic Case. - Alexander Gavruskin; Bakhadyr Khoussainov; Mikhail Kokho; Jiamou Liu (IWOCA, 2013)

A Game Theory-Based Approach to Service Rating. - Xinfeng Ye; Jupeng Zheng; Bakh Khoussainov (PDCAT, 2013)

A Game Theoretic Approach to Service Discovery and Selection. - Yi Chen; Bakh Khoussainov; Xinfeng Ye (SMC, 2013)

Fine-grained access control for cloud computing. - Xinfeng Ye; Bakh Khoussainov (Int. J. Grid Util. Comput., 2013)

A quest for algorithmically random infinite structures. - Bakhadyr Khoussainov (CSL-LICS, 2014)

On Automatic Transitive Graphs. - Dmitry Berdinsky; Bakhadyr Khoussainov (Developments in Language Theory, 2014)

Dynamic Interval Scheduling for Multiple Machines. - Alexander Gavruskin; Bakhadyr Khoussainov; Mikhail Kokho; Jiamou Liu (ISAAC, 2014)

Graphs realised by r.e. equivalence relations. - Alexander Gavruskin; Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001 (Ann. Pure Appl. Log., 2014)

Dynamic Algorithms for Interval Scheduling on a Single Machine. - Alex Gavryushkin; Bakhadyr Khoussainov; Mikhail Kokho; Jiamou Liu (CoRR, 2014)

Dynamic algorithms for monotonic interval scheduling problem. - Alexander Gavruskin; Bakhadyr Khoussainov; Mikhail Kokho; Jiamou Liu (Theor. Comput. Sci., 2015)

A Quest for Algorithmically Random Infinite Structures, II. - Bakhadyr Khoussainov (LFCS, 2016)

Quantifier Free Definability on Infinite Algebras. - Bakh Khoussainov (LICS, 2016)

Decision Problems for Finite Automata over Infinite Algebraic Structures. - Bakhadyr Khoussainov; Jiamou Liu (CIAA, 2016)

Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals. - Alex Gavryushkin; Bakhadyr Khoussainov; Mikhail Kokho; Jiamou Liu (Algorithmica, 2016)

Cayley Automatic Representations of Wreath Products. - Dmitry Berdinsky; Bakhadyr Khoussainov (Int. J. Found. Comput. Sci., 2016)

Linear Orders Realized by C.E. Equivalence Relations. - Ekaterina B. Fokina; Bakhadyr Khoussainov; Pavel Semukhin; Daniel Turetsky (J. Symb. Log., 2016)

Reducibilities among equivalence relations induced by recursively enumerable structures. - Alex Gavryushkin; Bakhadyr Khoussainov; Frank Stephan 001 (Theor. Comput. Sci., 2016)

Tree-automatic scattered linear orders. - Sanjay Jain 001; Bakhadyr Khoussainov; Philipp Schlicht; Frank Stephan 001 (Theor. Comput. Sci., 2016)

Large scale geometries of infinite strings. - Bakh Khoussainov; Toru Takisaka (LICS, 2017)

Deciding parity games in quasipolynomial time. - Cristian S. Calude; Sanjay Jain 001; Bakhadyr Khoussainov; Wei Li 050; Frank Stephan 001 (STOC, 2017)

Semiautomatic Structures. - Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001; Dan Teng; Siyuan Zou (Theory Comput. Syst., 2017)

A Journey to Computably Enumerable Structures (Tutorial Lectures). - Bakh Khoussainov (CiE, 2018)

A Brief Excursion to Parity Games. - Bakhadyr Khoussainov (DLT, 2018)

Finitely generated semiautomatic groups. - Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001 (Comput., 2018)

Periodic Neural Networks for Multivariate Time Series Analysis and Forecasting. - Nurilla Avazov; Jiamou Liu; Bakhadyr Khoussainov (IJCNN, 2019)

Random Subgroups of Rationals. - Ziyuan Gao; Sanjay Jain 001; Bakhadyr Khoussainov; Wei Li 050; Alexander G. Melnikov; Karen Seidel 001; Frank Stephan 001 (MFCS, 2019)

Effective aspects of algorithmically random structures. - Matthew Harrison-Trainor; Bakh Khoussainov; Daniel Turetsky (Comput., 2019)

Computability Aspects of Differential Games in Euclidian Spaces. - Gafurjan I. Ibragimov; Bakh Khoussainov; Arno Pauly (CoRR, 2019)

The isomorphism problem for tree-automatic ordinals with addition. - Sanjay Jain 001; Bakhadyr Khoussainov; Philipp Schlicht; Frank Stephan 001 (Inf. Process. Lett., 2019)

Whispers on Ethereum: Blockchain-based Covert Data Embedding Schemes. - Shaoyuan Liu; Zhi Fang; Feng Gao 019; Bakh Khoussainov; Zijian Zhang 001; Jiamou Liu; Liehuang Zhu (BSCI, 2020)

Automatic Equivalence Structures of Polynomial Growth. - Moses Ganardi; Bakhadyr Khoussainov (CSL, 2020)

WiPOS: A POS Terminal Password Inference System Based on Wireless Signals. - Zijian Zhang 001; Nurilla Avazov; Jiamou Liu; Bakh Khoussainov; Xin Li 033; Keke Gai; Liehuang Zhu (IEEE Internet Things J., 2020)

From Local to Global Norm Emergence: Dissolving Self-reinforcing Substructures with Incremental Social Instruments. - Yiwei Liu; Jiamou Liu; Kaibin Wan; Zhan Qin; Zijian Zhang 001; Bakhadyr Khoussainov; Liehuang Zhu (ICML, 2021)

Attacking Community Detectors: Mislead Detectors via Manipulating the Graph Structure. - Kaibin Wan; Jiamou Liu; Yiwei Liu; Zijian Zhang 001; Bakhadyr Khoussainov (MobiCASE, 2021)

Improving Togetherness Using Structural Entropy. - Siyu Zhang; Jiamou Liu; Yiwei Liu; Zijian Zhang 001; Bakhadyr Khoussainov (MobiCASE, 2021)

Exploring active attacks for three incorrect implementations of the ISO/IEC 9798 in satellite networks. - Zhengjia Zhu; Hao Yin; Zijian Zhang 001; Tielei Li; Jiamou Liu; Bakh Khoussainov; Chang Xu 004 (Comput. Commun., 2021)

Maximum Entropy Inverse Reinforcement Learning for Mean Field Games. - Yang Chen 028; Jiamou Liu; Bakhadyr Khoussainov (CoRR, 2021)

Quasi-Isometric Graph-Simplifications. - Bakhadyr Khoussainov; Khí-Uí Soo (CoRR, 2021)

A Blockchain-Based Storage System With Financial Incentives for Load-balancing. - Hao Yin; Zijian Zhang 001; Liehuang Zhu; Meng Li 006; Xiaojiang Du; Mohsen Guizani; Bakh Khoussainov (IEEE Trans. Netw. Sci. Eng., 2021)

Multi-Unit Auction in Social Networks with Budgets. - Mingyu Xiao 001; Yuchao Song; Bakh Khoussainov (AAAI, 2022)

Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. - Binglin Tao; Mingyu Xiao 001; Bakhadyr Khoussainov; Junqiang Peng 001 (INFOCOM, 2022)

Listing Maximal k-Plexes in Large Real-World Graphs. - Zhengren Wang; Yi Zhou 016; Mingyu Xiao 001; Bakhadyr Khoussainov (WWW, 2022)

Facility Location with Entrance Fees. - Mengfan Ma; Mingyu Xiao 001; Tian Bai 003; Bakh Khoussainov (CoRR, 2022)

Centralization Problem for Opinion Convergence in Decentralized Networks. - Yiping Liu; Jiamou Liu; Bakhadyr Khoussainov; Miao Qiao; Bo Yan (CoRR, 2022)

Chain-Based Covert Data Embedding Schemes in Blockchain. - Haotian Cao; Hao Yin; Feng Gao 019; Zijian Zhang 001; Bakh Khoussainov; Shubin Xu; Liehuang Zhu (IEEE Internet Things J., 2022)

Proof of Continuous Work for Reliable Data Storage Over Permissionless Blockchain. - Hao Yin; Zijian Zhang 001; Jialing He; Liran Ma; Liehuang Zhu; Meng Li 006; Bakh Khoussainov (IEEE Internet Things J., 2022)

Infinite Strings and their Large Scale Properties. - Bakh Khoussainov; Toru Takisaka (J. Symb. Log., 2022)

Deciding Parity Games in Quasi-polynomial Time. - Cristian S. Calude; Sanjay Jain 001; Bakhadyr Khoussainov; Wei Li 050; Frank Stephan 001 (SIAM J. Comput., 2022)

Video Aficionado: We Know What You Are Watching. - Jialing He; Zijian Zhang 001; Jian Mao; Liran Ma; Bakh Khoussainov; Rui Jin; Liehuang Zhu (IEEE Trans. Mob. Comput., 2022)

MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load Monitoring Based on a Dual-CNN Model. - Jialing He; Jiamou Liu; Zijian Zhang 001; Yang Chen 028; Yiwei Liu; Bakh Khoussainov; Liehuang Zhu (AAAI, 2023)

Facility Location Games with Entrance Fees. - Mengfan Ma; Mingyu Xiao 001; Tian Bai 003; Bakh Khoussainov (AAAI, 2023)

Centralization Problem for Opinion Convergence in Decentralized Networks. - Yiping Liu; Jiamou Liu; Bakh Khoussainov; Miao Qiao; Bo Yan; Mengxiao Zhang (ASONAM, 2023)

Differentially Private Diffusion Auction: The Single-unit Case. - Fengjuan Jia; Mengxiao Zhang; Jiamou Liu; Bakh Khoussainov (AAMAS, 2023)

Learning Density-Based Correlated Equilibria for Markov Games. - Libo Zhang 006; Yang Chen 028; Toru Takisaka; Bakh Khoussainov; Michael Witbrock; Jiamou Liu (AAMAS, 2023)

Topological Network-Control Games. - Zihui Liang; Bakh Khoussainov; Haidong Yang (COCOON (2), 2023)

Multi-Unit Auction over a Social Network. - Yuan Fang; Mengxiao Zhang; Jiamou Liu; Bakh Khoussainov; Mingyu Xiao 001 (ECAI, 2023)

Characterizations of Network Auctions and Generalizations of VCG. - Mingyu Xiao 001; Guixin Lin; Bakh Khoussainov; Yuchao Song (ECAI, 2023)

Connectivity in the Presence of an Opponent. - Zihui Liang; Bakh Khoussainov; Toru Takisaka; Mingyu Xiao 001 (ESA, 2023)

Incentivising Diffusion while Preserving Differential Privacy. - Fengjuan Jia; Mengxiao Zhang; Jiamou Liu; Bakh Khoussainov (UAI, 2023)

Two new algorithms for solving Müller games and their applications. - Zihui Liang; Bakh Khoussainov; Mingyu Xiao 001 (CoRR, 2023)

String compression in FA-presentable structures. - Dmitry Berdinsky; Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001 (Theor. Comput. Sci., 2023)

InFocus: Amplifying Critical Feature Influence on Non-Intrusive Load Monitoring Through Self-Attention Mechanisms. - Jialing He; Zijian Zhang 001; Liran Ma; Zhouyu Zhang; Meng Li 006; Bakh Khoussainov; Jiamou Liu; Liehuang Zhu (IEEE Trans. Smart Grid, 2023)

Topological Network-Control Games Played on Graphs. - Zihui Liang; Bakh Khoussainov; Haidong Yang (COCOON (2), 2024)

Meta-Mechanisms for Combinatorial Auctions over Social Networks. - Yuan Fang; Mengxiao Zhang; Jiamou Liu; Bakh Khoussainov (ECAI, 2024)

Balancing Efficiency with Equality: Auction Design with Group Fairness Concerns. - Fengjuan Jia; Mengxiao Zhang; Jiamou Liu; Bakh Khoussainov (ECAI, 2024)

Defining algorithmically presented structures in first order logic. - Nadim Kasymov; Nadira Karimova; Bakh Khoussainov (LICS, 2024)

Finding small feedback arc sets on large graphs. - Ziliang Xiong; Yi Zhou 016; Mingyu Xiao 001; Bakhadyr Khoussainov (Comput. Oper. Res., 2024)

A Blockchain-Based Privacy-Preserving Scheme for Sealed-Bid Auction. - Zijian Zhang 001; Xin Lu; Meng Li 006; Jincheng An; Yang Yu 001; Hao Yin; Liehuang Zhu; Yong Liu; Jiamou Liu; Bakh Khoussainov (IEEE Trans. Dependable Secur. Comput., 2024)

HCA: Hashchain-Based Consensus Acceleration Via Re-Voting. - Zijian Zhang 001; Xuyang Liu; Meng Li 006; Hao Yin; Liehuang Zhu; Bakh Khoussainov; Keke Gai (IEEE Trans. Dependable Secur. Comput., 2024)

Word Structures and Their Automatic Presentations. - Xiaoyang Gong; Bakh Khoussainov; Yuyang Zhuge (MFCS, 2025)

Deciding Regular Games: a Playground for Exponential Time Algorithms. - Zihui Liang; Bakh Khoussainov; Mingyu Xiao 001 (MFCS, 2025)

Network control games played on graphs. - Zihui Liang; Bakh Khoussainov; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

Strategyproofness and Monotone Allocation of Auction in Social Networks. - Yuhang Guo 003; Dong Hao; Bin Li 035; Mingyu Xiao 001; Bakh Khoussainov (CoRR, 2025)