default search action
Jiangdong Ai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang
, Anders Yeo
On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory 105(3): 413-426 (2024) - [j9]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo
Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. 38(3): 2370-2391 (2024) - [i9]Jiangdong Ai, Hong Liu, Zixiang Xu, Qiang Zhou:
Piercing independent sets in graphs without large induced matching. CoRR abs/2403.19737 (2024) - [i8]Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou:
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR abs/2407.17051 (2024) - 2023
- [j8]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo
Results on the small quasi-kernel conjecture. Discret. Math. 346(7): 113435 (2023) - [j7]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Yongtang Shi:
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. J. Comb. Optim. 45(1): 40 (2023) - [i7]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. CoRR abs/2304.10202 (2023) - 2022
- [j6]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
Extended path partition conjecture for semicomplete and acyclic compositions. Discret. Math. 345(11): 113019 (2022) - [j5]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Kings in multipartite hypertournaments. J. Graph Theory 99(1): 82-89 (2022) - [i6]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the Small Quasi-Kernel Conjecture. CoRR abs/2207.12157 (2022) - 2021
- [j4]Jiangdong Ai
Proximity and remoteness in directed and undirected graphs. Discret. Math. 344(3): 112252 (2021) - [i5]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou:
Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions. CoRR abs/2111.09633 (2021) - 2020
- [j3]Jiangdong Ai, Hui Lei, Yongtang Shi
k-Ary spanning trees contained in tournaments. Discret. Appl. Math. 285: 141-146 (2020) - [j2]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory 95(2): 256-266 (2020) - [i4]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda:
Proximity and Remoteness in Directed and Undirected Graphs. CoRR abs/2001.10253 (2020) - [i3]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Note on 4-Kings in Bipartite Hypertournaments. CoRR abs/2011.05878 (2020)
2010 – 2019
- 2019
- [j1]Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai:
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. Discret. Math. 342(8): 2297-2305 (2019) - [i2]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu:
Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs. CoRR abs/1907.06379 (2019) - 2018
- [i1]Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai:
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. CoRR abs/1812.08809 (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-10-07 22:08 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: