( en | de | ru )

 

Disambiguation of "Yang, Boting"

Author of the publication

copydeleteadd this publication to your clipboard
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.

, , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 630-641. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yang Yang

Yang Yang

Yang Yang

Yang Yang

Yang Yang

 

Other publications of authors with the same name

Lower bounds for positive semidefinite zero forcing and their applications.. J. Comb. Optim., 33 (1): 81-105 (2017)Correction to: Properties of a q-Analogue of Zero Forcing., , , , , , , , and . Graphs Comb., 36 (5): 1421-1422 (2020)Directed Searching Digraphs: Monotonicity and Complexity., and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 136-147. Springer, (2007)Sweeping Graphs with Large Clique Number., , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 908-920. Springer, (2004)On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 859-868. Springer, (2005)Algorithms and Complexity for Tetrahedralization Detections., , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 296-307. Springer, (2002)Searching Trees with Sources and Targets., and . FAW, volume 5059 of Lecture Notes in Computer Science, page 174-185. Springer, (2008)Fast Searching on Cartesian Products of Graphs., and . TAMC, volume 10185 of Lecture Notes in Computer Science, page 669-683. (2017)Positive Semidefinite Zero Forcing: Complexity and Lower Bounds.. WADS, volume 9214 of Lecture Notes in Computer Science, page 629-639. Springer, (2015)Euclidean Chains and Their Shortcuts.. COCOA, volume 6831 of Lecture Notes in Computer Science, page 141-155. Springer, (2011)