( en | de | ru )

 

Disambiguation of "Katoh, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
Polyline Fitting of Planar Points Under Min-sum Criteria.

, , , , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 77-88. Springer, (2004)

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.

Eishow Katoh

Eishow Katoh

Naoki Yoshida

Marcus Katoh

Eishow Katoh

 

Other publications of authors with the same name

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks., , , , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)Minsum k-sink problem on path networks., , , , and . Theor. Comput. Sci., (2020)Approximation algorithms for combinatorial fractional programming problems., , , and . Math. Program., 37 (3): 255-267 (1987)Online graph exploration algorithms for cycles and trees by multiple searchers., , , and . J. Comb. Optim., 28 (2): 480-495 (2014)On the Infinitesimal Rigidity of Bar-and-Slider Frameworks., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 524-533. Springer, (2009)A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 802-811. Springer, (2009)Number Theory Helps Line Detection in Digital Images., and . ISAAC, volume 762 of Lecture Notes in Computer Science, page 313-322. Springer, (1993)A Study of the LMT-Skeleton., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 256-265. Springer, (1996)Resource allocation problems - algorithmic approaches., and . MIT Press series in the foundations of computing MIT Press, (1988)Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree., and . Inf. Process. Lett., 48 (5): 211-213 (1993)