( en | de | ru )

 

Disambiguation of "Katoh, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning., , , and . SODA, page 896-904. ACM/SIAM, (2002)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)Approximation algorithms for combinatorial fractional programming problems., , , and . Math. Program., 37 (3): 255-267 (1987)An Algorithm for Finding K Minimum Spanning Trees., , and . SIAM J. Comput., 10 (2): 247-255 (1981)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)Polynomial-time approximability of the k-Sink Location problem., , , and . CoRR, (2015)Extended Formulations for Sparsity Matroids., , , , and . CoRR, (2014)Online graph exploration algorithms for cycles and trees by multiple searchers., , , and . J. Comb. Optim., 28 (2): 480-495 (2014)