( 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 . Int. J. Comput. Geom. Appl., 16 (2-3): 97-116 (2006)

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

Resource allocation problems - algorithmic approaches., and . MIT Press series in the foundations of computing MIT Press, (1988)A Rooted-Forest Partition with Uniform Vertex Demand., and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 179-190. Springer, (2010)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)Online Exploration of All Vertices in a Simple Polygon., and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths., , and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 178-190. Springer, (2007)Multiple Sink Location Problems in Dynamic Path Networks., , and . AAIM, volume 8546 of Lecture Notes in Computer Science, page 149-161. Springer, (2014)Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior., , and . Discovery Science, volume 1967 of Lecture Notes in Computer Science, page 263-267. Springer, (2000)A Study of the LMT-Skeleton., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 256-265. Springer, (1996)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)