Tsunehiko Kameda

62 papers A* 1A 1B 7C 8Misc 2Journal 34Unranked 9

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