default search action
Boting Yang
Bo-Ting Yang
Person information
- affiliation: University of Regina, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j54]Lusheng Wang, Boting Yang:
Edge searching and fast searching with constraints. Theor. Comput. Sci. 991: 114416 (2024) - [j53]Yuan Xue, Boting Yang, Sandra Zilles:
The zero-visibility cops and robber game on graph products. Theor. Comput. Sci. 1007: 114676 (2024) - [c58]Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles:
Approximation Algorithms for Preference Aggregation Using CP-Nets. AAAI 2024: 10433-10441 - 2023
- [j52]Yuan Xue, Boting Yang
, Sandra Zilles, Lusheng Wang:
Fast searching on cactus graphs. J. Comb. Optim. 45(3): 84 (2023) - [c57]Xiaoli Sun, Farong Zhong, Boting Yang:
Zero-Visibility Cops and Robber Game on Cage Graph. COCOA (2) 2023: 295-309 - [c56]Kangyi Tian, Mingyu Xiao
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. COCOON (1) 2023: 182-194 - [c55]Lusheng Wang, Boting Yang, Zhaohui Zhan
Constrained Graph Searching on Trees. IJTCS-FAW 2023: 239-251 - [i5]Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles:
Approximation Algorithms for Preference Aggregation Using CP-Nets. CoRR abs/2312.09162 (2023) - 2022
- [j51]Öznur Yasar Diner
Four-searchable biconnected outerplanar graphs. Discret. Appl. Math. 306: 70-82 (2022) - [j50]Yuan Xue, Boting Yang
A simple method for proving lower bounds in the zero-visibility cops and robber game. J. Comb. Optim. 43(5): 1545-1570 (2022) - [j49]Boting Yang:
One-visibility cops and robber on trees: Optimal cop-win strategies. Theor. Comput. Sci. 928: 27-47 (2022) - [c54]Yuan Xue, Boting Yang, Sandra Zilles:
Fast Searching on k-Combinable Graphs. AAIM 2022: 394-405 - 2021
- [j48]Ziyuan Gao, Boting Yang
The one-cop-moves game on planar graphs. J. Comb. Optim. 42(3): 442-475 (2021) - [j47]Boting Yang, Tanzina Akter:
One-visibility cops and robber on trees. Theor. Comput. Sci. 886: 139-156 (2021) - [c53]Abu Mohammad Hammad Ali, Howard J. Hamilton, Elizabeth Rayner, Boting Yang, Sandra Zilles:
Aggregating Preferences Represented by Conditional Preference Networks. ADT 2021: 3-18 - [c52]Boting Yang:
Computing the One-Visibility Cop-Win Strategies for Trees. COCOA 2021: 125-139 - 2020
- [j46]Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin
Properties of a q-Analogue of Zero Forcing. Graphs Comb. 36(5): 1401-1419 (2020) - [j45]Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin
Correction to: Properties of a q-Analogue of Zero Forcing. Graphs Comb. 36(5): 1421-1422 (2020) - [j44]Lusheng Wang, Boting Yang:
The one-cop-moves game on graphs with some special structures. Theor. Comput. Sci. 847: 17-26 (2020) - [c51]Boting Yang
Computing the One-Visibility Copnumber of Trees. AAIM 2020: 411-423
2010 – 2019
- 2019
- [j43]Boting Yang, Runtao Zhang, Yi Cao, Farong Zhong:
Search Numbers in Networks with Special Topologies. J. Interconnect. Networks 19(1): 1940004:1-1940004:34 (2019) - [j42]Lusheng Wang, Boting Yang:
Positive semidefinite zero forcing numbers of two classes of graphs. Theor. Comput. Sci. 786: 44-54 (2019) - [c50]Yuan Xue, Boting Yang, Sandra Zilles:
New Results on the Zero-Visibility Cops and Robber Game. AAIM 2019: 316-328 - [c49]Lusheng Wang, Boting Yang:
The One-Cop-Moves Game on Graphs of Small Treewidth. COCOA 2019: 517-528 - [c48]Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. IWOCA 2019: 442-454 - 2018
- [j41]Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
The Fast Search Number of a Complete k-Partite Graph. Algorithmica 80(12): 3959-3981 (2018) - [j40]Ryan Bergen, Shaun M. Fallat, Adam Gorr, Ferdinand Ihringer
Infection in hypergraphs. Discret. Appl. Math. 237: 43-56 (2018) - [j39]Shaun M. Fallat, Karen Meagher
Compressed cliques graphs, clique coverings and positive zero forcing. Theor. Comput. Sci. 734: 119-130 (2018) - 2017
- [j38]Yuan Xue, Boting Yang:
The fast search number of a Cartesian product of graphs. Discret. Appl. Math. 224: 106-119 (2017) - [j37]Boting Yang:
Lower bounds for positive semidefinite zero forcing and their applications. J. Comb. Optim. 33(1): 81-105 (2017) - [c47]Ziyuan Gao, Boting Yang:
The Cop Number of the One-Cop-Moves Game on Planar Graphs. COCOA (2) 2017: 199-213 - [c46]Boting Yang:
A New Lower Bound for Positive Zero Forcing. FAW 2017: 254-266 - [c45]Yuan Xue, Boting Yang:
Fast Searching on Cartesian Products of Graphs. TAMC 2017: 669-683 - [i4]Ziyuan Gao, Boting Yang:
The Cop Number of the One-Cop-Moves Game on Planar Graphs. CoRR abs/1705.11184 (2017) - 2016
- [j36]Ji-Teng Jia, Boting Yang, Sumei Li:
On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices. Comput. Math. Appl. 71(4): 1036-1044 (2016) - [c44]Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
Fast Searching on Complete k-partite Graphs. COCOA 2016: 159-174 - [c43]Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu:
Genomic Scaffold Filling Revisited. CPM 2016: 15:1-15:13 - [c42]Shaun M. Fallat, Karen Meagher
Positive Zero Forcing and Edge Clique Coverings. FAW 2016: 53-64 - 2015
- [j35]Dariusz Dereniowski
Zero-visibility cops and robber and the pathwidth of a graph. J. Comb. Optim. 29(3): 541-564 (2015) - [j34]Boting Yang, William Hamilton:
The optimal capture time of the one-cop-moves game. Theor. Comput. Sci. 588: 96-113 (2015) - [j33]Qian-Ping Gu, Pavol Hell, Boting Yang:
Preface. Theor. Comput. Sci. 607: 1 (2015) - [j32]Dariusz Dereniowski
The complexity of zero-visibility cops and robber. Theor. Comput. Sci. 607: 135-148 (2015) - [j31]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607: 455-470 (2015) - [c41]Boting Yang:
Positive Semidefinite Zero Forcing: Complexity and Lower Bounds. WADS 2015: 629-639 - [i3]Boting Yang:
Algorithmic Aspects of the Positive Semidefinite Zero Forcing. CTW 2015: 209-212 - 2014
- [j30]David G. Kirkpatrick, Boting Yang, Sandra Zilles:
A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. Int. J. Comput. Geom. Appl. 24(3): 225-236 (2014) - [j29]Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theor. Comput. Sci. 550: 59-65 (2014) - [j28]Rahim Samei, Pavel Semukhin
Algebraic methods proving Sauer's bound for teaching complexity. Theor. Comput. Sci. 558: 35-50 (2014) - [c40]Rahim Samei, Boting Yang, Sandra Zilles:
Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes. ALT 2014: 275-290 - [c39]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
Algorithms for Cut Problems on Trees. COCOA 2014: 283-298 - [c38]Shaun M. Fallat, Karen Meagher
The Complexity of the Positive Semidefinite Zero Forcing. COCOA 2014: 681-693 - [c37]Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles:
Sample Compression for Multi-label Concept Classes. COLT 2014: 371-393 - [c36]Dariusz Dereniowski
The Complexity of Zero-Visibility Cops and Robber. FAW 2014: 60-70 - [e2]Qianping Gu, Pavol Hell, Boting Yang:
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Lecture Notes in Computer Science 8546, Springer 2014, ISBN 978-3-319-07955-4 [contents] - 2013
- [j27]Boting Yang:
Euclidean chains and their shortcuts. Theor. Comput. Sci. 497: 55-67 (2013) - [j26]Boting Yang:
Fast-mixed searching and related problems on graphs. Theor. Comput. Sci. 507: 100-113 (2013) - [c35]Dariusz Dereniowski
Zero-Visibility Cops and Robber Game on a Graph. FAW-AAIM 2013: 175-186 - [i2]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. CoRR abs/1304.3653 (2013) - 2012
- [j25]Shuo Wang
An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management. Environ. Model. Softw. 29(1): 24-36 (2012) - [c34]Rahim Samei, Pavel Semukhin
Sauer's Bound for a Notion of Teaching Complexity. ALT 2012: 96-110 - [c33]Boting Yang:
Fast-Mixed Searching on Graphs. COCOA 2012: 324-335 - 2011
- [j24]Donald Stanley, Boting Yang:
Fast searching games on graphs. J. Comb. Optim. 22(4): 763-777 (2011) - [j23]Leizhen Cai, Boting Yang:
Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms 9(3): 231-240 (2011) - [j22]Boting Yang:
Fast edge searching and fast searching on graphs. Theor. Comput. Sci. 412(12-14): 1208-1219 (2011) - [j21]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011) - [c32]Boting Yang:
Euclidean Chains and Their Shortcuts. COCOA 2011: 141-155 - [c31]Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu:
Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. COCOA 2011: 299-310 - 2010
- [c30]Leizhen Cai, Boting Yang:
Parameterized Complexity of Even/Odd Subgraph Problems. CIAC 2010: 85-96 - [c29]Boting Yang:
Fast Edge-Searching and Related Problems. COCOA (2) 2010: 228-242
2000 – 2009
- 2009
- [j20]Boting Yang, Danny Dyer, Brian Alspach:
Sweeping graphs with large clique number. Discret. Math. 309(18): 5770-5780 (2009) - [j19]Boting Yang, Yi Cao:
Standard directed search strategies and their applications. J. Comb. Optim. 17(4): 378-399 (2009) - [j18]Boting Yang, Cao An Wang:
Preface. Theor. Comput. Sci. 410(52): 5383 (2009) - [c28]Donald Stanley, Boting Yang:
Lower Bounds on Fast Searching. ISAAC 2009: 964-973 - [c27]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127 - 2008
- [j17]Boting Yang, Yi Cao:
Digraph searching, directed vertex separation and directed pathwidth. Discret. Appl. Math. 156(10): 1822-1837 (2008) - [j16]Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu:
Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. J. Comput. Biol. 15(5): 535-546 (2008) - [j15]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Time constrained graph searching. Theor. Comput. Sci. 399(3): 158-168 (2008) - [j14]Boting Yang, Yi Cao:
Monotonicity in digraph search problems. Theor. Comput. Sci. 407(1-3): 532-544 (2008) - [c26]Danny Dyer, Boting Yang, Öznur Yasar
On the Fast Searching Problem. AAIM 2008: 143-154 - [c25]Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu:
Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. APBC 2008: 333-342 - [c24]Boting Yang, Yi Cao:
On the Monotonicity of Weak Searching. COCOON 2008: 52-61 - [c23]Chris Worman, Boting Yang:
Searching Trees with Sources and Targets. FAW 2008: 174-185 - [c22]Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu:
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 - [e1]Boting Yang, Ding-Zhu Du, Cao An Wang:
Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings. Lecture Notes in Computer Science 5165, Springer 2008, ISBN 978-3-540-85096-0 [contents] - 2007
- [j13]Chris Worman, Boting Yang:
On the Tileability of Polygons with Colored Dominoes. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j12]Boting Yang:
Strong-mixed searching and pathwidth. J. Comb. Optim. 13(1): 47-59 (2007) - [j11]Boting Yang, Yi Cao:
Monotonicity of strong searching on digraphs. J. Comb. Optim. 14(4): 411-425 (2007) - [c21]Boting Yang, Yi Cao:
Digraph Strong Searching: Monotonicity and Complexity. AAIM 2007: 37-46 - [c20]Boting Yang, Runtao Zhang, Yi Cao:
Searching Cycle-Disjoint Graphs. COCOA 2007: 32-43 - [c19]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Arc Searching Digraphs Without Jumping. COCOA 2007: 354-365 - [c18]Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu:
Non-breaking Similarity of Genomes with Gene Repetitions. CPM 2007: 119-130 - [c17]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Lower Bounds on Edge Searching. ESCAPE 2007: 516-527 - [c16]Boting Yang, Yi Cao:
Directed Searching Digraphs: Monotonicity and Complexity. TAMC 2007: 136-147 - 2006
- [j10]Cory J. Butz, Wen Yan, Boting Yang:
An Efficient Algorithm for Inference in Rough Set Flow Graphs. Trans. Rough Sets 5: 102-122 (2006) - 2005
- [c15]Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang:
Integer Programming Methods for Several Optimization Problems in Graph Theory. CATA 2005: 50-55 - [c14]Chris Worman, Boting Yang:
On the Computation and Chromatic Number of Colored Domino Tilings. CCCG 2005: 203-206 - [c13]Chris Worman, Boting Yang:
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. ISAAC 2005: 859-868 - [c12]Cory J. Butz, Wen Yan, Boting Yang:
The Computational Complexity of Inference Using Rough Set Flow Graphs. RSFDGrC (1) 2005: 335-344 - 2004
- [j9]Boting Yang, Cao An Wang:
Detecting tetrahedralizations of a set of line segments. J. Algorithms 53(1): 1-35 (2004) - [j8]Boting Yang, Cao An Wang:
Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. 8(3): 241-265 (2004) - [c11]Boting Yang, Danny Dyer, Brian Alspach:
Sweeping Graphs with Large Clique Number. ISAAC 2004: 908-920 - 2002
- [j7]Brett Stevens, Paul Buskell, Paule Ecimovic, Cristian Ivanescu, Abid Muslim Malik, Anamaria Savu, Tzvetalin S. Vassilev, Helen Verrall, Boting Yang, Zhiduo Zhao:
Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2. Discret. Math. 258(1-3): 193-204 (2002) - [c10]Boting Yang, Cao An Wang, Francis Y. L. Chin:
Algorithms and Complexity for Tetrahedralization Detections. ISAAC 2002: 296-307 - 2001
- [j6]Cao An Wang, Boting Yang:
A lower bound for beta-skeleton belonging to minimum weight triangulations. Comput. Geom. 19(1): 35-46 (2001) - 2000
- [j5]Bo-Ting Yang, Paul Gillard:
The class Steiner minimal tree problem: a lower bound and test problem generation. Acta Informatica 37(3): 193-211 (2000) - [j4]Cao An Wang, Francis Y. L. Chin, Boting Yang:
Triangulations without minimum-weight drawing. Inf. Process. Lett. 74(5-6): 183-189 (2000) - [j3]Cao An Wang, Bo-Ting Yang, Binhai Zhu:
On Some Polyhedra Covering Problems. J. Comb. Optim. 4(4): 437-447 (2000) - [c9]Boting Yang, Cao An Wang:
Minimal Tetrahedralizations of a Class of Polyhedra. CCCG 2000 - [c8]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Triangulations without Minimum-Weight Drawing. CIAC 2000: 163-173 - [c7]Cao An Wang, Bo-Ting Yang:
Tetrahedralization of Two Nested Convex Polyhedra. COCOON 2000: 291-298 - [i1]Cao An Wang, Boting Yang:
Optimal Tetrahedralizations of Some Convex Polyhedra. EuroCG 2000: 5-9
1990 – 1999
- 1999
- [j2]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing. Inf. Process. Lett. 70(1): 17-22 (1999) - [c6]Cao An Wang, Bo-Ting Yang:
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. WADS 1999: 265-275 - 1998
- [c5]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Its Application on Graph Drawing. COCOON 1998: 25-34 - [c4]Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing. GD 1998: 460-461 - 1996
- [c3]Zongben Xu, Bo-Ting Yang:
The Heuristics for the Constrained Multicast Routing. ASIAN 1996: 204-212 - 1995
- [j1]Bo-Ting Yang:
A Better Subgraph of the Minimum Weight Triangulation. Inf. Process. Lett. 56(5): 255-258 (1995) - [c2]Bo-Ting Yang:
A Better Subgraph of the Minimum Weight Triangulation. COCOON 1995: 452-455 - 1994
- [c1]Bo-Ting Yang, Yin-Feng Xu, Zhao-yong You:
A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations. ISAAC 1994: 423-427
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: