( en | de | ru )

 

Disambiguation of "Katoh, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
Enumerating Non-crossing Minimally Rigid Frameworks.

, , , , and . Graphs Comb., 23 (Supplement-1): 117-134 (2007)

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

Naoki Yoshida

Eishow Katoh

Marcus Katoh

Eishow Katoh

 

Other publications of authors with the same name

Foreword.. Algorithmica, 44 (2): 101-101 (2006)A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems., , and . Inf. Process. Lett., 64 (5): 255-261 (1997)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)Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k., , , and . STOC, page 275-283. ACM, (1997)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 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)