Tsunehiko Kameda

According to our database, Tsunehiko Kameda authored at least 55 papers between 1970 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic.

Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Locating Evacuation Centers Optimally in Path and Cycle Networks.

Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Minsum <i>k</i>-sink problem on path networks.

Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Theor. Comput. Sci., 2020

Linear-time fitting of a k-step function.

Binay Bhattacharya, Sandip Das, Tsunehiko Kameda

Discret. Appl. Math., 2020

2019

Minmax-Regret Evacuation Planning for Cycle Networks.

Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Optimizing squares covering a set of points.

Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song

Theor. Comput. Sci., 2018

Minimax Regret 1-Median Problem in Dynamic Path Networks.

Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi

Theory Comput. Syst., 2018

Minsum k-Sink Problem on Path Networks.

Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

CoRR, 2018

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks.

Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

CoRR, 2018

Minsum k-Sink Problem on Dynamic Flow Path Networks.

Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.

Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.

Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

An alternative proof for the equivalence of ∞-searcher and 2-searcher.

Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita

Theor. Comput. Sci., 2016

Exact and approximate Boolean matrix decomposition with column-use condition.

Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda

Int. J. Data Sci. Anal., 2016

Improved Algorithms for Computing k-Sink on Dynamic Path Networks.

Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

CoRR, 2016

The p-Center Problem in Tree Networks Revisited.

Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015

Improved algorithms for computing minmax regret sinks on dynamic path and tree networks.

Binay K. Bhattacharya, Tsunehiko Kameda

Theor. Comput. Sci., 2015

Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks.

Binay Bhattacharya, Tsunehiko Kameda, Zhao Song

Discret. Appl. Math., 2015

Geometric k-Center Problems with Centers Constrained to Two Lines.

Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

CoRR, 2015

Geometric p-Center Problems with Centers Constrained to Two Lines.

Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Improved algorithms for exact and approximate boolean matrix decomposition.

Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda

Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics, 2015

2014

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network.

Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song

Algorithmica, 2014

Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles.

Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle.

Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network.

Binay K. Bhattacharya, Tsunehiko Kameda

Proceedings of the Combinatorial Optimization and Applications, 2014

Optimizing Squares Covering a Set of Points.

Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song

Proceedings of the Combinatorial Optimization and Applications, 2014

2012

Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights.

Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.

Binay K. Bhattacharya, Tsunehiko Kameda

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.

Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi

Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010

Finding All Door Locations that Make a Room Searchable.

Tsunehiko Kameda, John Z. Zhang

Int. J. Comput. Geom. Appl., 2010

Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight.

Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Generating asymptotically optimal broadcasting schedules to minimize average waiting time.

Yi Sun, Fei Ma, Tsunehiko Kameda

Discret. Math., 2009

Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing.

Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang

Proceedings of the 2009 IEEE International Conference on Robotics and Automation, 2009

2008

A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable.

John Z. Zhang, Tsunehiko Kameda

Proceedings of the Theory and Applications of Models of Computation, 2008

2006

Online polygon search by a seven-state boundary 1-searcher.

Tsunehiko Kameda, Masafumi Yamashita, Ichiro Suzuki

IEEE Trans. Robotics, 2006

Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit.

Mingjun Edward Yan, Tsunehiko Kameda

Discret. Appl. Math., 2006

Where to Build a Door.

John Z. Zhang, Tsunehiko Kameda

Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006

Characterization of Polygons Searchable by a Boundary 1-Searcher.

Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

An Optimal Solution to Room Search Problem.

Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling.

Yi Sun, Tsunehiko Kameda

Proceedings of the Advances in Multimedia Information Systems, 11th International Workshop, 2005

An Optimization Problem Related to VoD Broadcasting.

Tsunehiko Kameda, Yi Sun, Luis A. Goddyn

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2001

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.

Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda

Algorithmica, 2001

1999

Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct.

Masafumi Yamashita, Tsunehiko Kameda

IEEE Trans. Parallel Distributed Syst., 1999

Modeling K-coteries by well-covered graphs.

Masafumi Yamashita, Tsunehiko Kameda

Networks, 1999

1998

Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.

Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda

Inf. Process. Lett., 1998

1997

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract).

Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Computing on Anonymous Networks: Part II-Decision and Membership Problems.

Masafumi Yamashita, Tsunehiko Kameda

IEEE Trans. Parallel Distributed Syst., 1996

Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases.

Masafumi Yamashita, Tsunehiko Kameda

IEEE Trans. Parallel Distributed Syst., 1996

1995

Optimal Coteries for Rings and Related Networks.

Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda

Distributed Comput., 1995

1994

A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data.

Tsunehiko Kameda, J. Ting, D. Fracchia

Proceedings of the Protocols for High-Speed Networks IV, 1994

1982

Deadlock-Free Systems for a Bounded Number of Processes.

Toshihide Ibaraki, Tsunehiko Kameda

IEEE Trans. Computers, 1982

1981

On Minimal Test Sets for Locating Single Link Failures in Networks.

Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida

IEEE Trans. Computers, 1981

1970

On the State Minimization of Nondeterministic Finite Automata.

Tsunehiko Kameda, Peter Weiner

IEEE Trans. Computers, 1970

R70-39 On the Relational Homomorphisms of Automata.

Tsunehiko Kameda

IEEE Trans. Computers, 1970

R70-23 Multi-Tape and Multi-Head Pushdown Automata.

Tsunehiko Kameda

IEEE Trans. Computers, 1970