EDBT 2026 Demo / reviewers in the wild / expert
Wanshun Yang
dblp:251/1838
· DBLP profile ↗
4ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Structural properties of LIC-planar graphs
Jiangxu Kong, Wanshun Yang, Haoying Yuan |
Discret. Appl. Math. | 3 |
| 2025 | Dynamic coloring of IC-planar graphs
Xiaoxue Hu, Jiangxu Kong, Weifan Wang 0001, Wanshun Yang |
Discret. Appl. Math. | 4 |
| 2021 | IC-Planar Graphs Are 6-ChoosableabstractA 1-planar graph is a graph that can be drawn in the Euclidean plane such that each edge crosses at most one edge. An independent crossing (IC)-planar graph is a 1-planar graph satisfying the condition that two pairs of crossing edges have no common end-vertices. It is shown in this paper that every IC-planar graph is 6-choosable. Wanshun Yang, Yiqiao Wang 0002, Weifan Wang 0001, Ko-Wei Lih |
SIAM J. Discret. Math. | 1 |
| 2020 | An improved upper bound for the acyclic chromatic number of 1-planar graphs
Wanshun Yang, Weifan Wang 0001, Yiqiao Wang 0002 |
Discret. Appl. Math. | 1 |