EDBT 2026 Demo / reviewers in the wild / expert
Xin Zhang 0017
dblp:76/1584-17
· DBLP profile ↗
22ranked-venue papers
6as first author
13since 2021 · last 2026
0000-0001-5250-1657ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 22 · 6 first-author · 13 since 2021Databases, data management, data science and information retrieval · 4 · 3 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Hypergraph cooperative coloring
Xuqing Bai, Bi Li 0004, Weichan Liu, Xin Zhang 0017 |
Discret. Appl. Math. | 4 |
| 2026 | Odd coloring of 2-boundary planar graphs and beyond
Weichan Liu, Mengke Qi, Xin Zhang 0017 |
Discret. Appl. Math. | 3 |
| 2026 | Fast algorithm for S -packing coloring of Halin graphs
Xin Zhang 0017, Dezhi Zou |
Discret. Appl. Math. | 1 |
| 2025 | On proper conflict-free colorings of IC-planar graphs
Xin Zhang 0017 |
Discret. Appl. Math. | 2 |
| 2025 | Proper conflict-free coloring of Mycielskians with fast algorithms
Xin Zhang 0017 |
Theor. Comput. Sci. | 2 |
| 2024 | Improper odd coloring of IC-planar graphs
Xin Zhang 0017 |
Discret. Appl. Math. | 2 |
| 2022 | An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs
Bei Niu, Xin Zhang 0017 |
AAIM | 2 |
| 2022 | Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
Xin Zhang 0017, Bei Niu, Bi Li 0004 |
Theor. Comput. Sci. | 1 |
| 2021 | Incidence coloring of Mycielskians with fast algorithm
Huimin Bi, Xin Zhang 0017 |
Theor. Comput. Sci. | 2 |
| 2021 | h-extra r-component connectivity of interconnection networks with application to hypercubes
Bi Li 0004, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang 0017, Qiang Zhu 0003 |
Theor. Comput. Sci. | 5 |
| 2021 | Equitable list tree-coloring of bounded treewidth graphs
Xin Zhang 0017 |
Theor. Comput. Sci. | 2 |
| 2021 | Hardness and algorithms of equitable tree-coloring problem in chordal graphs
Bei Niu, Bi Li 0004, Xin Zhang 0017 |
Theor. Comput. Sci. | 3 |
| 2021 | Theoretical aspects of equitable partition of networks into sparse modules
Xin Zhang 0017 |
Theor. Comput. Sci. | 2 |
| 2020 | Total Coloring of Outer-1-planar Graphs: The Cold Case
Weichan Liu, Xin Zhang 0017 |
AAIM | 2 |
| 2020 | Complexity of Tree-Coloring Interval Graphs Equitably
Bei Niu, Bi Li 0004, Xin Zhang 0017 |
AAIM | 3 |
| 2018 | Light paths and edges in families of outer-1-planar graphs
Xin Zhang 0017, Jingfen Lan, Bi Li 0004, Qiang Zhu 0003 |
Inf. Process. Lett. | 1 |
| 2015 | Equitable colorings of Cartesian products with balanced complete multipartite graphs
Zhidan Yan, Wei Wang 0052, Xin Zhang 0017 |
Discret. Appl. Math. | 3 |
| 2014 | On r-equitable chromatic threshold of Kronecker products of complete graphs
Wei Wang 0052, Zhidan Yan, Xin Zhang 0017 |
Discret. Appl. Math. | 3 |
| 2012 | On r-acyclic edge colorings of planar graphs
Xin Zhang 0017, Guanghui Wang 0002, Guizhen Liu |
Discret. Appl. Math. | 1 |
| 2012 | On edge colorings of 1-planar graphs without adjacent triangles
Xin Zhang 0017, Guizhen Liu |
Inf. Process. Lett. | 1 |
| 2011 | A note on relaxed equitable coloring of graphs
Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jian-Liang Wu 0001, Xin Zhang 0017 |
Inf. Process. Lett. | 6 |
| 2011 | On edge colorings of 1-planar graphs
Xin Zhang 0017, Jian-Liang Wu 0001 |
Inf. Process. Lett. | 1 |