| 2024 | AAAI | Approximation Algorithms for Preference Aggregation Using CP-Nets. | Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles |
| 2023 | COCOA | Zero-Visibility Cops and Robber Game on Cage Graph. | Xiaoli Sun, Farong Zhong, Boting Yang |
| 2023 | COCOON | Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. | Kangyi Tian, Mingyu Xiao, Boting Yang |
| 2023 | FAW | Constrained Graph Searching on Trees. | Lusheng Wang, Boting Yang, Zhaohui Zhan |
| 2022 | AAIM | Fast Searching on k-Combinable Graphs. | Yuan Xue, Boting Yang, Sandra Zilles |
| 2021 | COCOA | Computing the One-Visibility Cop-Win Strategies for Trees. | Boting Yang |
| 2020 | AAIM | Computing the One-Visibility Copnumber of Trees. | Boting Yang, Tanzina Akter |
| 2019 | AAIM | New Results on the Zero-Visibility Cops and Robber Game. | Yuan Xue, Boting Yang, Sandra Zilles |
| 2019 | COCOA | The One-Cop-Moves Game on Graphs of Small Treewidth. | Lusheng Wang, Boting Yang |
| 2019 | IWOCA | A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. | Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles |
| 2017 | COCOA | The Cop Number of the One-Cop-Moves Game on Planar Graphs. | Ziyuan Gao, Boting Yang |
| 2017 | FAW | A New Lower Bound for Positive Zero Forcing. | Boting Yang |
| 2017 | TAMC | Fast Searching on Cartesian Products of Graphs. | Yuan Xue, Boting Yang |
| 2016 | COCOA | Fast Searching on Complete k-partite Graphs. | Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles |
| 2016 | CPM | Genomic Scaffold Filling Revisited. | Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu |
| 2016 | FAW | Positive Zero Forcing and Edge Clique Coverings. | Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang |
| 2015 | WADS | Positive Semidefinite Zero Forcing: Complexity and Lower Bounds. | Boting Yang |
| 2014 | ALT | Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes. | Rahim Samei, Boting Yang, Sandra Zilles |
| 2014 | COCOA | The Complexity of the Positive Semidefinite Zero Forcing. | Shaun M. Fallat, Karen Meagher, Boting Yang |
| 2014 | COCOA | Algorithms for Cut Problems on Trees. | Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu |
| 2014 | COLT | Sample Compression for Multi-label Concept Classes. | Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles |
| 2014 | FAW | The Complexity of Zero-Visibility Cops and Robber. | Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang |
| 2013 | AAIM | Zero-Visibility Cops and Robber Game on a Graph. | Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang |
| 2012 | ALT | Sauer's Bound for a Notion of Teaching Complexity. | Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles |
| 2012 | COCOA | Fast-Mixed Searching on Graphs. | Boting Yang |
| 2011 | COCOA | Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. | Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu |
| 2011 | COCOA | Euclidean Chains and Their Shortcuts. | Boting Yang |
| 2010 | CIAC | Parameterized Complexity of Even/Odd Subgraph Problems. | Leizhen Cai, Boting Yang |
| 2010 | COCOA | Fast Edge-Searching and Related Problems. | Boting Yang |
| 2009 | ISAAC | Lower Bounds on Fast Searching. | Donald Stanley, Boting Yang |
| 2009 | TAMC | On the Red/Blue Spanning Tree Problem. | Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu |
| 2008 | AAIM | On the Fast Searching Problem. | Danny Dyer, Boting Yang, znur Yasar |
| 2008 | APBC | Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. | Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu |
| 2008 | COCOON | On the Monotonicity of Weak Searching. | Boting Yang, Yi Cao |
| 2008 | FAW | Searching Trees with Sources and Targets. | Chris Worman, Boting Yang |
| 2008 | LATIN | Simplifying 3D Polygonal Chains Under the Discrete Frchet Distance. | Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu |
| 2007 | AAIM | Digraph Strong Searching: Monotonicity and Complexity. | Boting Yang, Yi Cao |
| 2007 | COCOA | Arc Searching Digraphs Without Jumping. | Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang |
| 2007 | COCOA | Searching Cycle-Disjoint Graphs. | Boting Yang, Runtao Zhang, Yi Cao |
| 2007 | TAMC | Directed Searching Digraphs: Monotonicity and Complexity. | Boting Yang, Yi Cao |
| 2005 | CATA | Integer Programming Methods for Several Optimization Problems in Graph Theory. | Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang |
| 2005 | ISAAC | On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. | Chris Worman, Boting Yang |
| 2004 | ISAAC | Sweeping Graphs with Large Clique Number. | Boting Yang, Danny Dyer, Brian Alspach |
| 2002 | ISAAC | Algorithms and Complexity for Tetrahedralization Detections. | Boting Yang, Cao An Wang, Francis Y. L. Chin |