Boting Yang - RankMe

109 papers A* 2A 1B 10C 24Misc 6Journal 55Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Approximation Ratio for Preference Aggregation Using Tree CP-Nets. AAMAS Abu Mohammad Hammad Ali, Daniel Ogundare, Boting Yang, Sandra Zilles
2025	J	`jnl`	Improved Parameterized Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. Kangyi Tian, Mingyu Xiao, Boting Yang
2024	A*	`conf`	Approximation Algorithms for Preference Aggregation Using CP-Nets. AAAI Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles
2024	J	`jnl`	Deduction, Constrained Zero Forcing, and Constrained Searching. CoRR Andrea C. Burgess, Danny Dyer, Kerry Ojakian, Lusheng Wang, Mingyu Xiao, Boting Yang
2024	J	`jnl`	Edge searching and fast searching with constraints. Theor. Comput. Sci. Lusheng Wang, Boting Yang
2024	J	`jnl`	The zero-visibility cops and robber game on graph products. Theor. Comput. Sci. Yuan Xue, Boting Yang, Sandra Zilles
2023	J	`jnl`	Approximation Algorithms for Preference Aggregation Using CP-Nets. CoRR Abu Mohammad Hammad Ali, Boting Yang, Sandra Zilles
2023	—	`conf`	Constrained Graph Searching on Trees. IJTCS-FAW Lusheng Wang, Boting Yang, Zhaohui Zhan
2023	J	`jnl`	Fast searching on cactus graphs. J. Comb. Optim. Yuan Xue, Boting Yang, Sandra Zilles, Lusheng Wang
2023	—	`conf`	Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. COCOON (1) Kangyi Tian, Mingyu Xiao, Boting Yang
2023	—	`conf`	Zero-Visibility Cops and Robber Game on Cage Graph. COCOA (2) Xiaoli Sun, Farong Zhong, Boting Yang
2022	J	`jnl`	A simple method for proving lower bounds in the zero-visibility cops and robber game. J. Comb. Optim. Yuan Xue, Boting Yang, Sandra Zilles
2022	C	`conf`	Fast Searching on k-Combinable Graphs. AAIM Yuan Xue, Boting Yang, Sandra Zilles
2022	J	`jnl`	Four-searchable biconnected outerplanar graphs. Discret. Appl. Math. Öznur Yasar Diner, Danny Dyer, Boting Yang
2022	J	`jnl`	One-visibility cops and robber on trees: Optimal cop-win strategies. Theor. Comput. Sci. Boting Yang
2021	—	`conf`	Aggregating Preferences Represented by Conditional Preference Networks. ADT Abu Mohammad Hammad Ali, Howard J. Hamilton, Elizabeth Rayner, Boting Yang, Sandra Zilles
2021	C	`conf`	Computing the One-Visibility Cop-Win Strategies for Trees. COCOA Boting Yang
2021	J	`jnl`	One-visibility cops and robber on trees. Theor. Comput. Sci. Boting Yang, Tanzina Akter
2021	J	`jnl`	The one-cop-moves game on planar graphs. J. Comb. Optim. Ziyuan Gao, Boting Yang
2020	C	`conf`	Computing the One-Visibility Copnumber of Trees. AAIM Boting Yang, Tanzina Akter
2020	J	`jnl`	Correction to: Properties of a q-Analogue of Zero Forcing. Graphs Comb. Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin, Bryan L. Shader, Nathan Warnberg, Boting Yang
2020	J	`jnl`	Properties of a q-Analogue of Zero Forcing. Graphs Comb. Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin, Bryan L. Shader, Nathan Warnberg, Boting Yang
2020	J	`jnl`	The one-cop-moves game on graphs with some special structures. Theor. Comput. Sci. Lusheng Wang, Boting Yang
2019	C	`conf`	A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. IWOCA Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
2019	C	`conf`	New Results on the Zero-Visibility Cops and Robber Game. AAIM Yuan Xue, Boting Yang, Sandra Zilles
2019	J	`jnl`	Positive semidefinite zero forcing numbers of two classes of graphs. Theor. Comput. Sci. Lusheng Wang, Boting Yang
2019	J	`jnl`	Search Numbers in Networks with Special Topologies. J. Interconnect. Networks Boting Yang, Runtao Zhang, Yi Cao, Farong Zhong
2019	C	`conf`	The One-Cop-Moves Game on Graphs of Small Treewidth. COCOA Lusheng Wang, Boting Yang
2018	J	`jnl`	Compressed cliques graphs, clique coverings and positive zero forcing. Theor. Comput. Sci. Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang
2018	J	`jnl`	Infection in hypergraphs. Discret. Appl. Math. Ryan Bergen, Shaun M. Fallat, Adam Gorr, Ferdinand Ihringer, Karen Meagher, Alison Purdy, Boting Yang, Guanglong Yu
2018	J	`jnl`	The Fast Search Number of a Complete k-Partite Graph. Algorithmica Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
2017	Misc	`conf`	A New Lower Bound for Positive Zero Forcing. FAW Boting Yang
2017	C	`conf`	Fast Searching on Cartesian Products of Graphs. TAMC Yuan Xue, Boting Yang
2017	J	`jnl`	Lower bounds for positive semidefinite zero forcing and their applications. J. Comb. Optim. Boting Yang
2017	—	`conf`	The Cop Number of the One-Cop-Moves Game on Planar Graphs. COCOA (2) Ziyuan Gao, Boting Yang
2017	J	`jnl`	The Cop Number of the One-Cop-Moves Game on Planar Graphs. CoRR Ziyuan Gao, Boting Yang
2017	J	`jnl`	The fast search number of a Cartesian product of graphs. Discret. Appl. Math. Yuan Xue, Boting Yang
2016	C	`conf`	Fast Searching on Complete k-partite Graphs. COCOA Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
2016	B	`conf`	Genomic Scaffold Filling Revisited. CPM Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu
2016	J	`jnl`	On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices. Comput. Math. Appl. Ji-Teng Jia, Boting Yang, Sumei Li
2016	Misc	`conf`	Positive Zero Forcing and Edge Clique Coverings. FAW Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang
2015	C	`conf`	Algorithmic Aspects of the Positive Semidefinite Zero Forcing. CTW Boting Yang
2015	J	`jnl`	Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2015	B	`conf`	Positive Semidefinite Zero Forcing: Complexity and Lower Bounds. WADS Boting Yang
2015	J	`jnl`	Preface. Theor. Comput. Sci. Qian-Ping Gu, Pavol Hell, Boting Yang
2015	J	`jnl`	The complexity of zero-visibility cops and robber. Theor. Comput. Sci. Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
2015	J	`jnl`	The optimal capture time of the one-cop-moves game. Theor. Comput. Sci. Boting Yang, William Hamilton
2015	J	`jnl`	Zero-visibility cops and robber and the pathwidth of a graph. J. Comb. Optim. Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
2014	J	`jnl`	A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors. Int. J. Comput. Geom. Appl. David G. Kirkpatrick, Boting Yang, Sandra Zilles
2014	J	`jnl`	Algebraic methods proving Sauer's bound for teaching complexity. Theor. Comput. Sci. Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles
2014	C	`ed.`	Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings AAIM Qianping Gu, Pavol Hell, Boting Yang
2014	C	`conf`	Algorithms for Cut Problems on Trees. COCOA Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2014	B	`conf`	Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes. ALT Rahim Samei, Boting Yang, Sandra Zilles
2014	J	`jnl`	On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theor. Comput. Sci. Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu
2014	A*	`conf`	Sample Compression for Multi-label Concept Classes. COLT Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles
2014	Misc	`conf`	The Complexity of Zero-Visibility Cops and Robber. FAW Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
2014	C	`conf`	The Complexity of the Positive Semidefinite Zero Forcing. COCOA Shaun M. Fallat, Karen Meagher, Boting Yang
2013	J	`jnl`	Algorithms for Cut Problems on Trees CoRR Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2013	J	`jnl`	Euclidean chains and their shortcuts. Theor. Comput. Sci. Boting Yang
2013	J	`jnl`	Fast-mixed searching and related problems on graphs. Theor. Comput. Sci. Boting Yang
2013	—	`conf`	Zero-Visibility Cops and Robber Game on a Graph. FAW-AAIM Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
2012	J	`jnl`	An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management. Environ. Model. Softw. Shuo Wang, Guo H. Huang, Boting Yang
2012	C	`conf`	Fast-Mixed Searching on Graphs. COCOA Boting Yang
2012	B	`conf`	Sauer's Bound for a Notion of Teaching Complexity. ALT Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles
2011	C	`conf`	Euclidean Chains and Their Shortcuts. COCOA Boting Yang
2011	C	`conf`	Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. COCOA Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu
2011	J	`jnl`	Fast edge searching and fast searching on graphs. Theor. Comput. Sci. Boting Yang
2011	J	`jnl`	Fast searching games on graphs. J. Comb. Optim. Donald Stanley, Boting Yang
2011	J	`jnl`	On the red/blue spanning tree problem. Theor. Comput. Sci. Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
2011	J	`jnl`	Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms Leizhen Cai, Boting Yang
2010	—	`conf`	Fast Edge-Searching and Related Problems. COCOA (2) Boting Yang
2010	C	`conf`	Parameterized Complexity of Even/Odd Subgraph Problems. CIAC Leizhen Cai, Boting Yang
2009	B	`conf`	Lower Bounds on Fast Searching. ISAAC Donald Stanley, Boting Yang
2009	C	`conf`	On the Red/Blue Spanning Tree Problem. TAMC Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu
2009	J	`jnl`	Preface. Theor. Comput. Sci. Boting Yang, Cao An Wang
2009	J	`jnl`	Standard directed search strategies and their applications. J. Comb. Optim. Boting Yang, Yi Cao
2009	J	`jnl`	Sweeping graphs with large clique number. Discret. Math. Boting Yang, Danny Dyer, Brian Alspach
2008	C	`ed.`	Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings COCOA Boting Yang, Ding-Zhu Du, Cao An Wang
2008	J	`jnl`	Digraph searching, directed vertex separation and directed pathwidth. Discret. Appl. Math. Boting Yang, Yi Cao
2008	B	`conf`	Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. APBC Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu
2008	J	`jnl`	Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. J. Comput. Biol. Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu
2008	J	`jnl`	Monotonicity in digraph search problems. Theor. Comput. Sci. Boting Yang, Yi Cao
2008	C	`conf`	On the Fast Searching Problem. AAIM Danny Dyer, Boting Yang, Öznur Yasar
2008	Misc	`conf`	On the Monotonicity of Weak Searching. COCOON Boting Yang, Yi Cao
2008	Misc	`conf`	Searching Trees with Sources and Targets. FAW Chris Worman, Boting Yang
2008	B	`conf`	Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu
2008	J	`jnl`	Time constrained graph searching. Theor. Comput. Sci. Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2007	C	`conf`	Arc Searching Digraphs Without Jumping. COCOA Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2007	C	`conf`	Digraph Strong Searching: Monotonicity and Complexity. AAIM Boting Yang, Yi Cao
2007	C	`conf`	Directed Searching Digraphs: Monotonicity and Complexity. TAMC Boting Yang, Yi Cao
2007	—	`conf`	Lower Bounds on Edge Searching. ESCAPE Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2007	J	`jnl`	Monotonicity of strong searching on digraphs. J. Comb. Optim. Boting Yang, Yi Cao
2007	J	`jnl`	On the Tileability of Polygons with Colored Dominoes. Discret. Math. Theor. Comput. Sci. Chris Worman, Boting Yang
2007	C	`conf`	Searching Cycle-Disjoint Graphs. COCOA Boting Yang, Runtao Zhang, Yi Cao
2007	J	`jnl`	Strong-mixed searching and pathwidth. J. Comb. Optim. Boting Yang
2006	J	`jnl`	An Efficient Algorithm for Inference in Rough Set Flow Graphs. Trans. Rough Sets Cory J. Butz, Wen Yan, Boting Yang
2005	Misc	`conf`	Integer Programming Methods for Several Optimization Problems in Graph Theory. CATA Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang
2005	—	`conf`	On the Computation and Chromatic Number of Colored Domino Tilings. CCCG Chris Worman, Boting Yang
2005	B	`conf`	On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. ISAAC Chris Worman, Boting Yang
2005	—	`conf`	The Computational Complexity of Inference Using Rough Set Flow Graphs. RSFDGrC (1) Cory J. Butz, Wen Yan, Boting Yang
2004	J	`jnl`	Detecting tetrahedralizations of a set of line segments. J. Algorithms Boting Yang, Cao An Wang
2004	J	`jnl`	Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. Boting Yang, Cao An Wang
2004	B	`conf`	Sweeping Graphs with Large Clique Number. ISAAC Boting Yang, Danny Dyer, Brian Alspach
2002	B	`conf`	Algorithms and Complexity for Tetrahedralization Detections. ISAAC Boting Yang, Cao An Wang, Francis Y. L. Chin
2002	J	`jnl`	Solution of an outstanding conjecture: the non-existence of universal cycles with Discret. Math. Brett Stevens, Paul Buskell, Paule Ecimovic, Cristian Ivanescu, Abid Muslim Malik, Anamaria Savu, Tzvetalin S. Vassilev, Helen Verrall, Boting Yang, Zhiduo Zhao
2001	J	`jnl`	A lower bound for beta-skeleton belonging to minimum weight triangulations. Comput. Geom. Cao An Wang, Boting Yang
2000	—	`conf`	Minimal Tetrahedralizations of a Class of Polyhedra. CCCG Boting Yang, Cao An Wang
2000	C	`conf`	Optimal Tetrahedralizations of Some Convex Polyhedra. EuroCG Cao An Wang, Boting Yang
2000	J	`jnl`	Triangulations without minimum-weight drawing. Inf. Process. Lett. Cao An Wang, Francis Y. L. Chin, Boting Yang