Boting Yang

Bo-Ting Yang

	2009
47		Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127
46		Boting Yang, Yi Cao: Standard directed search strategies and their applications. J. Comb. Optim. 17(4): 378-399 (2009)
	2008
45		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 Springer 2008
44		Danny Dyer, Boting Yang, Öznur Yasar: On the Fast Searching Problem. AAIM 2008: 143-154
43		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
42		Boting Yang, Yi Cao: On the Monotonicity of Weak Searching. COCOON 2008: 52-61
41		Chris Worman, Boting Yang: Searching Trees with Sources and Targets. FAW 2008: 174-185
40		Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641
39		Boting Yang, Yi Cao: Digraph searching, directed vertex separation and directed pathwidth. Discrete Applied Mathematics 156(10): 1822-1837 (2008)
38		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)
37		Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang: Time constrained graph searching. Theor. Comput. Sci. 399(3): 158-168 (2008)
36		Boting Yang, Yi Cao: Monotonicity in digraph search problems. Theor. Comput. Sci. 407(1-3): 532-544 (2008)
	2007
35		Boting Yang, Yi Cao: Digraph Strong Searching: Monotonicity and Complexity. AAIM 2007: 37-46
34		Boting Yang, Runtao Zhang, Yi Cao: Searching Cycle-Disjoint Graphs. COCOA 2007: 32-43
33		Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang: Arc Searching Digraphs Without Jumping. COCOA 2007: 354-365
32		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
31		Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang: Lower Bounds on Edge Searching. ESCAPE 2007: 516-527
30		Boting Yang, Yi Cao: Directed Searching Digraphs: Monotonicity and Complexity. TAMC 2007: 136-147
29		Chris Worman, Boting Yang: On the Tileability of Polygons with Colored Dominoes. Discrete Mathematics & Theoretical Computer Science 9(1): (2007)
28		Boting Yang: Strong-mixed searching and pathwidth. J. Comb. Optim. 13(1): 47-59 (2007)
27		Boting Yang, Yi Cao: Monotonicity of strong searching on digraphs. J. Comb. Optim. 14(4): 411-425 (2007)
	2006
26		Cory J. Butz, Wen Yan, Boting Yang: An Efficient Algorithm for Inference in Rough Set Flow Graphs. T. Rough Sets: 102-122 (2006)
	2005
25		Chris Worman, Boting Yang: On the Computation and Chromatic Number of Colored Domino Tilings. CCCG 2005: 203-206
24		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
23		Chris Worman, Boting Yang: On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. ISAAC 2005: 859-868
22		Cory J. Butz, Wen Yan, Boting Yang: The Computational Complexity of Inference Using Rough Set Flow Graphs. RSFDGrC (1) 2005: 335-344
	2004
21		Boting Yang, Danny Dyer, Brian Alspach: Sweeping Graphs with Large Clique Number. ISAAC 2004: 908-920
20		Boting Yang, Cao An Wang: Detecting tetrahedralizations of a set of line segments. J. Algorithms 53(1): 1-35 (2004)
19		Boting Yang, Cao An Wang: Minimal Tetrahedralizations of a Class of Polyhedra. J. Comb. Optim. 8(3): 241-265 (2004)
	2002
18		Boting Yang, Cao An Wang, Francis Y. L. Chin: Algorithms and Complexity for Tetrahedralization Detections. ISAAC 2002: 296-307
17		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)
	2001
16		Cao An Wang, Boting Yang: A lower bound for beta-skeleton belonging to minimum weight triangulations. Comput. Geom. 19(1): 35-46 (2001)
	2000
15		Boting Yang, Cao An Wang: Minimal Tetrahedralizations of a Class of Polyhedra. CCCG 2000
14		Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Triangulations without Minimum-Weight Drawing. CIAC 2000: 163-173
13		Cao An Wang, Bo-Ting Yang: Tetrahedralization of Two Nested Convex Polyhedra. COCOON 2000: 291-298
12		Cao An Wang, Boting Yang: Optimal Tetrahedralizations of Some Convex Polyhedra. EWCG 2000: 5-9
11		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)
10		Cao An Wang, Francis Y. L. Chin, Boting Yang: Triangulations without minimum-weight drawing. Inf. Process. Lett. 74(5-6): 183-189 (2000)
9		Cao An Wang, Bo-Ting Yang, Binhai Zhu: On Some Polyhedra Covering Problems. J. Comb. Optim. 4(4): 437-447 (2000)
	1999
8		Cao An Wang, Bo-Ting Yang: A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. WADS 1999: 265-275
7		Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Graph Drawing. Inf. Process. Lett. 70(1): 17-22 (1999)
	1998
6		Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Its Application on Graph Drawing. COCOON 1998: 25-34
5		Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang: Maximum Weight Triangulation and Graph Drawing. Graph Drawing 1998: 460-461
	1996
4		Zong-Ben Xu, Bo-Ting Yang: The Heuristics for the Constrained Multicast Routing. ASIAN 1996: 204-212
	1995
3		Bo-Ting Yang: A Better Subgraph of the Minimum Weight Triangulation. COCOON 1995: 452-455
2		Bo-Ting Yang: A Better Subgraph of the Minimum Weight Triangulation. Inf. Process. Lett. 56(5): 255-258 (1995)
	1994
1		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

1	Brian Alspach	[21] [31] [33] [37]
2	Sergey Bereg (Sergei Bespamyatnikh)	[40] [47]
3	Paul Buskell	[17]
4	Cory J. Butz	[22] [26]
5	Yi Cao	[27] [30] [34] [35] [36] [39] [42] [46]
6	Zhixiang Chen	[32] [38] [43]
7	Francis Y. L. Chin (Francis Yuk-Lun Chin)	[5] [6] [7] [10] [14] [18]
8	Ding-Zhu Du	[45]
9	Danny Dyer	[21] [31] [33] [37] [44]
10	Paule Ecimovic	[17]
11	Bin Fu	[32] [38] [43]
12	Paul Gillard	[11]
13	Denis Hanson	[31] [33] [37]
14	Cristian Ivanescu	[17]
15	Minghui Jiang	[40] [47]
16	Jamiru Luttamaguzi	[24]
17	Abid Muslim Malik	[17]
18	Michael J. Pelsmajer	[24]
19	Anamaria Savu	[17]
20	Robert T. Schweller	[38] [43]
21	Zhizhang Shen	[24]
22	Brett Stevens	[17]
23	Tzvetalin S. Vassilev	[17]
24	Helen Verrall	[17]
25	Cao An Wang	[5] [6] [7] [8] [9] [10] [12] [13] [14] [15] [16] [18] [19] [20] [45]
26	Wencheng Wang	[40]
27	Chris Worman	[23] [25] [29] [41]
28	Jinhui Xu	[32]
29	Yin-Feng Xu	[1]
30	Zong-Ben Xu	[4]
31	Wen Yan	[22] [26]
32	Öznur Yasar	[44]
33	Zhao-yong You	[1]
34	Runtao Zhang	[34]
35	Zhiduo Zhao	[17]
36	Zhiyu Zhao	[32] [38] [43]
37	Binhai Zhu	[9] [32] [38] [40] [43] [47]

Colors in the list of coauthors