Boting Yang's Home Page

Dr. Boting Yang
Professor
Department of Computer Science
University of Regina
Regina, Saskatchewan
Canada, S4S 0A2


Office :  CW 308.7
Phone :  (306) 585-4774
Fax :  (306) 585-4745
Email :  boting@cs.uregina.ca

Research interests:

Design and analysis of algorithms, graph theory, combinatorial optimization, computational geometry.

Recent refereed journal papers:

  • S. Wang, G.H. Huang and B.T. Yang, An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management, Environmental Modelling & Software, Vol. 29, Issue 1, pp.24--36, 2012.

  • B. Yang, Fast edge-searching and fast searching on graphs, Theoretical Computer Science, Vol. 412, pp.1208--1219, 2011.

  • L. Cai and B. Yang, Parameterized Complexity of Even/Odd Subgraph Problems, Journal of Discrete Algorithms, Vol. 9, No.3, pp.231--240, 2011.

  • S. Bereg, M. Jiang, B. Yang and B. Zhu, On the Red/Blue Spanning Tree Problem, Theoretical Computer Science, Vol. 412, pp.2459--2467, 2011.

  • D. Stanley and B. Yang, Fast searching games on graphs, Journal of Combinatorial Optimization, Vol. 22, No. 4, pp.763--777, 2011.

  • B. Yang, D. Dyer and B. Alspach, Searching Graphs with Large Clique Number, Discrete Mathematics, Vol. 309, No. 18, pp.5770--5780, 2009.

  • B. Yang and Y. Cao, Standard directed search strategies and their applications, Journal of Combinatorial Optimization, Vol. 17, No. 4, pp.378--399, 2009.

  • B. Yang and Y. Cao, Monotonicity in Digraph Search Problems, Theoretical Computer Science, Vol. 407, No.1-3, pp.532--544, 2008.

  • B. Alspach, D. Dyer, D. Hanson and B. Yang, Time constrained Searching, Theoretical Computer Science, Vol.399, No.3, pp.158--168, 2008.

  • Z. Chen, B. Fu, R. Schweller, B. Yang, Z. Zhao and B. Zhu, Linear Time Probablistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments, Journal of Computational Biology, Vol. 15, No. 5, pp.535--546, 2008.

  • B. Yang and Y. Cao, Digraph searching, directed vertex separation and directed pathwidth, Discrete Applied Mathematics, Vol.156, pp.1822--1837, 2008

  • B. Yang and Y. Cao, Monotonicity of strong searching on digraphs, Journal of Combinatorial Optimization, Vol.14, No.4, pp.411--425, 2007.

  • C. Worman and B. Yang. On the tileability of polygons with colored dominoes. Discrete Mathematics and Theoretical Computer Science, Vol.9, No.1, pp.107--126, 2007.

  • B. Yang, Strong-mixed searching and pathwidth, Journal of Combinatorial Optimization, Vol.13, No.1, pp.47--59, 2007.

  • C.J. Butz, W. Yan and B. Yang, An efficient algorithm for inference in rough set flow graphs, Transactions on Rough Sets, Vol.5, pp.102--122, 2006.

  • B. Yang, and C.A. Wang, Detecting tetrahedralizations of a set of line segments, Journal of Algorithms, Vol.53, pp.1--35, 2004.

  • B. Yang, and C.A. Wang, Minimal tetrahedralizations of a class of polyhedra, Journal of Combinatorial Optimization, Vol.8, pp.241--265, 2004.

  • B.Stevens, P.Buskell, P.Ecimovic, C.Ivanescu, A.Malik, A.Savu, T.Vassilev, H.Verrall, B.Yang, Z.Zhao, Solution to an outstanding conjecture: the non-existence of universal cycles with $k=n-2$, Discrete Mathematics, Vol.258, pp.193--204, 2002.

  • C.A. Wang, and B. Yang, A lower bound for beta-skeleton belonging to minimum weight triangulations, Computational Geometry: Theory and Application, Vol.19, pp.35--46, 2001.

  • C.A. Wang, B.-T. Yang, and B. Zhu, On some polyhedra covering problems, Journal of Combinatorial Optimization, Vol.4, No.4, pp. 437-447, 2000.

  • C.A. Wang, F. Chin, and B. Yang, Triangulations without minimum-weight drawing, Information Processing Letters, Vol.74, pp. 183-189 2000.

  • B. Yang, and P. Gillard, The class Steiner minimal tree problem: a lower bound and test problem generation, Acta Informatica, Vol.37, No.3, pp.193--211, 2000.

    • Editorship:

  • Associate Editor, Discrete Mathematics, Algorithms and Applications
  • Guest Editor, Special Issue on Combinatorial Optimization, Theoretical Computer Science, Volume 410, Issue 52, 2009.
  • Guest Editor, Special Issue on Combinatorial Optimization, Journal of Combinatorial Optimization, Volume 18, Number 3, 2009.
  • Guest Editor, Special Issue on Combinatorial Optimization, Journal of Combinatorial Optimization, Volume 18, Number 4, 2009.
  • Editor, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Volume 5165, Springer, 2008.

    • Conferences:

  • COCOA 2012
  • BIOTECHNO 2012
  • EURO XXV 2012

    • Current courses:

  • CS412-001: Algorithm Analysis (Winter, 2012)

    • Useful links:

  • Department of Computer Science, University of Regina
  • UR Library
  • CASPUR, WISURD
  • Google
  • Weather, forecast
  • UR-WebMail, CS-WebMail, Gmail
  • gwweb
    • Last Modified: January 18, 2011