Boting Yang

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)

Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles: Sauer's Bound for a Notion of Teaching Complexity. ALT 2012: 96-110

Boting Yang: Fast-Mixed Searching on Graphs. COCOA 2012: 324-335

Donald Stanley, Boting Yang: Fast searching games on graphs. J. Comb. Optim. 22(4): 763-777 (2011)

Leizhen Cai, Boting Yang: Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms 9(3): 231-240 (2011)

Boting Yang: Fast edge searching and fast searching on graphs. Theor. Comput. Sci. 412(12-14): 1208-1219 (2011)

Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011)

Boting Yang: Euclidean Chains and Their Shortcuts. COCOA 2011: 141-155

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

Leizhen Cai, Boting Yang: Parameterized Complexity of Even/Odd Subgraph Problems. CIAC 2010: 85-96

Boting Yang: Fast Edge-Searching and Related Problems. COCOA (2) 2010: 228-242

Boting Yang, Danny Dyer, Brian Alspach: Sweeping graphs with large clique number. Discrete Mathematics 309(18): 5770-5780 (2009)

Boting Yang, Yi Cao: Standard directed search strategies and their applications. J. Comb. Optim. 17(4): 378-399 (2009)

Boting Yang, Cao An Wang: Preface. Theor. Comput. Sci. 410(52): 5383 (2009)

Donald Stanley, Boting Yang: Lower Bounds on Fast Searching. ISAAC 2009: 964-973

Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127

Boting Yang, Yi Cao: Digraph searching, directed vertex separation and directed pathwidth. Discrete Applied Mathematics 156(10): 1822-1837 (2008)

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. Journal of Computational Biology 15(5): 535-546 (2008)

Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang: Time constrained graph searching. Theor. Comput. Sci. 399(3): 158-168 (2008)

Boting Yang, Yi Cao: Monotonicity in digraph search problems. Theor. Comput. Sci. 407(1-3): 532-544 (2008)

Danny Dyer, Boting Yang, Öznur Yasar: On the Fast Searching Problem. AAIM 2008: 143-154

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

Boting Yang, Yi Cao: On the Monotonicity of Weak Searching. COCOON 2008: 52-61

Chris Worman, Boting Yang: Searching Trees with Sources and Targets. FAW 2008: 174-185

Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641

Boting Yang, Ding-Zhu Du, Cao An Wang (Eds.): 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

Chris Worman, Boting Yang: On the Tileability of Polygons with Colored Dominoes. Discrete Mathematics & Theoretical Computer Science 9(1) (2007)

Boting Yang: Strong-mixed searching and pathwidth. J. Comb. Optim. 13(1): 47-59 (2007)

Boting Yang, Yi Cao: Monotonicity of strong searching on digraphs. J. Comb. Optim. 14(4): 411-425 (2007)

Boting Yang, Yi Cao: Digraph Strong Searching: Monotonicity and Complexity. AAIM 2007: 37-46

Boting Yang, Runtao Zhang, Yi Cao: Searching Cycle-Disjoint Graphs. COCOA 2007: 32-43

Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang: Arc Searching Digraphs Without Jumping. COCOA 2007: 354-365

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

Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang: Lower Bounds on Edge Searching. ESCAPE 2007: 516-527

Boting Yang, Yi Cao: Directed Searching Digraphs: Monotonicity and Complexity. TAMC 2007: 136-147

Cory J. Butz, Wen Yan, Boting Yang: An Efficient Algorithm for Inference in Rough Set Flow Graphs. : 102-122 (2006)

Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang: Integer Programming Methods for Several Optimization Problems in Graph Theory. Computers and Their Applications 2005: 50-55

Chris Worman, Boting Yang: On the Computation and Chromatic Number of Colored Domino Tilings. CCCG 2005: 203-206

Chris Worman, Boting Yang: On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. ISAAC 2005: 859-868

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

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

Boting Yang, Cao An Wang: Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. 8(3): 241-265 (2004)

Boting Yang, Danny Dyer, Brian Alspach: Sweeping Graphs with Large Clique Number. ISAAC 2004: 908-920

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. Discrete Mathematics 258(1-3): 193-204 (2002)

Boting Yang, Cao An Wang, Francis Y. L. Chin: Algorithms and Complexity for Tetrahedralization Detections. ISAAC 2002: 296-307

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

Bo-Ting Yang, Paul Gillard: The class Steiner minimal tree problem: a lower bound and test problem generation. Acta Inf. 37(3): 193-211 (2000)

Cao An Wang, Francis Y. L. Chin, Boting Yang: Triangulations without minimum-weight drawing. Inf. Process. Lett. 74(5-6): 183-189 (2000)

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

Boting Yang, Cao An Wang: Minimal Tetrahedralizations of a Class of Polyhedra. CCCG 2000

Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Triangulations without Minimum-Weight Drawing. CIAC 2000: 163-173

Cao An Wang, Bo-Ting Yang: Tetrahedralization of Two Nested Convex Polyhedra. COCOON 2000: 291-298

Cao An Wang, Boting Yang: Optimal Tetrahedralizations of Some Convex Polyhedra. EuroCG 2000: 5-9

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

Cao An Wang, Bo-Ting Yang: A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. WADS 1999: 265-275

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

Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Graph Drawing. Graph Drawing 1998: 460-461

Zongben Xu, Bo-Ting Yang: The Heuristics for the Constrained Multicast Routing. ASIAN 1996: 204-212

Bo-Ting Yang: A Better Subgraph of the Minimum Weight Triangulation. Inf. Process. Lett. 56(5): 255-258 (1995)

Bo-Ting Yang: A Better Subgraph of the Minimum Weight Triangulation. COCOON 1995: 452-455

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