A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations. - Bo-Ting Yang; Yin-Feng Xu; Zhao-yong You (ISAAC, 1994)

A Better Subgraph of the Minimum Weight Triangulation. - Bo-Ting Yang (Inf. Process. Lett., 1995)

The Heuristics for the Constrained Multicast Routing. - Zongben Xu; Bo-Ting Yang (ASIAN, 1996)

Maximum Weight Triangulation and Its Application on Graph Drawing. - Cao An Wang; Francis Y. L. Chin; Bo-Ting Yang (COCOON, 1998)

A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. - Cao An Wang; Bo-Ting Yang (WADS, 1999)

Maximum Weight Triangulation and Graph Drawing. - Cao An Wang; Francis Y. L. Chin; Bo-Ting Yang (Inf. Process. Lett., 1999)

Tetrahedralization of Two Nested Convex Polyhedra. - Cao An Wang; Bo-Ting Yang (COCOON, 2000)

Optimal Tetrahedralizations of Some Convex Polyhedra. - Cao An Wang; Boting Yang (EuroCG, 2000)

The class Steiner minimal tree problem: a lower bound and test problem generation. - Bo-Ting Yang; Paul Gillard (Acta Informatica, 2000)

Triangulations without minimum-weight drawing. - Cao An Wang; Francis Y. L. Chin; Boting Yang (Inf. Process. Lett., 2000)

On Some Polyhedra Covering Problems. - Cao An Wang; Bo-Ting Yang; Binhai Zhu (J. Comb. Optim., 2000)

A lower bound for beta-skeleton belonging to minimum weight triangulations. - Cao An Wang; Boting Yang (Comput. Geom., 2001)

Algorithms and Complexity for Tetrahedralization Detections. - Boting Yang; Cao An Wang; Francis Y. L. Chin (ISAAC, 2002)

Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2. - Brett Stevens; Paul Buskell; Paule Ecimovic; Cristian Ivanescu; Abid Muslim Malik; Anamaria Savu; Tzvetalin S. Vassilev; Helen Verrall; Boting Yang; Zhiduo Zhao (Discret. Math., 2002)

Detecting tetrahedralizations of a set of line segments. - Boting Yang; Cao An Wang (J. Algorithms, 2004)

Minimal Tetrahedralizations of a Class of Polyhedra. - Boting Yang; Cao An Wang (J. Comb. Optim., 2004)

Integer Programming Methods for Several Optimization Problems in Graph Theory. - Jamiru Luttamaguzi; Michael J. Pelsmajer; Zhizhang Shen; Boting Yang (CATA, 2005)

On the Computation and Chromatic Number of Colored Domino Tilings. - Chris Worman; Boting Yang (CCCG, 2005)

On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. - Chris Worman; Boting Yang (ISAAC, 2005)

The Computational Complexity of Inference Using Rough Set Flow Graphs. - Cory J. Butz; Wen Yan; Boting Yang (RSFDGrC (1), 2005)

An Efficient Algorithm for Inference in Rough Set Flow Graphs. - Cory J. Butz; Wen Yan; Boting Yang (Trans. Rough Sets, 2006)

Digraph Strong Searching: Monotonicity and Complexity. - Boting Yang; Yi Cao (AAIM, 2007)

Arc Searching Digraphs Without Jumping. - Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang (COCOA, 2007)

Searching Cycle-Disjoint Graphs. - Boting Yang; Runtao Zhang; Yi Cao (COCOA, 2007)

Non-breaking Similarity of Genomes with Gene Repetitions. - Zhixiang Chen 001; Bin Fu; Jinhui Xu 001; Bo-Ting Yang; Zhiyu Zhao; Binhai Zhu (CPM, 2007)

Lower Bounds on Edge Searching. - Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang (ESCAPE, 2007)

Directed Searching Digraphs: Monotonicity and Complexity. - Boting Yang; Yi Cao (TAMC, 2007)

On the Tileability of Polygons with Colored Dominoes. - Chris Worman; Boting Yang (Discret. Math. Theor. Comput. Sci., 2007)

Strong-mixed searching and pathwidth. - Boting Yang (J. Comb. Optim., 2007)

Monotonicity of strong searching on digraphs. - Boting Yang; Yi Cao (J. Comb. Optim., 2007)

On the Fast Searching Problem. - Danny Dyer; Boting Yang; Öznur Yasar (AAIM, 2008)

On the Monotonicity of Weak Searching. - Boting Yang; Yi Cao (COCOON, 2008)

Searching Trees with Sources and Targets. - Chris Worman; Boting Yang (FAW, 2008)

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. - Sergey Bereg; Minghui Jiang 001; Wencheng Wang 001; Boting Yang; Binhai Zhu (LATIN, 2008)

Digraph searching, directed vertex separation and directed pathwidth. - Boting Yang; Yi Cao (Discret. Appl. Math., 2008)

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. - Zhixiang Chen 001; Bin Fu; Robert T. Schweller; Boting Yang; Zhiyu Zhao; Binhai Zhu (J. Comput. Biol., 2008)

Time constrained graph searching. - Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang (Theor. Comput. Sci., 2008)

Monotonicity in digraph search problems. - Boting Yang; Yi Cao (Theor. Comput. Sci., 2008)

Lower Bounds on Fast Searching. - Donald Stanley; Boting Yang (ISAAC, 2009)

Sweeping graphs with large clique number. - Boting Yang; Danny Dyer; Brian Alspach (Discret. Math., 2009)

Standard directed search strategies and their applications. - Boting Yang; Yi Cao (J. Comb. Optim., 2009)

Preface. - Boting Yang; Cao An Wang (Theor. Comput. Sci., 2009)

Fast Edge-Searching and Related Problems. - Boting Yang (COCOA (2), 2010)

Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. - Bin Fu; Haitao Jiang; Boting Yang; Binhai Zhu (COCOA, 2011)

Fast searching games on graphs. - Donald Stanley; Boting Yang (J. Comb. Optim., 2011)

Parameterized complexity of even/odd subgraph problems. - Leizhen Cai; Boting Yang (J. Discrete Algorithms, 2011)

On the red/blue spanning tree problem. - Sergey Bereg; Minghui Jiang 001; Boting Yang; Binhai Zhu (Theor. Comput. Sci., 2011)

Fast edge searching and fast searching on graphs. - Boting Yang (Theor. Comput. Sci., 2011)

Sauer's Bound for a Notion of Teaching Complexity. - Rahim Samei; Pavel Semukhin; Boting Yang; Sandra Zilles (ALT, 2012)

Fast-Mixed Searching on Graphs. - Boting Yang (COCOA, 2012)

An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management. - Shuo Wang 002; Guo H. Huang; Boting Yang (Environ. Model. Softw., 2012)

Zero-Visibility Cops and Robber Game on a Graph. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (FAW-AAIM, 2013)

Euclidean chains and their shortcuts. - Boting Yang (Theor. Comput. Sci., 2013)

Fast-mixed searching and related problems on graphs. - Boting Yang (Theor. Comput. Sci., 2013)

Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes. - Rahim Samei; Boting Yang; Sandra Zilles (ALT, 2014)

The Complexity of the Positive Semidefinite Zero Forcing. - Shaun M. Fallat; Karen Meagher; Boting Yang (COCOA, 2014)

Algorithms for Cut Problems on Trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (COCOA, 2014)

Sample Compression for Multi-label Concept Classes. - Rahim Samei; Pavel Semukhin; Boting Yang; Sandra Zilles (COLT, 2014)

A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. - David G. Kirkpatrick; Boting Yang; Sandra Zilles (Int. J. Comput. Geom. Appl., 2014)

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. - Zhixiang Chen 001; Bin Fu; Randy Goebel; Guohui Lin; Weitian Tong; Jinhui Xu 001; Boting Yang; Zhiyu Zhao; Binhai Zhu (Theor. Comput. Sci., 2014)

Algebraic methods proving Sauer's bound for teaching complexity. - Rahim Samei; Pavel Semukhin; Boting Yang; Sandra Zilles (Theor. Comput. Sci., 2014)

Algorithmic Aspects of the Positive Semidefinite Zero Forcing. - Boting Yang (CTW, 2015)

Positive Semidefinite Zero Forcing: Complexity and Lower Bounds. - Boting Yang (WADS, 2015)

Zero-visibility cops and robber and the pathwidth of a graph. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (J. Comb. Optim., 2015)

The complexity of zero-visibility cops and robber. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (Theor. Comput. Sci., 2015)

Preface. - Qian-Ping Gu; Pavol Hell; Boting Yang (Theor. Comput. Sci., 2015)

Improved parameterized and exact algorithms for cut problems on trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (Theor. Comput. Sci., 2015)

The optimal capture time of the one-cop-moves game. - Boting Yang; William Hamilton (Theor. Comput. Sci., 2015)

Fast Searching on Complete k-partite Graphs. - Yuan Xue; Boting Yang; Farong Zhong; Sandra Zilles (COCOA, 2016)

Genomic Scaffold Filling Revisited. - Haitao Jiang; Chenglin Fan; Boting Yang; Farong Zhong; Daming Zhu; Binhai Zhu (CPM, 2016)

Positive Zero Forcing and Edge Clique Coverings. - Shaun M. Fallat; Karen Meagher; Abolghasem Soltani; Boting Yang (FAW, 2016)

On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices. - Ji-Teng Jia; Boting Yang; Sumei Li (Comput. Math. Appl., 2016)

The Cop Number of the One-Cop-Moves Game on Planar Graphs. - Ziyuan Gao; Boting Yang (COCOA (2), 2017)

A New Lower Bound for Positive Zero Forcing. - Boting Yang (FAW, 2017)

Fast Searching on Cartesian Products of Graphs. - Yuan Xue; Boting Yang (TAMC, 2017)

The fast search number of a Cartesian product of graphs. - Yuan Xue; Boting Yang (Discret. Appl. Math., 2017)

Lower bounds for positive semidefinite zero forcing and their applications. - Boting Yang (J. Comb. Optim., 2017)

The Fast Search Number of a Complete k-Partite Graph. - Yuan Xue; Boting Yang; Farong Zhong; Sandra Zilles (Algorithmica, 2018)

Infection in hypergraphs. - Ryan Bergen; Shaun M. Fallat; Adam Gorr; Ferdinand Ihringer; Karen Meagher; Alison Purdy; Boting Yang; Guanglong Yu (Discret. Appl. Math., 2018)

Compressed cliques graphs, clique coverings and positive zero forcing. - Shaun M. Fallat; Karen Meagher; Abolghasem Soltani; Boting Yang (Theor. Comput. Sci., 2018)

New Results on the Zero-Visibility Cops and Robber Game. - Yuan Xue; Boting Yang; Sandra Zilles (AAIM, 2019)

The One-Cop-Moves Game on Graphs of Small Treewidth. - Lusheng Wang 001; Boting Yang (COCOA, 2019)

A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. - Yuan Xue; Boting Yang; Farong Zhong; Sandra Zilles (IWOCA, 2019)

Search Numbers in Networks with Special Topologies. - Boting Yang; Runtao Zhang; Yi Cao; Farong Zhong (J. Interconnect. Networks, 2019)

Positive semidefinite zero forcing numbers of two classes of graphs. - Lusheng Wang 001; Boting Yang (Theor. Comput. Sci., 2019)

Computing the One-Visibility Copnumber of Trees. - Boting Yang; Tanzina Akter (AAIM, 2020)

Properties of a q-Analogue of Zero Forcing. - Steve Butler; Craig Erickson; Shaun M. Fallat; H. Tracy Hall; Brenda Kroschel; Jephian C.-H. Lin; Bryan L. Shader; Nathan Warnberg; Boting Yang (Graphs Comb., 2020)

Correction to: Properties of a q-Analogue of Zero Forcing. - Steve Butler; Craig Erickson; Shaun M. Fallat; H. Tracy Hall; Brenda Kroschel; Jephian C.-H. Lin; Bryan L. Shader; Nathan Warnberg; Boting Yang (Graphs Comb., 2020)

The one-cop-moves game on graphs with some special structures. - Lusheng Wang 001; Boting Yang (Theor. Comput. Sci., 2020)

Aggregating Preferences Represented by Conditional Preference Networks. - Abu Mohammad Hammad Ali; Howard J. Hamilton; Elizabeth Rayner; Boting Yang; Sandra Zilles (ADT, 2021)

Computing the One-Visibility Cop-Win Strategies for Trees. - Boting Yang (COCOA, 2021)

The one-cop-moves game on planar graphs. - Ziyuan Gao; Boting Yang (J. Comb. Optim., 2021)

One-visibility cops and robber on trees. - Boting Yang; Tanzina Akter (Theor. Comput. Sci., 2021)

Fast Searching on k-Combinable Graphs. - Yuan Xue; Boting Yang; Sandra Zilles (AAIM, 2022)

Four-searchable biconnected outerplanar graphs. - Öznur Yasar Diner; Danny Dyer; Boting Yang (Discret. Appl. Math., 2022)

A simple method for proving lower bounds in the zero-visibility cops and robber game. - Yuan Xue; Boting Yang; Sandra Zilles (J. Comb. Optim., 2022)

One-visibility cops and robber on trees: Optimal cop-win strategies. - Boting Yang (Theor. Comput. Sci., 2022)

Zero-Visibility Cops and Robber Game on Cage Graph. - Xiaoli Sun; Farong Zhong; Boting Yang (COCOA (2), 2023)

Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. - Kangyi Tian; Mingyu Xiao 001; Boting Yang (COCOON (1), 2023)

Constrained Graph Searching on Trees. - Lusheng Wang 001; Boting Yang; Zhaohui Zhan (IJTCS-FAW, 2023)

Fast searching on cactus graphs. - Yuan Xue; Boting Yang; Sandra Zilles; Lusheng Wang 001 (J. Comb. Optim., 2023)

Approximation Algorithms for Preference Aggregation Using CP-Nets. - Abu Mohammad Hammad Ali; Boting Yang; Sandra Zilles (AAAI, 2024)

Deduction, Constrained Zero Forcing, and Constrained Searching. - Andrea Burgess; Danny Dyer; Kerry Ojakian; Lusheng Wang 001; Mingyu Xiao 001; Boting Yang (CoRR, 2024)

Edge searching and fast searching with constraints. - Lusheng Wang 001; Boting Yang (Theor. Comput. Sci., 2024)

The zero-visibility cops and robber game on graph products. - Yuan Xue; Boting Yang; Sandra Zilles (Theor. Comput. Sci., 2024)

Approximation Ratio for Preference Aggregation Using Tree CP-Nets. - Abu Mohammad Hammad Ali; Daniel Ogundare; Boting Yang; Sandra Zilles (AAMAS, 2025)