Packing chromatic number of cubic graphs. - József Balogh; Alexandr V. Kostochka; Xujun Liu (Discret. Math., 2018)

Directed Intersection Representations and the Information Content of Digraphs. - Alexandr V. Kostochka; Xujun Liu; Roberto Assis Machado; Olgica Milenkovic (ISIT, 2019)

Cubic Graphs with Small Independence Ratio. - József Balogh; Alexandr V. Kostochka; Xujun Liu (Electron. J. Comb., 2019)

Packing Chromatic Number of Subdivisions of Cubic Graphs. - József Balogh; Alexandr V. Kostochka; Xujun Liu (Graphs Comb., 2019)

Packing (1, 1, 2, 2)-coloring of some subcubic graphs. - Runrun Liu; Xujun Liu; Martin Rolek; Gexin Yu (Discret. Appl. Math., 2020)

Research on the Application of Network Command in Computer Network Engineering. - Xujun Liu; Jinping Hu (AIAM (ACM), 2021)

The Postdoc Problem under the Mallows Model. - Xujun Liu; Olgica Milenkovic (ISIT, 2021)

Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. - Alexandr V. Kostochka; Xujun Liu (Discret. Appl. Math., 2021)

Directed Intersection Representations and the Information Content of Digraphs. - Xujun Liu; Roberto Assis Machado; Olgica Milenkovic (IEEE Trans. Inf. Theory, 2021)

Balanced and Swap-Robust Trades for Dynamical Distributed Storage. - Chao Pan 003; Ryan Gabrys; Xujun Liu; Charles J. Colbourn; Olgica Milenkovic (ISIT, 2022)

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree. - József Balogh; Alexandr V. Kostochka; Mikhail Lavrov; Xujun Liu (Comb. Probab. Comput., 2022)

Monochromatic connected matchings in 2-edge-colored multipartite graphs. - József Balogh; Alexandr V. Kostochka; Mikhail Lavrov; Xujun Liu (J. Graph Theory, 2022)

Finding the second-best candidate under the Mallows model. - Xujun Liu; Olgica Milenkovic (Theor. Comput. Sci., 2022)

A Combinatorial Proof for the Dowry Problem. - Xujun Liu; Olgica Milenkovic; George V. Moustakides (ITW, 2023)

A combinatorial proof for the secretary problem with multiple choices. - Xujun Liu; Olgica Milenkovic; George V. Moustakides (CoRR, 2023)

Query-based selection of optimal candidates under the Mallows model. - Xujun Liu; Olgica Milenkovic; George V. Moustakides (Theor. Comput. Sci., 2023)

Optimal Stopping Methodology for the Secretary Problem with Random Queries - ADDENDUM. - George V. Moustakides; Xujun Liu; Olgica Milenkovic (J. Appl. Probab., 2023)

Every subcubic multigraph is (1,27) $(1,{2}^{7})$-packing edge-colorable. - Xujun Liu; Michael Santana; Taylor Short (J. Graph Theory, 2023)

Optimal stopping methodology for the secretary problem with random queries. - George V. Moustakides; Xujun Liu; Olgica Milenkovic (J. Appl. Probab., 2024)

Every subcubic graph is packing (1,1,2,2,3)-colorable. - Xujun Liu; Xin Zhang 017; Yanting Zhang (Discret. Math., 2025)