default search action
Tsunehiko Kameda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c28]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: 40-47 - 2021
- [c27]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - 2020
- [j25]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
:
Linear-time fitting of a k-step function. Discret. Appl. Math. 280: 43-52 (2020) - [j24]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. Theor. Comput. Sci. 806: 388-401 (2020)
2010 – 2019
- 2019
- [c26]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC 2019: 42-58 - 2018
- [j23]Yuya Higashikawa, Siu-Wing Cheng
Minimax Regret 1-Median Problem in Dynamic Path Networks. Theory Comput. Syst. 62(6): 1392-1408 (2018) - [j22]Sergey Bereg
Optimizing squares covering a set of points. Theor. Comput. Sci. 729: 68-83 (2018) - [c25]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: 14:1-14:13 - [c24]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA 2018: 78-89 - [i8]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR abs/1806.00814 (2018) - [i7]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Path Networks. CoRR abs/1810.10631 (2018) - 2017
- [c23]Binay Bhattacharya, Mordecai J. Golin
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - 2016
- [j21]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): 199-214 (2016) - [j20]Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita:
An alternative proof for the equivalence of ∞-searcher and 2-searcher. Theor. Comput. Sci. 634: 108-119 (2016) - [c22]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a k-Step Function. CALDAM 2016: 85-96 - [c21]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. IWOCA 2016: 122-134 - [c20]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The p-Center Problem in Tree Networks Revisited. SWAT 2016: 6:1-6:15 - [i6]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The $p$-Center Problem in Tree Networks Revisited. CoRR abs/1604.07535 (2016) - [i5]Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR abs/1609.01373 (2016) - 2015
- [j19]Binay Bhattacharya, Tsunehiko Kameda, Zhao Song
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discret. Appl. Math. 195: 18-30 (2015) - [j18]Binay K. Bhattacharya, Tsunehiko Kameda:
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. 607: 411-425 (2015) - [c19]Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda:
Improved algorithms for exact and approximate boolean matrix decomposition. DSAA 2015: 1-10 - [c18]Binay Bhattacharya, Ante Custic
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [i4]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. CoRR abs/1509.07600 (2015) - [i3]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - [i2]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a $k$-Step Function. CoRR abs/1512.07537 (2015) - [i1]Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda:
Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition. CoRR abs/1512.08041 (2015) - 2014
- [j17]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70(1): 2-21 (2014) - [c17]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra
Optimizing Squares Covering a Set of Points. COCOA 2014: 37-52 - [c16]Binay K. Bhattacharya, Tsunehiko Kameda:
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. COCOA 2014: 146-160 - [c15]Binay K. Bhattacharya, Minati De
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428 - [c14]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. LATIN 2014: 330-341 - 2012
- [c13]Binay K. Bhattacharya, Tsunehiko Kameda:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON 2012: 1-12 - [c12]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC 2012: 588-597 - 2011
- [c11]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: 45-61 - 2010
- [j16]Tsunehiko Kameda, John Z. Zhang:
Finding All Door Locations that Make a Room Searchable. Int. J. Comput. Geom. Appl. 20(2): 175-201 (2010) - [c10]Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang:
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. LATIN 2010: 84-95
2000 – 2009
- 2009
- [j15]Yi Sun, Fei Ma, Tsunehiko Kameda:
Generating asymptotically optimal broadcasting schedules to minimize average waiting time. Discret. Math. 309(18): 5714-5723 (2009) - [c9]Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang:
Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA 2009: 2461-2466 - 2008
- [c8]John Z. Zhang, Tsunehiko Kameda:
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. TAMC 2008: 502-513 - 2006
- [j14]Mingjun Edward Yan, Tsunehiko Kameda:
Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit. Discret. Appl. Math. 154(16): 2418-2429 (2006) - [j13]Tsunehiko Kameda, Masafumi Yamashita, Ichiro Suzuki:
Online polygon search by a seven-state boundary 1-searcher. IEEE Trans. Robotics 22(3): 446-460 (2006) - [c7]Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda:
An Optimal Solution to Room Search Problem. CCCG 2006 - [c6]Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita:
Characterization of Polygons Searchable by a Boundary 1-Searcher. CCCG 2006 - [c5]John Z. Zhang, Tsunehiko Kameda:
Where to Build a Door. IROS 2006: 4084-4090 - 2005
- [c4]Tsunehiko Kameda, Yi Sun, Luis A. Goddyn:
An Optimization Problem Related to VoD Broadcasting. ISAAC 2005: 116-125 - [c3]Yi Sun, Tsunehiko Kameda:
Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling. Multimedia Information Systems 2005: 190-206 - 2001
- [j12]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): 208-236 (2001)
1990 – 1999
- 1999
- [j11]Masafumi Yamashita, Tsunehiko Kameda:
Modeling K-coteries by well-covered graphs. Networks 34(3): 221-228 (1999) - [j10]Masafumi Yamashita, Tsunehiko Kameda:
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distributed Syst. 10(9): 878-887 (1999) - 1998
- [j9]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): 49-52 (1998) - 1997
- [c2]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: 448-450 - 1996
- [j8]Masafumi Yamashita, Tsunehiko Kameda:
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. IEEE Trans. Parallel Distributed Syst. 7(1): 69-89 (1996) - [j7]Masafumi Yamashita, Tsunehiko Kameda:
Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distributed Syst. 7(1): 90-96 (1996) - 1995
- [j6]Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda:
Optimal Coteries for Rings and Related Networks. Distributed Comput. 8(4): 191-201 (1995) - 1994
- [c1]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: 260-275
1980 – 1989
- 1982
- [j5]Toshihide Ibaraki, Tsunehiko Kameda:
Deadlock-Free Systems for a Bounded Number of Processes. IEEE Trans. Computers 31(3): 188-193 (1982) - 1981
- [j4]Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida:
On Minimal Test Sets for Locating Single Link Failures in Networks. IEEE Trans. Computers 30(3): 182-190 (1981)
1970 – 1979
- 1970
- [j3]Tsunehiko Kameda, Peter Weiner:
On the State Minimization of Nondeterministic Finite Automata. IEEE Trans. Computers 19(7): 617-627 (1970) - [j2]Tsunehiko Kameda:
R70-23 Multi-Tape and Multi-Head Pushdown Automata. IEEE Trans. Computers 19(7): 659-660 (1970) - [j1]Tsunehiko Kameda:
R70-39 On the Relational Homomorphisms of Automata. IEEE Trans. Computers 19(10): 987 (1970)
Coauthor Index
aka: Binay Bhattacharya
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: