Online Exploration of All Vertices in a Simple Polygon. - Yuya Higashikawa; Naoki Katoh (FAW-AAIM, 2012)

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. - Siu-Wing Cheng; Yuya Higashikawa; Naoki Katoh; Guanqun Ni; Bing Su 002; Yinfeng Xu (TAMC, 2013)

Online Vertex Exploration Problems in a Simple Polygon. - Yuya Higashikawa; Naoki Katoh (IEICE Trans. Inf. Syst., 2013)

Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. - Yuya Higashikawa; Mordecai J. Golin; Naoki Katoh (CoRR, 2014)

Online graph exploration algorithms for cycles and trees by multiple searchers. - Yuya Higashikawa; Naoki Katoh; Stefan Langerman; Shin-ichi Tanigawa (J. Comb. Optim., 2014)

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. - Yuya Higashikawa; Mordecai J. Golin; Naoki Katoh (J. Graph Algorithms Appl., 2014)

An inductive construction of minimally rigid body-hinge simple graphs. - Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh; Naoyuki Kamiyama (Theor. Comput. Sci., 2014)

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)

Polynomial-time approximability of the k-Sink Location problem. - Rémy Belmonte; Yuya Higashikawa; Naoki Katoh; Yoshio Okamoto (CoRR, 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)

Minimax regret 1-sink location problem in dynamic path networks. - Yuya Higashikawa; John Augustine; Siu-Wing Cheng; Mordecai J. Golin; Naoki Katoh; Guanqun Ni; Bing Su 002; Yin-Feng Xu (Theor. Comput. Sci., 2015)

Multiple sink location problems in dynamic path networks. - Yuya Higashikawa; Mordecai J. Golin; Naoki Katoh (Theor. Comput. Sci., 2015)

Optimally bracing grid frameworks with holes. - Yoshihiko Ito; Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh; Sheung-Hung Poon; Maria Saumell (Theor. Comput. Sci., 2015)

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. - Guru Prakash Arumugam; John Augustine; Mordecai J. Golin; Yuya Higashikawa; Naoki Katoh; Prashanth Srikanthan (CoRR, 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)

Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs. - Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh; Adnan Sljoka (Inf. Process. Lett., 2016)

Minimum Point-Overlap Labeling. - Yuya Higashikawa; Keiko Imai; Yusuke Matsumoto; Noriyoshi Sukegawa; Yusuke Yokosuka (CIAC, 2017)

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)

The mixed evacuation problem. - Yosuke Hanawa; Yuya Higashikawa; Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa (J. Comb. Optim., 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)

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

A Survey on Facility Location Problems in Dynamic Flow Networks. - Yuya Higashikawa; Naoki Katoh (Rev. Socionetwork Strateg., 2019)

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". - Naoki Katoh; Yuya Higashikawa; Hiro Ito; Shun Kataoka; Takuya Kida; Toshiki Saitoh; Tetsuo Shibuya; Kazuyuki Tanaka; Yushi Uno (Rev. Socionetwork Strateg., 2019)

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Koji Watase (COCOA, 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)

Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. - Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh (COCOON, 2021)

Minimum point-overlap labelling. - Yuya Higashikawa; Keiko Imai; Takeharu Shiraga; Noriyoshi Sukegawa; Yusuke Yokosuka (Optim. Methods Softw., 2021)

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Koji Watase (Theor. Comput. Sci., 2021)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; László Kozma 002; Manuel Lafond; Günter Rote; Yuki Tokuni; Max Willert; Binhai Zhu (JCDCGGG, 2022)

The Line-Constrained Maximum Coverage Facility Location Problem. - Hiroki Maegawa; Naoki Katoh; Yuki Tokuni; Yuya Higashikawa (COCOA (1), 2023)

Red-Black Spanners for Mixed-Charging Vehicular Networks. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni; Binhai Zhu (COCOON (1), 2023)

On Computing a Center Persistence Diagram. - Yuya Higashikawa; Naoki Katoh; Guohui Lin; Eiji Miyano; Suguru Tamaki; Junichi Teruyama; Binhai Zhu (FCT, 2023)

Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni (CoRR, 2023)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; Manuel Lafond; Yuki Tokuni; Binhai Zhu (CoRR, 2023)

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. - Sergio Cabello; Éva Czabarka; Ruy Fabila Monroy; Yuya Higashikawa; Raimund Seidel; László Székely; Josef Tkadlec; Alexandra Wesolek (CoRR, 2023)

Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs. - Yuya Higashikawa; Naoki Katoh; Yuki Kobayashi (Int. J. Comput. Math. Comput. Syst. Theory, 2023)

Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. - Yuki Kawakami; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama; Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh (IEICE Trans. Inf. Syst., 2024)

Sink location problems in dynamic flow grid networks. - Yuya Higashikawa; Ayano Nishii; Junichi Teruyama; Yuki Tokuni (Theor. Comput. Sci., 2024)

Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights. - Tetsuya Fujie; Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni (J. Comb. Optim., 2024)

Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni (J. Comb. Optim., 2024)

Constructing red-black spanners for mixed-charging vehicular networks. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni; Binhai Zhu (Theor. Comput. Sci., 2025)

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)