( en | de | ru )

 

Disambiguation of "Ko, Ming-Tat"

Author of the publication

copydeleteadd this publication to your clipboard
Node-searching problem on block graphs.

, , , and . Discret. Appl. Math., 156 (1): 55-75 (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.

Tat-Ming Au

Ming-Yung Ko

Ko-Ming Chen

Keykhosrow Tat

Manutschehr Tat

 

Other publications of authors with the same name

Bounded Fan-Out m-Center Problem., and . Inf. Process. Lett., 63 (2): 103-108 (1997)A New Subclass of Integer Linear Programming Problems and Its Applications., , , , and . IEEE Trans. Computers, 61 (12): 1813-1822 (2012)Linear-Time Algorithms for Tree Root Problems., , and . Algorithmica, 71 (2): 471-495 (2015)The 3-Steiner Root Problem., and . WG, volume 4769 of Lecture Notes in Computer Science, page 109-120. Springer, (2007)A simple self-collision avoidance for cloth animation., , and . Comput. Graph., 22 (1): 117-128 (1998)Image Registration Using a New Edge-Based Approach., , , , and . Comput. Vis. Image Underst., 67 (2): 112-130 (1997)A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree., , , , and . COCOON, volume 1449 of Lecture Notes in Computer Science, page 279-288. Springer, (1998)Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs., , , and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 77-86. Springer, (2002)Schedulable region for VBR media transmission with optimal resource allocation and utilization., , , and . Inf. Sci., 141 (1-2): 61-79 (2002)An Optimal Approximation Algorithm for the Rectilinear m-Center Problem., , and . Algorithmica, 5 (3): 341-352 (1990)