( en | de | ru )

 

Disambiguation of "Katoh, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
Optimally bracing grid frameworks with holes.

, , , , , and . Theor. Comput. Sci., (2015)

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

An Algorithm for Finding K Minimum Spanning Trees., , and . SIAM J. Comput., 10 (2): 247-255 (1981)Approximation algorithms for combinatorial fractional programming problems., , , and . Math. Program., 37 (3): 255-267 (1987)Continuous Folding of Regular Dodecahedra., , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 120-131. Springer, (2015)Geometric p-Center Problems with Centers Constrained to Two Lines., , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 24-36. Springer, (2015)Extended Formulations for Sparsity Matroids., , , , and . CoRR, (2014)Polynomial-time approximability of the k-Sink Location problem., , , and . CoRR, (2015)Minsum k-Sink Problem on Path Networks., , , , and . CoRR, (2018)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)