| 2024 | ICMLC | Is Problem-Based Learning Exercises using Real Data Effective on the Education of Lower Grades in the Faculty of Data Science? Findings on PBL Exercises for Five Years. | Munehiko Sasajima, Ken Ishibashi, Takehiro Yamamoto, Takayuki Yumoto, Hiroaki Ohshima, Tetsuya Fujie, Naoki Katoh |
| 2023 | COCOA | 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 |
| 2023 | COCOA | The Line-Constrained Maximum Coverage Facility Location Problem. | Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa |
| 2023 | COCOON | Red-Black Spanners for Mixed-Charging Vehicular Networks. | Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu |
| 2023 | FCT | On Computing a Center Persistence Diagram. | Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu |
| 2021 | ATMOS | Locating Evacuation Centers Optimally in Path and Cycle Networks. | Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama |
| 2021 | COCOON | Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. | Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh |
| 2021 | WALCOM | Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. | Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni |
| 2020 | COCOA | Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. | Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase |
| 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 | COCOA | The Mixed Evacuation Problem. | Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2016 | IWOCA | Minimax Regret 1-Median Problem in Dynamic Path Networks. | Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi |
| 2015 | WADS | Straight-Line Drawability of a Planar Graph Plus an Edge. | Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon |
| 2014 | AAIM | Multiple Sink Location Problems in Dynamic Path Networks. | Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh |
| 2014 | COCOA | Optimally Bracing Grid Frameworks with Holes. | Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell |
| 2014 | WALCOM | Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. | Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh |
| 2013 | COCOA | An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. | Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi |
| 2013 | GD | A Linear-Time Algorithm for Testing Outer-1-Planarity. | Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki |
| 2013 | ISAAC | On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. | Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa |
| 2013 | TAMC | Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. | Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu |
| 2012 | AAIM | Online Exploration of All Vertices in a Simple Polygon. | Yuya Higashikawa, Naoki Katoh |
| 2012 | GD | Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). | Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki |
| 2010 | WALCOM | A Rooted-Forest Partition with Uniform Vertex Demand. | Naoki Katoh, Shin-ichi Tanigawa |
| 2009 | ISAAC | A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. | Naoyuki Kamiyama, Naoki Katoh |
| 2009 | ISAAC | A Proof of the Molecular Conjecture. | Naoki Katoh |
| 2009 | ISAAC | On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. | Naoki Katoh, Shin-ichi Tanigawa |
| 2008 | COCOON | Covering Directed Graphs by In-Trees. | Naoyuki Kamiyama, Naoki Katoh |
| 2008 | COCOON | Geometric Spanner of Objects under L1 Distance. | Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa |
| 2008 | SODA | Arc-disjoint in-trees in directed graphs. | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2007 | AAIM | An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2007 | COCOON | Enumerating Constrained Non-crossing Geometric Spanning Trees. | Naoki Katoh, Shin-ichi Tanigawa |
| 2007 | ISAAC | Geometric Spanner of Segments. | Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh |
| 2007 | SMC | Applying graph mining to discover substructures of room layouts which affect the rent of apartments. | Atsushi Takizawa, Kazuma Yoshida, Naoki Katoh |
| 2006 | AAIM | An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. | Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa |
| 2006 | AAIM | Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. | Shin-ichi Tanigawa, Naoki Katoh |
| 2006 | COCOON | Enumerating Non-crossing Minimally Rigid Frameworks. | David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa |
| 2005 | COCOON | Triangulating a Convex Polygon with Small Number of Non-standard Bars. | Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki |
| 2004 | COCOON | Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. | Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama |
| 2004 | ISAAC | Polyline Fitting of Planar Points Under Min-sum Criteria. | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama |
| 2003 | COCOON | The Structure and Number of Global Roundings of a Graph. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 2003 | DIS | Business Application for Sales Transaction Data by Using Genome Analysis Technology. | Naoki Katoh, Katsutoshi Yada, Yukinobu Hamuro |
| 2003 | EMO | Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives. | Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh |
| 2002 | SODA | Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. | Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama |
| 2001 | EMO | The Supported Solutions Used as a Genetic Information in a Population Heuristics. | Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh |
| 2000 | COCOON | Approximating Uniform Triangular Meshes in Polygons. | Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu |
| 2000 | DIS | Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior. | Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada |
| 2000 | SODA | Optimizing the sum of linear fractional functions and applications. | Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu |
| 1999 | DIS | Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. | Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada |
| 1999 | FOCS | Lovsz's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. | Naoki Katoh, Takeshi Tokuyama |
| 1999 | ISAAC | A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. | Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima |
| 1999 | SODA | Parametric Polymatroid Optimization and Its Geometric Applications. | Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1998 | COCOON | On Computing New Classes of Optimal Trangulations with Angular Constraints. | Yang Dai, Naoki Katoh |
| 1998 | DIS | Data Mining Oriented System for Business Applications. | Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada |
| 1998 | ISAAC | Convertibility among Grid Filling Curves. | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1998 | ISAAC | A Capacitated Vehicle Routing Problem on a Tree. | Shin-ya Hamaguchi, Naoki Katoh |
| 1997 | STOC | Covering Points in the Plane by | Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1996 | ISAAC | A Study of the LMT-Skeleton. | Siu-Wing Cheng, Naoki Katoh, Manabu Sugai |
| 1996 | SODA | Polynomial-Time Solutions to Image Segmentation. | Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama |
| 1995 | SODA | Finding Subsets Maximizing Minimum Structures. | Magns M. Halldrsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama |
| 1994 | ESA | A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. | Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama |
| 1993 | ISAAC | Number Theory Helps Line Detection in Digital Images. | Tetsuo Asano, Naoki Katoh |
| 1993 | ISAAC | How to Treat Delete Requests in Semi-Online Problems. | Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh |
| 1992 | FOCS | On Minimum and Maximum Spanning Trees of Linearly Moving Points | Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano |
| 1991 | WADS | Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). | Naoki Katoh, Kazuo Iwano |