( en | de | ru )

 

Disambiguation of "Kameda, Tsunehiko"

Author of the publication

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

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.

Genn Kameda

 

Other publications of authors with the same name

Computing on Anonymous Networks: Part II-Decision and Membership Problems., and . IEEE Trans. Parallel Distributed Syst., 7 (1): 90-96 (1996)Optimizing squares covering a set of points., , , , , and . Theor. Comput. Sci., (2018)Characterization of Polygons Searchable by a Boundary 1-Searcher., , and . CCCG, (2006)An Optimal Solution to Room Search Problem., , , and . CCCG, (2006)Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights., , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 588-597. Springer, (2012)Finding All Door Locations that Make a Room Searchable., and . Int. J. Comput. Geom. Appl., 20 (2): 175-201 (2010)Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct., and . IEEE Trans. Parallel Distributed Syst., 10 (9): 878-887 (1999)Exact and approximate Boolean matrix decomposition with column-use condition., , , and . Int. J. Data Sci. Anal., 1 (3-4): 199-214 (2016)A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data., , and . Protocols for High-Speed Networks, volume 8 of IFIP Conference Proceedings, page 260-275. Chapman & Hall, (1994)A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree., and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 1-12. Springer, (2012)