( en | de | ru )

 

Disambiguation of "Kameda, Tsunehiko"

Author of the publication

copydeleteadd this publication to your clipboard
Minimax Regret 1-Median Problem in Dynamic Path Networks.

, , , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 122-134. Springer, (2016)

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)Linear-Time Fitting of a k-Step Function., , and . CALDAM, volume 9602 of Lecture Notes in Computer Science, page 85-96. Springer, (2016)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)Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers., , , and . Algorithmica, 31 (2): 208-236 (2001)R70-23 Multi-Tape and Multi-Head Pushdown Automata.. IEEE Trans. Computers, 19 (7): 659-660 (1970)Finding All Door Locations that Make a Room Searchable., and . Int. J. Comput. Geom. Appl., 20 (2): 175-201 (2010)