Tsunehiko Kameda

Publication Activity (10 Years)

Years Active: 1970-2022
Publications (10 Years): 27

Top Topics

Exact And Approximate

Matrix Decomposition

Improved Algorithm

Top Venues

Theor. Comput. Sci.

Publications

Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. CCCG (2022)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS (2021)
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-time fitting of a k-step function. Discret. Appl. Math. 280 (2020)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
-sink problem on path networks. Theor. Comput. Sci. 806 (2020)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC (2019)
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR (2018)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA (2018)
Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song
Optimizing squares covering a set of points. Theor. Comput. Sci. 729 (2018)
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC (2018)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minsum k-Sink Problem on Path Networks. CoRR (2018)
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
Minimax Regret 1-Median Problem in Dynamic Path Networks. Theory Comput. Syst. 62 (6) (2018)
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS (2017)
Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda
Exact and approximate Boolean matrix decomposition with column-use condition. Int. J. Data Sci. Anal. 1 (3-4) (2016)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The $p$-Center Problem in Tree Networks Revisited. CoRR (2016)
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-Time Fitting of a k-Step Function. CALDAM (2016)
Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita
An alternative proof for the equivalence of ∞-searcher and 2-searcher. Theor. Comput. Sci. 634 (2016)
Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR (2016)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The p-Center Problem in Tree Networks Revisited. SWAT (2016)
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
Minimax Regret 1-Median Problem in Dynamic Path Networks. IWOCA (2016)
Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda
Improved algorithms for exact and approximate boolean matrix decomposition. DSAA (2015)
Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda
Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition. CoRR (2015)
Binay K. Bhattacharya, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Hirotaka Ono, Yota Otachi
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR (2015)
Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG (2015)
Binay Bhattacharya, Tsunehiko Kameda, Zhao Song
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discret. Appl. Math. 195 (2015)
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
Minimax Regret 1-Median Problem in Dynamic Path Networks. CoRR (2015)
Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-Time Fitting of a $k$-Step Function. CoRR (2015)
Binay K. Bhattacharya, Tsunehiko Kameda
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. 607 (2015)
Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song
Optimizing Squares Covering a Set of Points. COCOA (2014)
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70 (1) (2014)
Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON (2014)
Binay K. Bhattacharya, Tsunehiko Kameda
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. COCOA (2014)
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. LATIN (2014)
Binay K. Bhattacharya, Tsunehiko Kameda
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON (2012)
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC (2012)
Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC (2011)
Tsunehiko Kameda, John Z. Zhang
Finding All Door Locations that Make a Room Searchable. Int. J. Comput. Geom. Appl. 20 (2) (2010)
Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. LATIN (2010)
Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang
Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA (2009)
Yi Sun, Fei Ma, Tsunehiko Kameda
Generating asymptotically optimal broadcasting schedules to minimize average waiting time. Discret. Math. 309 (18) (2009)
John Z. Zhang, Tsunehiko Kameda
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. TAMC (2008)
Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda
An Optimal Solution to Room Search Problem. CCCG (2006)
Mingjun Edward Yan, Tsunehiko Kameda
Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit. Discret. Appl. Math. 154 (16) (2006)
Tsunehiko Kameda, Masafumi Yamashita, Ichiro Suzuki
Online polygon search by a seven-state boundary 1-searcher. IEEE Trans. Robotics 22 (3) (2006)
John Z. Zhang, Tsunehiko Kameda
Where to Build a Door. IROS (2006)
Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita
Characterization of Polygons Searchable by a Boundary 1-Searcher. CCCG (2006)
Tsunehiko Kameda, Yi Sun, Luis A. Goddyn
An Optimization Problem Related to VoD Broadcasting. ISAAC (2005)
Yi Sun, Tsunehiko Kameda
Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling. Multimedia Information Systems (2005)
Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. Algorithmica 31 (2) (2001)
Masafumi Yamashita, Tsunehiko Kameda
Modeling K-coteries by well-covered graphs. Networks 34 (3) (1999)
Masafumi Yamashita, Tsunehiko Kameda
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distributed Syst. 10 (9) (1999)
Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. Inf. Process. Lett. 66 (1) (1998)
Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). SCG (1997)
Masafumi Yamashita, Tsunehiko Kameda
Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distributed Syst. 7 (1) (1996)
Masafumi Yamashita, Tsunehiko Kameda
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. IEEE Trans. Parallel Distributed Syst. 7 (1) (1996)
Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
Optimal Coteries for Rings and Related Networks. Distributed Comput. 8 (4) (1995)
Tsunehiko Kameda, J. Ting, D. Fracchia
A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data. Protocols for High-Speed Networks (1994)
Toshihide Ibaraki, Tsunehiko Kameda
Deadlock-Free Systems for a Bounded Number of Processes. IEEE Trans. Computers 31 (3) (1982)
Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida
On Minimal Test Sets for Locating Single Link Failures in Networks. IEEE Trans. Computers 30 (3) (1981)
Tsunehiko Kameda
R70-39 On the Relational Homomorphisms of Automata. IEEE Trans. Computers 19 (10) (1970)
Tsunehiko Kameda, Peter Weiner
On the State Minimization of Nondeterministic Finite Automata. IEEE Trans. Computers 19 (7) (1970)
Tsunehiko Kameda
R70-23 Multi-Tape and Multi-Head Pushdown Automata. IEEE Trans. Computers 19 (7) (1970)