Boting Yang

According to our database1, Boting Yang
  • authored at least 88 papers between 1994 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Lower bounds for positive semidefinite zero forcing and their applications.
J. Comb. Optim., 2017

The fast search number of a Cartesian product of graphs.
Discrete Applied Mathematics, 2017

The Cop Number of the One-Cop-Moves Game on Planar Graphs.
CoRR, 2017

Fast Searching on Cartesian Products of Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2017

A New Lower Bound for Positive Zero Forcing.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016
On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices.
Computers & Mathematics with Applications, 2016

Positive Zero Forcing and Edge Clique Coverings.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling Revisited.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Fast Searching on Complete k-partite Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
The optimal capture time of the one-cop-moves game.
Theor. Comput. Sci., 2015

Improved parameterized and exact algorithms for cut problems on trees.
Theor. Comput. Sci., 2015

Preface.
Theor. Comput. Sci., 2015

The complexity of zero-visibility cops and robber.
Theor. Comput. Sci., 2015

Zero-visibility cops and robber and the pathwidth of a graph.
J. Comb. Optim., 2015

Positive Semidefinite Zero Forcing: Complexity and Lower Bounds.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Algorithmic Aspects of the Positive Semidefinite Zero Forcing.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Algebraic methods proving Sauer's bound for teaching complexity.
Theor. Comput. Sci., 2014

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.
Theor. Comput. Sci., 2014

A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors.
Int. J. Comput. Geometry Appl., 2014

The Complexity of Zero-Visibility Cops and Robber.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Sample Compression for Multi-label Concept Classes.
Proceedings of The 27th Conference on Learning Theory, 2014

Algorithms for Cut Problems on Trees.
Proceedings of the Combinatorial Optimization and Applications, 2014

The Complexity of the Positive Semidefinite Zero Forcing.
Proceedings of the Combinatorial Optimization and Applications, 2014

Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013
Fast-mixed searching and related problems on graphs.
Theor. Comput. Sci., 2013

Euclidean chains and their shortcuts.
Theor. Comput. Sci., 2013

Algorithms for Cut Problems on Trees
CoRR, 2013

Zero-Visibility Cops and Robber Game on a Graph.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
An interval-valued fuzzy-stochastic programming approach and its application to municipal solid waste management.
Environmental Modelling and Software, 2012

Fast-Mixed Searching on Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2012

Sauer's Bound for a Notion of Teaching Complexity.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Fast edge searching and fast searching on graphs.
Theor. Comput. Sci., 2011

On the red/blue spanning tree problem.
Theor. Comput. Sci., 2011

Parameterized complexity of even/odd subgraph problems.
J. Discrete Algorithms, 2011

Fast searching games on graphs.
J. Comb. Optim., 2011

Euclidean Chains and Their Shortcuts.
Proceedings of the Combinatorial Optimization and Applications, 2011

Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Fast Edge-Searching and Related Problems.
Proceedings of the Combinatorial Optimization and Applications, 2010

Parameterized Complexity of Even/Odd Subgraph Problems.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Preface.
Theor. Comput. Sci., 2009

Standard directed search strategies and their applications.
J. Comb. Optim., 2009

Sweeping graphs with large clique number.
Discrete Mathematics, 2009

On the Red/Blue Spanning Tree Problem.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Lower Bounds on Fast Searching.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Monotonicity in digraph search problems.
Theor. Comput. Sci., 2008

Time constrained graph searching.
Theor. Comput. Sci., 2008

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.
Journal of Computational Biology, 2008

Digraph searching, directed vertex separation and directed pathwidth.
Discrete Applied Mathematics, 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Searching Trees with Sources and Targets.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

On the Monotonicity of Weak Searching.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

On the Fast Searching Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Monotonicity of strong searching on digraphs.
J. Comb. Optim., 2007

Strong-mixed searching and pathwidth.
J. Comb. Optim., 2007

On the Tileability of Polygons with Colored Dominoes.
Discrete Mathematics & Theoretical Computer Science, 2007

Directed Searching Digraphs: Monotonicity and Complexity.
Proceedings of the Theory and Applications of Models of Computation, 2007

Lower Bounds on Edge Searching.
Proceedings of the Combinatorics, 2007

Non-breaking Similarity of Genomes with Gene Repetitions.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Searching Cycle-Disjoint Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2007

Arc Searching Digraphs Without Jumping.
Proceedings of the Combinatorial Optimization and Applications, 2007

Digraph Strong Searching: Monotonicity and Complexity.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
An Efficient Algorithm for Inference in Rough Set Flow Graphs.
, 2006

2005
The Computational Complexity of Inference Using Rough Set Flow Graphs.
Proceedings of the Rough Sets, 2005

On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On the Computation and Chromatic Number of Colored Domino Tilings.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Integer Programming Methods for Several Optimization Problems in Graph Theory.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2004
Minimal Tetrahedralizations of a Class of Polyhedra.
J. Comb. Optim., 2004

Detecting tetrahedralizations of a set of line segments.
J. Algorithms, 2004

Sweeping Graphs with Large Clique Number.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2002
Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2.
Discrete Mathematics, 2002

Algorithms and Complexity for Tetrahedralization Detections.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
A lower bound for beta-skeleton belonging to minimum weight triangulations.
Comput. Geom., 2001

2000
On Some Polyhedra Covering Problems.
J. Comb. Optim., 2000

Triangulations without minimum-weight drawing.
Inf. Process. Lett., 2000

The class Steiner minimal tree problem: a lower bound and test problem generation.
Acta Inf., 2000

Optimal Tetrahedralizations of Some Convex Polyhedra.
EuroCG, 2000

Tetrahedralization of Two Nested Convex Polyhedra.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Triangulations without Minimum-Weight Drawing.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

Minimal Tetrahedralizations of a Class of Polyhedra.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Maximum Weight Triangulation and Graph Drawing.
Inf. Process. Lett., 1999

A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Maximum Weight Triangulation and Graph Drawing.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Maximum Weight Triangulation and Its Application on Graph Drawing.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996
The Heuristics for the Constrained Multicast Routing.
Proceedings of the Concurrency and Parallelism, 1996

1995
A Better Subgraph of the Minimum Weight Triangulation.
Inf. Process. Lett., 1995

A Better Subgraph of the Minimum Weight Triangulation.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994


  Loading...