default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXujun Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]George V. Moustakides, Xujun Liu, Olgica Milenkovic:
Optimal stopping methodology for the secretary problem with random queries. J. Appl. Probab. 61(2): 578-602 (2024)- 2023
- [j12]George V. Moustakides, Xujun Liu, Olgica Milenkovic:
Optimal Stopping Methodology for the Secretary Problem with Random Queries - ADDENDUM. J. Appl. Probab. 60(4): 1532 (2023) - [j11]Xujun Liu, Michael Santana
, Taylor Short:
Every subcubic multigraph is (1,27) $(1,{2}^{7})$-packing edge-colorable. J. Graph Theory 104(4): 851-885 (2023) - [j10]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
Query-based selection of optimal candidates under the Mallows model. Theor. Comput. Sci. 979: 114206 (2023) - [c5]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
A Combinatorial Proof for the Dowry Problem. ITW 2023: 538-543 - [i5]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
A combinatorial proof for the secretary problem with multiple choices. CoRR abs/2303.02361 (2023) - 2022
- [j9]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): 109-122 (2022) - [j8]József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic connected matchings in 2-edge-colored multipartite graphs. J. Graph Theory 100(3): 578-607 (2022) - [j7]Xujun Liu, Olgica Milenkovic:
Finding the second-best candidate under the Mallows model. Theor. Comput. Sci. 929: 39-68 (2022) - [c4]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT 2022: 2385-2390 - [i4]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR abs/2201.09171 (2022) - 2021
- [j6]Alexandr V. Kostochka, Xujun Liu:
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. Discret. Appl. Math. 302: 8-15 (2021) - [j5]Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. IEEE Trans. Inf. Theory 67(1): 347-357 (2021) - [c3]Xujun Liu, Jinping Hu:
Research on the Application of Network Command in Computer Network Engineering. AIAM (ACM) 2021: 1873-1876 - [c2]Xujun Liu, Olgica Milenkovic:
The Postdoc Problem under the Mallows Model. ISIT 2021: 3214-3219 - [i3]Xujun Liu, Olgica Milenkovic, George V. Moustakides:
Query-Based Selection of Optimal Candidates under the Mallows Model. CoRR abs/2101.07250 (2021) - [i2]George V. Moustakides, Xujun Liu, Olgica Milenkovic:
Optimal Stopping Methodology for the Secretary Problem with Random Queries. CoRR abs/2107.07513 (2021) - 2020
- [j4]Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu:
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283: 626-630 (2020) - [i1]Xujun Liu, Olgica Milenkovic:
Finding the Second-Best Candidate under the Mallows Model. CoRR abs/2011.07666 (2020)
2010 – 2019
- 2019
- [j3]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Cubic Graphs with Small Independence Ratio. Electron. J. Comb. 26(1): 1 (2019) - [j2]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing Chromatic Number of Subdivisions of Cubic Graphs. Graphs Comb. 35(2): 513-537 (2019) - [c1]Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. ISIT 2019: 1477-1481 - 2018
- [j1]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing chromatic number of cubic graphs. Discret. Math. 341(2): 474-483 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 19:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
