Available identifiers
zbMath Open liu.xujunMaRDI QIDQ1686000
List of research outcomes
Publication | Date of Publication | Type |
---|
Optimal stopping methodology for the secretary problem with random queries | 2024-05-10 | Paper |
Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable | 2023-11-06 | Paper |
Query-based selection of optimal candidates under the Mallows model | 2023-10-26 | Paper |
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs | 2023-10-05 | Paper |
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree | 2023-03-31 | Paper |
A combinatorial proof for the secretary problem with multiple choices | 2023-03-04 | Paper |
Balanced and Swap-Robust Trades for Dynamical Distributed Storage | 2022-01-22 | Paper |
Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs | 2021-08-02 | Paper |
Finding the Second-Best Candidate under the Mallows Model | 2020-11-15 | Paper |
Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs | 2020-06-29 | Paper |
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs | 2020-02-21 | Paper |
Monochromatic paths and cycles in $2$-edge-colored graphs with large minimum degree | 2019-06-06 | Paper |
Packing chromatic number of subdivisions of cubic graphs | 2019-05-03 | Paper |
Cubic graphs with small independence ratio | 2019-03-22 | Paper |
Ramsey numbers of ordered graphs under graph operations | 2019-02-01 | Paper |
Packing chromatic number of cubic graphs | 2017-12-20 | Paper |
On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs | 0001-01-03 | Paper |
Every subcubic graph is packing $(1,1,2,2,3)$-colorable | 0001-01-03 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Xujun Liu