| 2021 | ATMOS | Locating Evacuation Centers Optimally in Path and Cycle Networks. | Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama |
| 2019 | TAMC | Minmax-Regret Evacuation Planning for Cycle Networks. | Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2018 | ISAAC | 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 |
| 2018 | IWOCA | Minsum k-Sink Problem on Dynamic Flow Path Networks. | Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2017 | WADS | Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. | Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2016 | IWOCA | Minimax Regret 1-Median Problem in Dynamic Path Networks. | Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi |
| 2015 | DSAA | Improved algorithms for exact and approximate boolean matrix decomposition. | Yuan Sun, Shiwei Ye, Yi Sun, Tsunehiko Kameda |
| 2014 | COCOA | Optimizing Squares Covering a Set of Points. | Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song |
| 2014 | COCOA | Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. | Binay K. Bhattacharya, Tsunehiko Kameda |
| 2014 | COCOON | Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. | Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song |
| 2014 | LATIN | Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. | Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song |
| 2012 | COCOON | A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. | Binay K. Bhattacharya, Tsunehiko Kameda |
| 2012 | ISAAC | Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. | Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song |
| 2011 | ICTAC | Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. | Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi |
| 2010 | LATIN | Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. | Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang |
| 2009 | ICRA | Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. | Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang |
| 2008 | TAMC | A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. | John Z. Zhang, Tsunehiko Kameda |
| 2006 | IROS | Where to Build a Door. | John Z. Zhang, Tsunehiko Kameda |
| 2005 | ISAAC | An Optimization Problem Related to VoD Broadcasting. | Tsunehiko Kameda, Yi Sun, Luis A. Goddyn |