Xujun Liu

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 23

Top Topics

Optimal Stopping

Distributed Storage

Top Venues

J. Appl. Probab.

Discret. Appl. Math.

Publications

George V. Moustakides, Xujun Liu, Olgica Milenkovic
Optimal stopping methodology for the secretary problem with random queries. J. Appl. Probab. 61 (2) (2024)
Xujun Liu, Olgica Milenkovic, George V. Moustakides
A Combinatorial Proof for the Dowry Problem. ITW (2023)
Xujun Liu, Michael Santana, Taylor Short
Every subcubic multigraph is (1,27) $(1,{2}^{7})$-packing edge-colorable. J. Graph Theory 104 (4) (2023)
Xujun Liu, Olgica Milenkovic, George V. Moustakides
A combinatorial proof for the secretary problem with multiple choices. CoRR (2023)
George V. Moustakides, Xujun Liu, Olgica Milenkovic
Optimal Stopping Methodology for the Secretary Problem with Random Queries - ADDENDUM. J. Appl. Probab. 60 (4) (2023)
Xujun Liu, Olgica Milenkovic, George V. Moustakides
Query-based selection of optimal candidates under the Mallows model. Theor. Comput. Sci. 979 (2023)
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree. Comb. Probab. Comput. 31 (1) (2022)
Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR (2022)
Xujun Liu, Olgica Milenkovic
Finding the second-best candidate under the Mallows model. Theor. Comput. Sci. 929 (2022)
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
Monochromatic connected matchings in 2-edge-colored multipartite graphs. J. Graph Theory 100 (3) (2022)
Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT (2022)
Alexandr V. Kostochka, Xujun Liu
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. Discret. Appl. Math. 302 (2021)
Xujun Liu, Jinping Hu
Research on the Application of Network Command in Computer Network Engineering. AIAM (ACM) (2021)
Xujun Liu, Olgica Milenkovic
The Postdoc Problem under the Mallows Model. ISIT (2021)
Xujun Liu, Olgica Milenkovic, George V. Moustakides
Query-Based Selection of Optimal Candidates under the Mallows Model. CoRR (2021)
Xujun Liu, Roberto Assis Machado, Olgica Milenkovic
Directed Intersection Representations and the Information Content of Digraphs. IEEE Trans. Inf. Theory 67 (1) (2021)
George V. Moustakides, Xujun Liu, Olgica Milenkovic
Optimal Stopping Methodology for the Secretary Problem with Random Queries. CoRR (2021)
Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283 (2020)
Xujun Liu, Olgica Milenkovic
Finding the Second-Best Candidate under the Mallows Model. CoRR (2020)
Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic
Directed Intersection Representations and the Information Content of Digraphs. ISIT (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Packing Chromatic Number of Subdivisions of Cubic Graphs. Graphs Comb. 35 (2) (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Cubic Graphs with Small Independence Ratio. Electron. J. Comb. 26 (1) (2019)
József Balogh, Alexandr V. Kostochka, Xujun Liu
Packing chromatic number of cubic graphs. Discret. Math. 341 (2) (2018)