☰

Boting Yang, Ph.D. - Publications

Affiliations: 
2002 Memorial University of Newfoundland, St. John's, Newfoundland and Labrador, Canada 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

45 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Wang L, Yang B. The one-cop-moves game on graphs with some special structures Theoretical Computer Science. 847: 17-26. DOI: 10.1016/J.TCS.2020.09.033  0.303
2020 Butler S, Erickson C, Fallat S, Hall HT, Kroschel B, Lin JC-, Shader B, Warnberg N, Yang B. Properties of a q -Analogue of Zero Forcing Graphs and Combinatorics. 36: 1401-1419. DOI: 10.1007/S00373-020-02208-2  0.36
2019 Adm M, Fallat S, Meagher K, Nasserasr S, Plosker S, Yang B. Achievable multiplicity partitions in the inverse eigenvalue problem of a graph Special Matrices. 7: 276-290. DOI: 10.1515/Spma-2019-0022  0.451
2019 Yang B, Zhang R, Cao Y, Zhong F. Search Numbers in Networks with Special Topologies Journal of Interconnection Networks. 19: 1940004. DOI: 10.1142/S0219265919400048  0.395
2019 Wang L, Yang B. Positive semidefinite zero forcing numbers of two classes of graphs Theoretical Computer Science. 786: 44-54. DOI: 10.1016/J.Tcs.2018.05.009  0.434
2019 Gao Z, Yang B. The one-cop-moves game on planar graphs Journal of Combinatorial Optimization. 1-34. DOI: 10.1007/S10878-019-00417-X  0.415
2018 Xue Y, Yang B, Zhong F, Zilles S. The Fast Search Number of a Complete k-Partite Graph Algorithmica. 80: 3959-3981. DOI: 10.1007/S00453-018-0456-Z  0.485
2018 Adm M, Bergen R, Ihringer F, Jaques S, Meagher K, Purdy A, Yang B. Ovoids of Generalized Quadrangles of Order $(q, q^2-q)$ and Delsarte Cocliques in Related Strongly Regular Graphs Journal of Combinatorial Designs. 26: 249-263. DOI: 10.1002/Jcd.21598  0.318
2017 Fallat SM, Meagher K, Soltani A, Yang B. Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing Theoretical Computer Science. 734: 119-130. DOI: 10.1016/J.Tcs.2017.08.018  0.437
2017 Bergen R, Fallat SM, Gorr A, Ihringer F, Meagher K, Purdy A, Yang B, Yu G. Infection in hypergraphs Discrete Applied Mathematics. 237: 43-56. DOI: 10.1016/J.Dam.2017.11.012  0.347
2017 Xue Y, Yang B. The fast search number of a Cartesian product of graphs Discrete Applied Mathematics. 224: 106-119. DOI: 10.1016/J.Dam.2017.03.003  0.469
2016 Fallat S, Meagher K, Yang B. On the complexity of the positive semidefinite zero forcing number Linear Algebra and Its Applications. 491: 101-122. DOI: 10.1016/J.Laa.2015.03.011  0.443
2016 Jia J, Yang B, Li S. On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices Computers & Mathematics With Applications. 71: 1036-1044. DOI: 10.1016/J.Camwa.2016.01.027  0.311
2016 Fallat S, Meagher K, Soltani A, Yang B. Positive zero forcing and edge clique coverings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9711: 53-64. DOI: 10.1007/978-3-319-39817-4_6  0.336
2015 Kanj I, Lin G, Liu T, Tong W, Xia G, Xu J, Yang B, Zhang F, Zhang P, Zhu B. Improved parameterized and exact algorithms for cut problems on trees Theoretical Computer Science. 607: 455-470. DOI: 10.1016/J.Tcs.2015.06.010  0.378
2015 Yang B, Hamilton W. The optimal capture time of the one-cop-moves game Theoretical Computer Science. 588: 96-113. DOI: 10.1016/J.Tcs.2015.04.005  0.365
2015 Dereniowski D, Dyer D, Tifenbach RM, Yang B. The complexity of zero-visibility cops and robber Theoretical Computer Science. 607: 135-148. DOI: 10.1016/J.Tcs.2015.03.022  0.406
2015 Yang B. Lower bounds for positive semidefinite zero forcing and their applications Journal of Combinatorial Optimization. DOI: 10.1007/S10878-015-9936-0  0.477
2015 Dereniowski D, Dyer D, Tifenbach RM, Yang B. Zero-visibility cops and robber and the pathwidth of a graph Journal of Combinatorial Optimization. 29: 541-564. DOI: 10.1007/S10878-014-9712-6  0.449
2015 Yang B. Positive semidefinite zero forcing: Complexity and lower bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9214: 629-639. DOI: 10.1007/978-3-319-21840-3_52  0.39
2014 Samei R, Semukhin P, Yang B, Zilles S. Algebraic methods proving Sauer's bound for teaching complexity Theoretical Computer Science. 558: 35-50. DOI: 10.1016/J.Tcs.2014.09.024  0.344
2014 Chen Z, Fu B, Goebel R, Lin G, Tong W, Xu J, Yang B, Zhao Z, Zhu B. On the approximability of the exemplar adjacency number problem for genomes with gene repetitions Theoretical Computer Science. 550: 59-65. DOI: 10.1016/J.Tcs.2014.07.011  0.346
2013 Yang B. Fast-mixed searching and related problems on graphs Theoretical Computer Science. 507: 100-113. DOI: 10.1016/J.Tcs.2013.04.015  0.482
2012 Yang B. Fast-mixed searching on graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7402: 324-335. DOI: 10.1007/978-3-642-31770-5_29  0.386
2011 Yang B. Euclidean chains and their shortcuts Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6831: 141-155. DOI: 10.1016/J.Tcs.2012.03.021  0.407
2011 Yang B. Fast edge searching and fast searching on graphs Theoretical Computer Science. 412: 1208-1219. DOI: 10.1016/J.Tcs.2010.12.065  0.492
2011 Bereg S, Jiang M, Yang B, Zhu B. On the red/blue spanning tree problem Theoretical Computer Science. 412: 2459-2467. DOI: 10.1016/J.Tcs.2010.10.038  0.364
2011 Cai L, Yang B. Parameterized complexity of even/odd subgraph problems Journal of Discrete Algorithms. 9: 231-240. DOI: 10.1016/J.Jda.2011.03.004  0.469
2011 Stanley D, Yang B. Fast searching games on graphs Journal of Combinatorial Optimization. 22: 763-777. DOI: 10.1007/S10878-010-9328-4  0.5
2010 Yang B. Fast edge-searching and related problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6509: 228-242. DOI: 10.1007/978-3-642-17461-2_19  0.401
2009 Yang B, Wang CA. Preface Theoretical Computer Science. 410: 5383. DOI: 10.1016/j.tcs.2009.09.027  0.474
2009 Yang B, Dyer D, Alspach B. Sweeping graphs with large clique number Discrete Mathematics. 309: 5770-5780. DOI: 10.1016/J.Disc.2008.05.033  0.472
2009 Yang B, Cao Y. Standard directed search strategies and their applications Journal of Combinatorial Optimization. 17: 378-399. DOI: 10.1007/S10878-007-9121-1  0.389
2008 Yang B, Cao Y. Monotonicity in digraph search problems Theoretical Computer Science. 407: 532-544. DOI: 10.1016/J.Tcs.2008.08.025  0.361
2008 Alspach B, Dyer D, Hanson D, Yang B. Time constrained graph searching Theoretical Computer Science. 399: 158-168. DOI: 10.1016/J.Tcs.2008.02.035  0.376
2008 Yang B, Cao Y. Digraph searching, directed vertex separation and directed pathwidth Discrete Applied Mathematics. 156: 1822-1837. DOI: 10.1016/J.Dam.2007.08.045  0.318
2007 Yang B, Cao Y. Monotonicity of strong searching on digraphs Journal of Combinatorial Optimization. 14: 411-425. DOI: 10.1007/S10878-007-9042-Z  0.395
2007 Yang B. Strong-mixed searching and pathwidth Journal of Combinatorial Optimization. 13: 47-59. DOI: 10.1007/S10878-006-9013-9  0.392
2006 Butz CJ, Yan W, Yang B. An efficient algorithm for inference in rough set flow graphs Lecture Notes in Computer Science. 102-122. DOI: 10.1007/11847465_5  0.372
2004 Yang B, Wang CA. Minimal tetrahedralizations of a class of polyhedra Journal of Combinatorial Optimization. 8: 241-265. DOI: 10.1023/B:Joco.0000038910.06360.0A  0.577
2004 Yang B, Wang CA. Detecting tetrahedralizations of a set of line segments Journal of Algorithms. 53: 1-35. DOI: 10.1016/J.Jalgor.2004.04.006  0.551
2001 Wang CA, Yang B. A lower bound for β-skeleton belonging to minimum weight triangulations Computational Geometry: Theory and Applications. 19: 35-46. DOI: 10.1016/S0925-7721(01)00008-6  0.431
2000 Wang CA, Yang B, Zhu B. Journal of Combinatorial Optimization. 4: 437-447. DOI: 10.1023/A:1009833410742  0.478
2000 Wang CA, Chin FY, Yang B. Triangulations without minimum-weight drawing Information Processing Letters. 74: 183-189. DOI: 10.1016/S0020-0190(00)00067-3  0.578
1999 Wang CA, Chin FY, Yang BT. Maximum weight triangulation and graph drawing Information Processing Letters. 70: 17-22. DOI: 10.1016/S0020-0190(99)00037-X  0.533
Show low-probability matches.