( en | de | ru )

 

Disambiguation of "Katoh, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.

, , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 133-144. Springer, (2017)

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

Polynomial-Time Solutions to Image Segmentation., , , and . SODA, page 104-113. ACM/SIAM, (1996)An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks., , , and . ISAAC, volume 123 of LIPIcs, page 14:1-14:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Covering directed graphs by in-trees., and . J. Comb. Optim., 21 (1): 2-18 (2011)The Fair Resource Allocation Problem with Submodular Constraints., , and . Math. Oper. Res., 13 (1): 164-173 (1988)Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities., , , , , and . CoRR, (2016)A Proof of the Molecular Conjecture.. ISAAC, volume 5878 of Lecture Notes in Computer Science, page 2-3. Springer, (2009)Approximating Uniform Triangular Meshes for Spheres., , and . JCDCG, volume 2098 of Lecture Notes in Computer Science, page 192-204. Springer, (2000)Minmax-Regret Evacuation Planning for Cycle Networks., , , , and . TAMC, volume 11436 of Lecture Notes in Computer Science, page 42-58. Springer, (2019)Enumerating Constrained Non-crossing Geometric Spanning Trees., and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 243-253. Springer, (2007)Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths., and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 161-172. Springer, (2006)