Selected Publications

  1. Binay Bhattacharya, Mordicai Golin, Yuya Higashikawa, Tiko Kameda, and Naoki Katoh, Improved algorithms for computing k-sink on dynamic flow path networks, Proc. WADS, St. Johns, Canada, Aug. 2017. LNCS10389, To appear.
  2. Binay Bhattacharya, Sandip Das, and Tsunehiko Kameda, Line-constrained k-center problem, Proc. WAAC, Hakodate, Japan, Sept. 2016.
  3. Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tiko Kameda, and Naoki Katoh, The p-center problem with centers constrained to two perpendicular lines, Proc. JCDCG^3, Tokyo, Sept. 2016.
  4. Yuan Sun, Shiwei Ye, Yi Sun and Tsunehiko Kameda, Exact and approximate Boolean matrix decomposition with column-use condition, Int'l J. of Data Science and Analytics, 1(3), pp. 199-214, 2016. DOI: 10.1007/s41060-016-0012-3.
  5. Tsunehiko Kameda, Ichiro Suzuki, and Masafumi Yamashita, An alternative proof for the equivalence of \infty-searcher and 2-searcher, Theoretical Computer Science, vol. 634, pp. 108-119, 2016.
  6. Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tiko Kameda, and Naoki Katoh, The p-center problem with centers constrained to two lines, Proc. JCDCGG: Discrete and Computational Geometry and Graphs, Tokyo, Sept. 2016,LNCS 9943, Springer, DOI:10.1007/978-3-319-48532-4_3.
  7. Aritra Banik,Binay Bhattacharya, Sandip Das,Tsunehiko Kamedaxa, Zhao Song, The p-center problem in tree networks revisited, Proc. SWAT, Reykjavik, June 2016, pp.6:1--6:15.
  8. Binay Bhattacharya, Sandip Das, and Tsunehiko Kameda, Linear-time fitting of a k-step function, Proc. CALDAM, Thiruvanthapuram, Kerala, India, Feb. 2016, LNCS 9602, pp. 1-12.
  9. Sergey Bereg, Binay Bhattacharya,Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, and Zhao Song, Optimizing squares covering a set of points, Theoretical Computer Science, Dec. 2015. http://dx.doi.org/10.1016/j.tcs.2015.11.029
  10. Yuan Sun, Shiwei Ye, Yi Sun and Tsunehiko Kameda, Improved algorithms for exact and approximate Boolean matrix decomposition, IEEE/ACM Int. Conf. on Data Science and Advanced Analytics (DSAA), Paris, Oct. 2015.
  11. Binay Bhattacharya and Tshuehiko Kameda, Improved algorithms for computing minmax regret sinks on dynamic path and tree networks, Theoretical Computer Science, vol. 607, pp. 411-425, Nov. 2015.
  12. Sergey Bereg, Binay Bhattacharya, Sandip Das, and Tiko Kameda, Geometric k-center problem with centers constrained to two parallel lines, Proc. JCDCGG, Kyoto, September 2015, pp. 94-95.
  13. Binay Bhattacharya and Tshuehiko Kameda, Improved algorithms for computing minmax regret 1-sink and 2-sink on path network, Proc. COCOA, Maui, Dec. 2014, pp. 146-160.
  14. Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, and Zhao Song, Optimizing squares covering a set of points, Proc. COCOA, Maui, Dec. 2014, pp. 37-52.
  15. Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song, Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks, Discrete Applied Mathematics, In press.
  16. Binay Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, and Zhao Song, Back-up 2-center on a path/tree/cycle/unicucle Proc. COCOON, Atlanta, August 2014, LNCS 8591 pp. 417-428.
  17. Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song, Improved minmax regret 1-center for cactus networks with c cycles, Proc. LATIN, Montevideo,Uruguay, April 2014, LNCS 8392 pp. 330-341.
  18. Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song, A linear time algorithm for computing minmax regret 1-median on a tree, Algorithmica, Vol. 10, issue 1, pp. 2-21, 2014. DOI 10.1007/s00453-013-9851-7
  19. Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song, Minmax regret 1-median on a path/cycle, Proc. JCDCGG, Tokyo, Sep. 2013.
  20. Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song, Computing minmax regret 1-median on a tree network with positive/negative vertex weights, Proc. ISAAC, Taipei, Dec. 2012, LNCS 7676, pp. 588-597.
  21. Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song, Minmax regret 1-center on a path/cycle/tree, Proc. ADVCOMP, IARIA, Barcelona, Sept. 2012, pp. 108-113.
  22. Binay Bhattacharya and Tsunehiko Kameda, A linear time algorithm for computing minmax regret 1-median on a tree, Proc. COCOON, Sydney, Aug. 2012, LNCS7434, Springer-Verlag, pp. 1-12.
  23. E. Ando, B. Bhattacharya, Y. Hu, T. Kameda, Q. Shi, Selecting good a priori sequences for vehicle routning with stochastic demand, Proc. ICTAC, Johannesberg, S. Africa, LNCS 6916, Springer-Verlag, pp. 45-61.
  24. T. Kameda, I Suzuki and Z.J. Zhang, Finding the minimum-distance schedule for a boundary searcher with a flashlight, Proc. LATIN, April 2010, Oaxaca, Mexico. pp. 84-95.
  25. T. Kameda and Z.J. Zhang, An efficient algorithm for finding all door locations that make a room searchable, Intn'l J. of Computational Geometry and Applications, 22 (Apr. 2010), pp. 175-201.

Back to Dr. Kameda's Home Page