default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYandong Bai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Yandong Bai
, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo:
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346: 215-227 (2024)- 2023
- [j17]Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang:
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. Discret. Appl. Math. 327: 101-109 (2023) - [j16]Yandong Bai, Binlong Li:
Connected k-factors in bipartite graphs. Discret. Math. 346(1): 113174 (2023) - [j15]Tingting Han, Shenggui Zhang, Yandong Bai:
Properly colored cycles of different lengths in edge-colored complete graphs. Discret. Math. 346(12): 113653 (2023) - [j14]Yuhang Bai, Zhiwei Guo, Shenggui Zhang, Yandong Bai:
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. J. Comb. Optim. 45(2): 73 (2023) - 2021
- [j13]Tingting Han, Shenggui Zhang, Yandong Bai, Ruonan Li:
Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles. Graphs Comb. 37(3): 1129-1138 (2021) - [j12]Wei Li, Shenggui Zhang, Yandong Bai, Ruonan Li:
Rainbow Triangles in Arc-Colored Tournaments. Graphs Comb. 37(4): 1271-1290 (2021) - 2020
- [j11]Yandong Bai, Binlong Li, Shenggui Zhang:
Kernels by rainbow paths in arc-colored tournaments. Discret. Appl. Math. 282: 14-21 (2020)
2010 – 2019
- 2019
- [j10]Yandong Bai, Yannis Manoussakis:
On the Number of Vertex-Disjoint Cycles in Digraphs. SIAM J. Discret. Math. 33(4): 2444-2451 (2019) - [i1]Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo:
Safe sets in digraphs. CoRR abs/1908.06664 (2019) - 2018
- [j9]Yandong Bai, Shinya Fujita, Shenggui Zhang:
Kernels by properly colored paths in arc-colored digraphs. Discret. Math. 341(6): 1523-1533 (2018) - [j8]Donglei Yang, Yandong Bai, Guanghui Wang, Jianliang Wu:
On splitting digraphs. Eur. J. Comb. 71: 174-179 (2018) - 2017
- [c1]Min Huang, Yandong Bai, Yinong Chen, Bo Sun:
A Distributed Proactive Service Framework for Crowd-Sensing Process. ISADS 2017: 68-74 - 2016
- [j7]Hao Li, Yandong Bai, Weihua He, Qiang Sun:
Vertex-distinguishing proper arc colorings of digraphs. Discret. Appl. Math. 209: 276-286 (2016) - [j6]Hao Li, Weihua He, Weihua Yang, Yandong Bai:
Hamiltonian cycles in spanning subgraphs of line graphs. Discret. Appl. Math. 209: 287-295 (2016) - [j5]Yandong Bai, Binlong Li, Hao Li, Weihua He:
Universal arcs in tournaments. Discret. Math. 339(8): 2063-2065 (2016) - [j4]Hao Li, Weihua He, Weihua Yang, Yandong Bai:
A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. Graphs Comb. 32(2): 741-744 (2016) - 2015
- [j3]Yandong Bai, Binlong Li, Hao Li:
Vertex-disjoint cycles in bipartite tournaments. Discret. Math. 338(8): 1307-1309 (2015) - 2014
- [b1]Yandong Bai:
Arc colorings and cycles in digraphs. (Colorations d'arc et cycles dans les graphes orientés). University of Paris-Sud, Orsay, France, 2014 - [j2]Yandong Bai, Hao Li, Weihua He:
Complementary cycles in regular bipartite tournaments. Discret. Math. 333: 14-27 (2014) - 2012
- [j1]Yandong Bai, Binlong Li, Shenggui Zhang:
Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. Discret. Math. 312(10): 1596-1601 (2012)
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 2025-01-21 00:23 CET 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:
