Boting Yang

According to our database, Boting Yang authored at least 102 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Approximation Algorithms for Preference Aggregation Using CP-Nets.

Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Fast searching on cactus graphs.

Yuan Xue, Boting Yang, Sandra Zilles, Lusheng Wang

J. Comb. Optim., April, 2023

Constrained Graph Searching on Trees.

Lusheng Wang, Boting Yang, Zhaohui Zhan

Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs.

Kangyi Tian, Mingyu Xiao, Boting Yang

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Zero-Visibility Cops and Robber Game on Cage Graph.

Xiaoli Sun, Farong Zhong, Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

One-visibility cops and robber on trees: Optimal cop-win strategies.

Boting Yang

Theor. Comput. Sci., 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

Four-searchable biconnected outerplanar graphs.

Öznur Yasar Diner, Danny Dyer, Boting Yang

Discret. Appl. Math., 2022

Fast Searching on k-Combinable Graphs.

Yuan Xue, Boting Yang, Sandra Zilles

Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021

One-visibility cops and robber on trees.

Boting Yang, Tanzina Akter

Theor. Comput. Sci., 2021

The one-cop-moves game on planar graphs.

Ziyuan Gao, Boting Yang

J. Comb. Optim., 2021

Computing the One-Visibility Cop-Win Strategies for Trees.

Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2021

Aggregating Preferences Represented by Conditional Preference Networks.

Abu Mohammad Hammad Ali, Howard J. Hamilton, Elizabeth Rayner, Boting Yang, Sandra Zilles

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020

The one-cop-moves game on graphs with some special structures.

Lusheng Wang, Boting Yang

Theor. Comput. Sci., 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

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

Computing the One-Visibility Copnumber of Trees.

Boting Yang, Tanzina Akter

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Positive semidefinite zero forcing numbers of two classes of graphs.

Lusheng Wang, Boting Yang

Theor. Comput. Sci., 2019

Search Numbers in Networks with Special Topologies.

Boting Yang, Runtao Zhang, Yi Cao, Farong Zhong

J. Interconnect. Networks, 2019

A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.

Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

The One-Cop-Moves Game on Graphs of Small Treewidth.

Lusheng Wang, Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2019

New Results on the Zero-Visibility Cops and Robber Game.

Yuan Xue, Boting Yang, Sandra Zilles

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Compressed cliques graphs, clique coverings and positive zero forcing.

Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang

Theor. Comput. Sci., 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

The Fast Search Number of a Complete k-Partite Graph.

Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles

Algorithmica, 2018

2017

Lower bounds for positive semidefinite zero forcing and their applications.

Boting Yang

J. Comb. Optim., 2017

The fast search number of a Cartesian product of graphs.

Yuan Xue, Boting Yang

Discret. Appl. Math., 2017

Fast Searching on Cartesian Products of Graphs.

Yuan Xue, Boting Yang

Proceedings of the Theory and Applications of Models of Computation, 2017

A New Lower Bound for Positive Zero Forcing.

Boting Yang

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

The Cop Number of the One-Cop-Moves Game on Planar Graphs.

Ziyuan Gao, Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2017

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

Positive Zero Forcing and Edge Clique Coverings.

Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling Revisited.

Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Fast Searching on Complete k-partite Graphs.

Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

The optimal capture time of the one-cop-moves game.

Boting Yang, William Hamilton

Theor. Comput. Sci., 2015

Improved parameterized and exact 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

Theor. Comput. Sci., 2015

Preface.

Qian-Ping Gu, Pavol Hell, Boting Yang

Theor. Comput. Sci., 2015

The complexity of zero-visibility cops and robber.

Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang

Theor. Comput. Sci., 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

Positive Semidefinite Zero Forcing: Complexity and Lower Bounds.

Boting Yang

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Algorithmic Aspects of the Positive Semidefinite Zero Forcing.

Boting Yang

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Algebraic methods proving Sauer's bound for teaching complexity.

Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles

Theor. Comput. Sci., 2014

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.

Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu

Theor. Comput. Sci., 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

Sample Compression for Multi-label Concept Classes.

Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles

Proceedings of The 27th Conference on Learning Theory, 2014

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

Proceedings of the Combinatorial Optimization and Applications, 2014

The Complexity of the Positive Semidefinite Zero Forcing.

Shaun M. Fallat, Karen Meagher, Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2014

Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes.

Rahim Samei, Boting Yang, Sandra Zilles

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013

Fast-mixed searching and related problems on graphs.

Boting Yang

Theor. Comput. Sci., 2013

Euclidean chains and their shortcuts.

Boting Yang

Theor. Comput. Sci., 2013

Zero-Visibility Cops and Robber Game on a Graph.

Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management.

Shuo Wang, Guo H. Huang, Boting Yang

Environ. Model. Softw., 2012

Fast-Mixed Searching on Graphs.

Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2012

Sauer's Bound for a Notion of Teaching Complexity.

Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Fast edge searching and fast searching on graphs.

Boting Yang

Theor. Comput. Sci., 2011

On the red/blue spanning tree problem.

Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu

Theor. Comput. Sci., 2011

Parameterized complexity of even/odd subgraph problems.

Leizhen Cai, Boting Yang

J. Discrete Algorithms, 2011

Fast searching games on graphs.

Donald Stanley, Boting Yang

J. Comb. Optim., 2011

Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem.

Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Fast Edge-Searching and Related Problems.

Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Preface.

Boting Yang, Cao An Wang

Theor. Comput. Sci., 2009

Standard directed search strategies and their applications.

Boting Yang, Yi Cao

J. Comb. Optim., 2009

Sweeping graphs with large clique number.

Boting Yang, Danny Dyer, Brian Alspach

Discret. Math., 2009

Lower Bounds on Fast Searching.

Donald Stanley, Boting Yang

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Monotonicity in digraph search problems.

Boting Yang, Yi Cao

Theor. Comput. Sci., 2008

Time constrained graph searching.

Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang

Theor. Comput. Sci., 2008

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

J. Comput. Biol., 2008

Digraph searching, directed vertex separation and directed pathwidth.

Boting Yang, Yi Cao

Discret. Appl. Math., 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.

Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Searching Trees with Sources and Targets.

Chris Worman, Boting Yang

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

On the Monotonicity of Weak Searching.

Boting Yang, Yi Cao

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

On the Fast Searching Problem.

Danny Dyer, Boting Yang, Öznur Yasar

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Monotonicity of strong searching on digraphs.

Boting Yang, Yi Cao

J. Comb. Optim., 2007

Strong-mixed searching and pathwidth.

Boting Yang

J. Comb. Optim., 2007

On the Tileability of Polygons with Colored Dominoes.

Chris Worman, Boting Yang

Discret. Math. Theor. Comput. Sci., 2007

Directed Searching Digraphs: Monotonicity and Complexity.

Boting Yang, Yi Cao

Proceedings of the Theory and Applications of Models of Computation, 2007

Lower Bounds on Edge Searching.

Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang

Proceedings of the Combinatorics, 2007

Non-breaking Similarity of Genomes with Gene Repetitions.

Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Searching Cycle-Disjoint Graphs.

Boting Yang, Runtao Zhang, Yi Cao

Proceedings of the Combinatorial Optimization and Applications, 2007

Arc Searching Digraphs Without Jumping.

Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang

Proceedings of the Combinatorial Optimization and Applications, 2007

Digraph Strong Searching: Monotonicity and Complexity.

Boting Yang, Yi Cao

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

An Efficient Algorithm for Inference in Rough Set Flow Graphs.

Cory J. Butz, Wen Yan, Boting Yang

Trans. Rough Sets, 2006

2005

The Computational Complexity of Inference Using Rough Set Flow Graphs.

Cory J. Butz, Wen Yan, Boting Yang

Proceedings of the Rough Sets, 2005

On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons.

Chris Worman, Boting Yang

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On the Computation and Chromatic Number of Colored Domino Tilings.

Chris Worman, Boting Yang

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Integer Programming Methods for Several Optimization Problems in Graph Theory.

Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang

Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2004

Minimal Tetrahedralizations of a Class of Polyhedra.

Boting Yang, Cao An Wang

J. Comb. Optim., 2004

Detecting tetrahedralizations of a set of line segments.

Boting Yang, Cao An Wang

J. Algorithms, 2004

2002

Solution of an outstanding conjecture: the non-existence of universal cycles with <i>k</i>=<i>n</i>-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

Algorithms and Complexity for Tetrahedralization Detections.

Boting Yang, Cao An Wang, Francis Y. L. Chin

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

A lower bound for beta-skeleton belonging to minimum weight triangulations.

Cao An Wang, Boting Yang

Comput. Geom., 2001

2000

On Some Polyhedra Covering Problems.

Cao An Wang, Bo-Ting Yang, Binhai Zhu

J. Comb. Optim., 2000

Triangulations without minimum-weight drawing.

Cao An Wang, Francis Y. L. Chin, Boting Yang

Inf. Process. Lett., 2000

The class Steiner minimal tree problem: a lower bound and test problem generation.

Bo-Ting Yang, Paul Gillard

Acta Informatica, 2000

Optimal Tetrahedralizations of Some Convex Polyhedra.

Cao An Wang, Boting Yang

EuroCG, 2000

Tetrahedralization of Two Nested Convex Polyhedra.

Cao An Wang, Bo-Ting Yang

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Maximum Weight Triangulation and Graph Drawing.

Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang

Inf. Process. Lett., 1999

A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.

Cao An Wang, Bo-Ting Yang

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998

Maximum Weight Triangulation and Its Application on Graph Drawing.

Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996

The Heuristics for the Constrained Multicast Routing.

Zongben Xu, Bo-Ting Yang

Proceedings of the Concurrency and Parallelism, 1996

1995

A Better Subgraph of the Minimum Weight Triangulation.

Bo-Ting Yang

Inf. Process. Lett., 1995

1994

A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations.

Bo-Ting Yang, Yin-Feng Xu, Zhao-yong You

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994