R70-23 Multi-Tape and Multi-Head Pushdown Automata. - Tsunehiko Kameda (IEEE Trans. Computers, 1970)

R70-39 On the Relational Homomorphisms of Automata. - Tsunehiko Kameda (IEEE Trans. Computers, 1970)

On the State Minimization of Nondeterministic Finite Automata. - Tsunehiko Kameda; Peter Weiner (IEEE Trans. Computers, 1970)

On Minimal Test Sets for Locating Single Link Failures in Networks. - Toshihide Ibaraki; Tsunehiko Kameda; Shunichi Toida (IEEE Trans. Computers, 1981)

Deadlock-Free Systems for a Bounded Number of Processes. - Toshihide Ibaraki; Tsunehiko Kameda (IEEE Trans. Computers, 1982)

A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data. - Tsunehiko Kameda; J. Ting; D. Fracchia (Protocols for High-Speed Networks, 1994)

Optimal Coteries for Rings and Related Networks. - Toshihide Ibaraki; Hiroshi Nagamochi; Tsunehiko Kameda (Distributed Comput., 1995)

Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. - Masafumi Yamashita; Tsunehiko Kameda (IEEE Trans. Parallel Distributed Syst., 1996)

Computing on Anonymous Networks: Part II-Decision and Membership Problems. - Masafumi Yamashita; Tsunehiko Kameda (IEEE Trans. Parallel Distributed Syst., 1996)

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). - Masafumi Yamashita; Hideki Umemoto; Ichiro Suzuki; Tsunehiko Kameda (SCG, 1997)

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)

Modeling K-coteries by well-covered graphs. - Masafumi Yamashita; Tsunehiko Kameda (Networks, 1999)

Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. - Masafumi Yamashita; Tsunehiko Kameda (IEEE Trans. Parallel Distributed Syst., 1999)

Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. - Masafumi Yamashita; Hideki Umemoto; Ichiro Suzuki; Tsunehiko Kameda (Algorithmica, 2001)

An Optimization Problem Related to VoD Broadcasting. - Tsunehiko Kameda; Yi Sun; Luis A. Goddyn (ISAAC, 2005)

Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling. - Yi Sun; Tsunehiko Kameda (Multimedia Information Systems, 2005)

An Optimal Solution to Room Search Problem. - Binay K. Bhattacharya; John Z. Zhang; Qiaosheng Shi; Tsunehiko Kameda (CCCG, 2006)

Characterization of Polygons Searchable by a Boundary 1-Searcher. - Tsunehiko Kameda; John Z. Zhang; Masafumi Yamashita (CCCG, 2006)

Where to Build a Door. - John Z. Zhang; Tsunehiko Kameda (IROS, 2006)

Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit. - Mingjun Edward Yan; Tsunehiko Kameda (Discret. Appl. Math., 2006)

Online polygon search by a seven-state boundary 1-searcher. - Tsunehiko Kameda; Masafumi Yamashita; Ichiro Suzuki (IEEE Trans. Robotics, 2006)

A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. - John Z. Zhang; Tsunehiko Kameda (TAMC, 2008)

Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. - Binay K. Bhattacharya; Tsunehiko Kameda; John Z. Zhang (ICRA, 2009)

Generating asymptotically optimal broadcasting schedules to minimize average waiting time. - Yi Sun; Fei Ma; Tsunehiko Kameda (Discret. Math., 2009)

Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. - Tsunehiko Kameda; Ichiro Suzuki; John Z. Zhang (LATIN, 2010)

Finding All Door Locations that Make a Room Searchable. - Tsunehiko Kameda; John Z. Zhang (Int. J. Comput. Geom. Appl., 2010)

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. - Ei Ando; Binay K. Bhattacharya; Yuzhuang Hu; Tsunehiko Kameda; Qiaosheng Shi (ICTAC, 2011)

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. - Binay K. Bhattacharya; Tsunehiko Kameda (COCOON, 2012)

Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. - Binay K. Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (ISAAC, 2012)

Optimizing Squares Covering a Set of Points. - Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Priya Ranjan Sinha Mahapatra; Zhao Song 002 (COCOA, 2014)

Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. - Binay K. Bhattacharya; Tsunehiko Kameda (COCOA, 2014)

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. - Binay K. Bhattacharya; Minati De; Tsunehiko Kameda; Sasanka Roy; Vladyslav Sokol; Zhao Song 002 (COCOON, 2014)

Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. - Binay K. Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (LATIN, 2014)

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. - Binay K. Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (Algorithmica, 2014)

Improved algorithms for exact and approximate boolean matrix decomposition. - Yuan Sun 006; Shiwei Ye; Yi Sun; Tsunehiko Kameda (DSAA, 2015)

Geometric p-Center Problems with Centers Constrained to Two Lines. - Binay Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (JCDCGG, 2015)

Geometric k-Center Problems with Centers Constrained to Two Lines. - Binay K. Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2015)

Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. - Binay Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (Discret. Appl. Math., 2015)

Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. - Binay K. Bhattacharya; Tsunehiko Kameda (Theor. Comput. Sci., 2015)

The p-Center Problem in Tree Networks Revisited. - Aritra Banik; Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Zhao Song 002 (SWAT, 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)

Exact and approximate Boolean matrix decomposition with column-use condition. - Yuan Sun 006; Shiwei Ye; Yi Sun; Tsunehiko Kameda (Int. J. Data Sci. Anal., 2016)

An alternative proof for the equivalence of ∞-searcher and 2-searcher. - Tsunehiko Kameda; Ichiro Suzuki; Masafumi Yamashita (Theor. Comput. Sci., 2016)

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. - Binay Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (WADS, 2017)

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 (ISAAC, 2018)

Minsum k-Sink Problem on Dynamic Flow Path Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (IWOCA, 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 Path Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 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)

Optimizing squares covering a set of points. - Sergey Bereg; Binay Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Priya Ranjan Sinha Mahapatra; Zhao Song 002 (Theor. Comput. Sci., 2018)

Minmax-Regret Evacuation Planning for Cycle Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (TAMC, 2019)

Linear-time fitting of a k-step function. - Binay Bhattacharya; Sandip Das 001; Tsunehiko Kameda (Discret. Appl. Math., 2020)

Minsum k-sink problem on path networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (Theor. Comput. Sci., 2020)

Locating Evacuation Centers Optimally in Path and Cycle Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh; Junichi Teruyama (ATMOS, 2021)

A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. - Binay Bhattacharya; Tsunehiko Kameda; Amirhossein Mozafari (CCCG, 2022)

Improved algorithms for optimal k sink location on path networks. - Binay Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (Theor. Comput. Sci., 2025)