Kaiyang Lan

dblp:337/7172 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0002-2739-9053ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 3 first-author · 5 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2025 The chromatic number of odd-hole-free graphs
Kaiyang Lan, Xinheng Lin
Discret. Appl. Math.2
2024 TDCL: Dense Semantic Contrastive Learning for Vision-Language Tracking
abstract
Traditional single-object tracking tasks are undergoing a new wave of transformation, especially with the emergence of the lack of semantics, which has led to the rise of the vision-language tracking task. However, previous approaches that combine the visual tracker with natural language descriptions tend to rely on a global representation of the text description, considering less about the fine-grained connections between the text description and the visual appearance. This paper proposes to utilize a bi-directional cross-attention module to capture the connections between language and visual features, which are further projected as dense semantic representations for alignment. In order to keep the semantic consistency between the search region and the coupled natural language and align the fused feature, this paper proposes a novel dense semantic contrastive learning loss to bridge the semantic gap between text and visual modalities and align them in a dense form. The proposed framework achieves promising results in tracking datasets that contain natural language descriptions, such as TNL2K, and OTB99-LANG. Our approach provides a novel solution for representing and aligning cross-modal information for the single object tracking task and may inspire further research in this field.
Xiankang He, Kaiyang Lan, Dongyan Guo
ECAI3
2024 Coloring {P2∪P3,house}-free graphs with Δ-1 colors
Kaiyang Lan
Discret. Appl. Math.2
2024 Borodin-Kostochka conjecture holds for K1,3¯-free graphs
abstract
The Borodin–Kostochka conjecture says that for a graph G , if Δ ( G ) ≥ 9 , then χ ( G ) ≤ max { Δ ( G ) − 1 , ω ( G ) } . Cranston and Rabern in [SIAM J. Discrete. Math. 27 (2013) 534–549] proved the conjecture holding for K 1 , 3 -free graphs. In this paper, we prove that the conjecture holds for K 1 , 3 ¯ -free graphs, where K 1 , 3 ¯ denotes the complement of K 1 , 3 .
Kaiyang Lan, Xinheng Lin
Discret. Appl. Math.1
2023 A note on a conjecture of Wu, Xu and Xu
Kaiyang Lan
Discret. Appl. Math.1
2023 Some remarks on graphs with no induced subdivision of K4
Kaiyang Lan
Discret. Appl. Math.1