Naoki Katoh

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 37

Top Venues

CoRR

Theor. Comput. Sci.

COCOA

COCOA (1)

Publications

Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. IEICE Trans. Inf. Syst. 107 (6) (2024)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. FCT (2023)
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges. COCOA (1) (2023)
Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa
The Line-Constrained Maximum Coverage Facility Location Problem. COCOA (1) (2023)
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges. CoRR (2023)
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG (2023)
Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu
Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) (2023)
Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu
The Two-Squirrel Problem and Its Relatives. CoRR (2023)
Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi
Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs. Int. J. Comput. Math. Comput. Syst. Theory 8 (1) (2023)
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
-sink problems on dynamic flow path networks. Theor. Comput. Sci. 873 (2021)
Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. COCOON (2021)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS (2021)
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. WALCOM (2021)
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. COCOA (2020)
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. CoRR (2020)
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. CoRR (2020)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
-sink problem on path networks. Theor. Comput. Sci. 806 (2020)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. CoRR (2019)
Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13 (2) (2019)
Yuya Higashikawa, Naoki Katoh
A Survey on Facility Location Problems in Dynamic Flow Networks. Rev. Socionetwork Strateg. 13 (2) (2019)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC (2019)
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR (2018)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA (2018)
Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
The mixed evacuation problem. J. Comb. Optim. 36 (4) (2018)
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)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minsum k-Sink Problem on Path Networks. CoRR (2018)
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
Minimax Regret 1-Median Problem in Dynamic Path Networks. Theory Comput. Syst. 62 (6) (2018)
Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh
A population-based algorithm for solving linear assignment problems with two objectives. Comput. Oper. Res. 79 (2017)
Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017)
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS (2017)
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
Extended formulations for sparsity matroids. Math. Program. 158 (1-2) (2016)
Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Adnan Sljoka
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs. Inf. Process. Lett. 116 (2) (2016)
Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
The Mixed Evacuation Problem. COCOA (2016)
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. CoRR (2016)
Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR (2016)
Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa
On the edge crossing properties of Euclidean minimum weight Laman graphs. Comput. Geom. 51 (2016)
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
Minimax Regret 1-Median Problem in Dynamic Path Networks. IWOCA (2016)
Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto
Polynomial-time approximability of the k-Sink Location problem. CoRR (2015)
Binay K. Bhattacharya, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Hirotaka Ono, Yota Otachi
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR (2015)
Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG (2015)
Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell
Optimally bracing grid frameworks with holes. Theor. Comput. Sci. 607 (2015)
Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
Straight-line Drawability of a Planar Graph Plus an Edge. CoRR (2015)
Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
Straight-Line Drawability of a Planar Graph Plus an Edge. WADS (2015)
Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. 607 (2015)
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
Minimax Regret 1-Median Problem in Dynamic Path Networks. CoRR (2015)
Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara
Continuous Folding of Regular Dodecahedra. JCDCGG (2015)
Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588 (2015)
Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72 (4) (2015)
Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
Multiple Sink Location Problems in Dynamic Path Networks. AAIM (2014)
Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell
Optimally Bracing Grid Frameworks with Holes. COCOA (2014)
Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM (2014)
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
Extended Formulations for Sparsity Matroids. CoRR (2014)
Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa
Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28 (2) (2014)
Naoyuki Kamiyama, Naoki Katoh
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. 178 (2014)
Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. J. Graph Algorithms Appl. 18 (4) (2014)
Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama
An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. 556 (2014)
Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. CoRR (2014)
Naoki Katoh, Shin-ichi Tanigawa
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. SIAM J. Discret. Math. 27 (1) (2013)
Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA (2013)
András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
Independent arborescences in directed graphs. Discret. Math. 313 (4) (2013)
Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC (2013)
Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
A Linear-Time Algorithm for Testing Outer-1-Planarity. Graph Drawing (2013)
Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. ISAAC (2013)
Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513 (2013)
Yuya Higashikawa, Naoki Katoh
Online Vertex Exploration Problems in a Simple Polygon. IEICE Trans. Inf. Syst. (3) (2013)
Naoki Katoh, Shin-ichi Tanigawa
A rooted-forest partition with uniform vertex demand. J. Comb. Optim. 24 (2) (2012)
Atsushi Takizawa, Masaki Inoue, Naoki Katoh
An Emergency Evacuation Planning Model Using the Universally Quickest Flow. Rev. Socionetwork Strateg. 6 (1) (2012)
Yuya Higashikawa, Naoki Katoh
Online Exploration of All Vertices in a Simple Polygon. FAW-AAIM (2012)
Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). Graph Drawing (2012)
Naoki Katoh, Shin-ichi Tanigawa
Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries CoRR (2011)
Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka
Collision Probability in an In-Line Machines Model. Trans. Comput. Sci. 13 (2011)
Naoki Katoh, Shin-ichi Tanigawa
A Proof of the Molecular Conjecture. Discret. Comput. Geom. 45 (4) (2011)
Naoyuki Kamiyama, Naoki Katoh
Covering directed graphs by in-trees. J. Comb. Optim. 21 (1) (2011)
Jinhui Xu, Yang Yang, Yongding Zhu, Naoki Katoh
A Geometric Spanner of Segments. Int. J. Comput. Geom. Appl. 20 (1) (2010)
Naoki Katoh, Shin-ichi Tanigawa
A Rooted-Forest Partition with Uniform Vertex Demand. WALCOM (2010)
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
Arc-disjoint in-trees in directed graphs. Comb. 29 (2) (2009)
Naoki Katoh, Shin-ichi Tanigawa
Fast Enumeration Algorithms for Non-crossing Geometric Graphs. Discret. Comput. Geom. 42 (3) (2009)
Naoki Katoh, Shin-ichi Tanigawa
A proof of the molecular conjecture. SCG (2009)
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. 157 (17) (2009)
Naoyuki Kamiyama, Naoki Katoh
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. ISAAC (2009)
Naoki Katoh, Shin-ichi Tanigawa
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. Discret. Appl. Math. 157 (17) (2009)
Naoki Katoh
A Proof of the Molecular Conjecture. ISAAC (2009)
Naoki Katoh, Shin-ichi Tanigawa
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. ISAAC (2009)
Naoki Katoh, Shin-ichi Tanigawa
Fast enumeration algorithms for non-crossing geometric graphs. SCG (2008)
Naoyuki Kamiyama, Naoki Katoh
Covering Directed Graphs by In-Trees. COCOON (2008)
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
Arc-disjoint in-trees in directed graphs. SODA (2008)
Naoyuki Kamiyama, Naoki Katoh
The Minimum Weight In-Tree Cover Problem. MCO (2008)
Naoyuki Kamiyama, Naoki Katoh
Covering Directed Graphs by In-trees CoRR (2008)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40 (1) (2008)
Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa
Geometric Spanner of Objects under L1 Distance. COCOON (2008)
Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh
Geometric Spanner of Segments. ISAAC (2007)
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. AAIM (2007)
Naoki Katoh, Shin-ichi Tanigawa
Enumerating Constrained Non-crossing Geometric Spanning Trees. COCOON (2007)
Yinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
Triangulating a convex polygon with fewer number of non-standard bars. Theor. Comput. Sci. 389 (1-2) (2007)
Atsushi Takizawa, Fumie Kawaguchi, Naoki Katoh, Kenji Mori, Kazuo Yoshida
Risk discovery of car-related crimes from urban spatial attributes using emerging patterns. Int. J. Knowl. Based Intell. Eng. Syst. 11 (5) (2007)
Atsushi Takizawa, Kazuma Yoshida, Naoki Katoh
Applying graph mining to discover substructures of room layouts which affect the rent of apartments. SMC (2007)
Katsutoshi Yada, Edward Hak-Sing Ip, Naoki Katoh
Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability. Decis. Support Syst. 44 (1) (2007)
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD (2007)
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23 (Supplement-1) (2007)
Naoki Katoh, Hiro Ito
Preface. Discret. Appl. Math. 154 (16) (2006)

Naoki Katoh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Naoki Katoh