I’m Yuhang Bai, a PhD Candidate at NWPU. My research interests include graph theory and theoretical computer science. I am also interested in random graph theory.
Email: yuhang.bai66@gmail.com
📄 Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz. Approximating maximum-size properly colored forests. arXiv preprint arXiv:2402.00834.
📄 Yuhang Bai, Zhiwei Guo, Shenggui Zhang, Yandong Bai. Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. Journal of Combinatorial Optimization 45 (2), 73.
📄 Yanni Dong, Hajo Broersma, Yuhang Bai, Shenggui Zhang. The complexity of spanning tree problems involving graphical indices. Discrete Applied Mathematics 347, 143-154.
📄 Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz. Approximating maximum-size properly colored forests. In 32nd Annual European Symposium on Algorithms (ESA 2024) 308, 14:1-14:18.