Xujun Liu

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