3 papers
math.CO2026
Cop number of -free graphs without a claw or a fork
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
In 2019, Liu proved that the cop number of any -free graph is at most . In 2026, Clow and Meger improved and generalized the result of Liu by showing that every c…
cs.AI2026
Drive-KD: Multi-Teacher Distillation for VLMs in Autonomous Driving
Weitong Lian, Zecong Tang, Haoran Li +12
Autonomous driving is an important and safety-critical task, and recent advances in LLMs/VLMs have opened new possibilities for reasoning and planning in this domain. However, larg…
cs.AI2026
Drive-P2D: A Progressive Perception-to-Decision Benchmark for VLMs in Autonomous Driving
Zecong Tang, Zixu Wang, Yifei Wang +10
Autonomous driving requires reliable perception and safe decision-making in complex scenarios. Recent vision-language models (VLMs) demonstrate reasoning and generalization abiliti…