N. Katoh

Katsutoshi Yada, Naoki Katoh, Yukinobu Hamuro, 2001, ISIE 2001. 2001 IEEE International Symposium on Industrial Electronics Proceedings (Cat. No.01TH8570).

Optimally bracing grid frameworks with holes

Yuki Kobayashi, Sheung-Hung Poon, Naoki Katoh, 2014, Theor. Comput. Sci..

Discovering Purchase Association among Brands from Purchase History

N. Katoh, K. Yada, Yukinobu Hamuro, 2001 .

TOPOLOGY OPTIMIZATION OF TRUSSES FOR SPECIFIED MULTIPLE LINEAR BUCKLING LOAD FACTORS BY USING SEMIDEFINITE PROGRAMMING

N. Katoh, K. Fujisawa, Y. Kanno, 2001 .

Optimization of Trusses for Specified Multiple Linear Buckling Load Factor by Using Semidefinite Programming ( in Japanese )

N. Katoh, K. Fujisawa, Y. Kanno, 2022 .

Algorithms and Computations

Alistair Moffat, Peter Eades, John Staples, 1995, Lecture Notes in Computer Science.

Title An efficient algorithm for the evacuation problem in a certainclass of networks with uniform path-lengths

N. Katoh, A. Takizawa, 2019 .

Title An Efficient Algorithm for the Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity and its Extension(Theory of Modeling and Optimization)

N. Katoh, A. Takizawa, Naoyuki Kamiyama, 2018 .

123 Optimal Design of Flexible Structures utilizing Enumeration Algorithms for Rigid Framework

Makoto Ohsaki, Takuya Kinoshita, David Avis, 2006 .

The Discovery of Business Chance From Purchase History Using DNA Analysis Technology

N. Katoh, K. Yada, Yukinobu Hamuro, 2001 .

Parametric search: three new applications

N. Katoh, Yinfeng Xu, Wencheng Wang, 2010 .

Generalized LMT-Skeleton Heuristics for Several New Classes of Optimal Triangulations 1

N. Katoh, Siu-Wing Cheng, Yang Dai, 2007 .

An Inductive Construction of Minimally Rigid Panel-Hinge Graphs and Application to Design Form

N. Katoh, A. Takizawa, Yuki Kobayashi, 2014, CAADRIA proceedings.

Title An approximation algorithm for the pickup and deliveryvehicle routing problem on trees

N. Katoh, T. Yano, 2018 .

On-Line Computation of Transitive Closures of Graphs

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1983, Inf. Process. Lett..

An (*e-Approximation Scheme for Minimum Variance Resource Allocation Problems

N. Katoh, A. Kurzhanski, 1988 .

An Efficient Algorithm for the Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity and its Extension(Theory of Modeling and Optimization)

N. Katoh, A. Takizawa, Naoyuki Kamiyama, 2006 .

Algorithms for bicriteria combinatorial optimization problems

N. Katoh, 1989 .

Discovering Distinctive Spatial Patterns of Snatch Theft in Kyoto City with CAEP

N. Katoh, W. Koo, A. Takizawa, 2010 .

The structure and number of global roundings of a graph

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2004, Theor. Comput. Sci..

The mixed evacuation problem

N. Katoh, A. Takizawa, Naoyuki Kamiyama, 2017, Journal of Combinatorial Optimization.

A rooted-forest partition with uniform vertex demand

N. Katoh, Shin-ichi Tanigawa, 2010, Journal of Combinatorial Optimization.

Approximating Uniform Triangular Meshes for Spheres

Naoki Katoh, Hiromichi Kojima, Ryo Taniguchi, 2000, JCDCG.

Approximating uniform triangular meshes in polygons

Franz Aurenhammer, Yin-Feng Xu, Makoto Ohsaki, 2000, Theor. Comput. Sci..

Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges

N. Katoh, Yuya Higashikawa, Junichi Teruyama, 2023, ArXiv.

Resource Allocation Problems

Naoki Katoh, Toshihide Ibaraki, T. Ibaraki, 1998 .

Finding k Points with Minimum Diameter and Related Problems

Alok Aggarwal, Subhash Suri, Hiroshi Imai, 1991, J. Algorithms.

Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree

N. Katoh, Yuya Higashikawa, Junichi Teruyama, 2023, 2301.06857.

How to Treat Delete Requests in Semi-Online Problems

Hiroshi Imai, Naoki Katoh, Kazuo Iwano, 1993, International Symposium on Algorithms and Computation.

A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms

Hiroshi Imai, Naoki Katoh, Kazuo Iwano, 1996, Discret. Appl. Math..

Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract)

Naoki Katoh, Kazuo Iwano, Kazuo Iwano, 1994, WADS.

Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 1997, STOC '97.

Geometric p-Center Problems with Centers Constrained to Two Lines pdf

Naoki Katoh, Tsunehiko Kameda, Yuya Higashikawa, 2015, JCDCGG.

The structure and number of global roundings of a graph

Tetsuo Asano, Hisao Tamaki, Takeshi Tokuyama, 2004, Theor. Comput. Sci..

Matrix Rounding and Related Problems with Application to Digital Halftoning

Naoki Katoh, N. Katoh, 2003, System Modelling and Optimization.

On minimum and maximum spanning trees of linearly moving points

Takeshi Tokuyama, Naoki Katoh, Kazuo Iwano, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

RENT ANALYSIS OF OFFICE BUILDINGS IN SHINBASHI CONSIDERING KANSEI JUDGEMENT

Atsushi Takizawa, Naoki Katoh, Wonyong Koo, 2008 .

A Data Mining System for Managing Customer Relationship

Katsutoshi Yada, Naoki Katoh, Edward H. Ip, 2000 .

Optimal strategies for some team games

Toshihide Ibaraki, Naoki Katoh, Junji Koyanagi, 1992, Discret. Appl. Math..

Searching minimax game trees under memory space constraint

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1990, Annals of Mathematics and Artificial Intelligence.

Enumeration of Floor Plans Based on a Zero-Suppressed Binary Decision Diagram

Atsushi Takizawa, Naoki Katoh, Yushi Miyata, 2015, CAADRIA proceedings.

An Algorithm for Finding K Minimum Spanning Trees

Toshihide Ibaraki, Hisashi Mine, Naoki Katoh, 1981, SIAM J. Comput..

A Proof of the Molecular Conjecture

Naoki Katoh, N. Katoh, 2009, SCG '09.

Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members

Makoto Ohsaki, Takuya Kinoshita, David Avis, 2009 .

Approximation algorithms for combinatorial fractional programming problems

Masao Fukushima, Toshihide Ibaraki, Naoki Katoh, 1987, Math. Program..

Extended formulations for sparsity matroids

Yoshio Okamoto, Satoru Iwata, Shuji Kijima, 2014, Math. Program..

On Computing a Center Persistence Diagram

N. Katoh, B. Zhu, Guohui Lin, 2019, ArXiv.

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system

Giuseppe Liotta, Yusuke Suzuki, Peter Eades, 2013, Theor. Comput. Sci..

A Survey on Facility Location Problems in Dynamic Flow Networks

Naoki Katoh, Yuya Higashikawa, N. Katoh, 2019, The Review of Socionetwork Strategies.

The mixed evacuation problem

Atsushi Takizawa, Naoyuki Kamiyama, Naoki Katoh, 2016, Journal of Combinatorial Optimization.

Polynomial-time approximability of the k-Sink Location problem pdf

Yoshio Okamoto, Naoki Katoh, Yuya Higashikawa, 2015, ArXiv.

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Naoyuki Kamiyama, Naoki Katoh, N. Katoh, 2014, Discret. Appl. Math..

Independent arborescences in directed graphs

András Frank, Naoyuki Kamiyama, Satoru Fujishige, 2013, Discret. Math..

An Emergency Evacuation Planning Model Using the Universally Quickest Flow

Masaki Inoue, Atsushi Takizawa, Naoki Katoh, 2012, Rev. Socionetwork Strateg..

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, N. Katoh, 2009, ISAAC.

An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

Atsushi Takizawa, Naoyuki Kamiyama, Naoki Katoh, 2009, Discret. Appl. Math..

An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths

Atsushi Takizawa, Naoyuki Kamiyama, Naoki Katoh, 2007, AAIM.

An Emergency Evacuation Planning Model Based on the Universally Quickest Flow

N. Katoh, A. Takizawa, M. Inoue, 2013 .

Online Vertex Exploration Problems in a Simple Polygon

Naoki Katoh, Yuya Higashikawa, N. Katoh, 2013, IEICE Trans. Inf. Syst..

Optimizing the sum of linear fractional functions and applications

Xiaodong Wu, Ovidiu Daescu, Jinhui Xu, 2000, SODA '00.

Mining Pharmacy Data Helps to Make Profits

Katsutoshi Yada, Naoki Katoh, Yasuyuki Matsuda, 1998, Data Mining and Knowledge Discovery.

Combining Information Fusion with String Pattern Analysis: A New Method for Predicting Future Purchase Behavior

Katsutoshi Yada, Naoki Katoh, Yukinobu Hamuro, 2003 .

A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program

Toshihide Ibaraki, Naoki Katoh, T. Ibaraki, 1987, Discret. Appl. Math..

A New Approximate Algorithm for the Minimum k-Cut Problem by Using Minimum Range k-Cut Algorithm

Naoki Katoh, Kazuo Iwano, Yang Dai, 1994 .

The Fair Resource Allocation Problem with Submodular Constraints

Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori, 1988, Math. Oper. Res..

The Minimum Weight In-Tree Cover Problem

Naoyuki Kamiyama, Naoki Katoh, N. Katoh, 2008, MCO.

SYMMETRICITY OF THE SOLUTION OF SEMIDEFINITE PROGRAM

N. Katoh, K. Fujisawa, Y. Kanno, 2007 .

Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree

Naoki Katoh, Kazuo Iwano, Kazuo Iwano, 1993, Inf. Process. Lett..

Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs

Yuki Kobayashi, Adnan Sljoka, Naoki Katoh, 2016, Inf. Process. Lett..

An inductive construction of minimally rigid body-hinge simple graphs

Yuki Kobayashi, Naoyuki Kamiyama, Naoki Katoh, 2013, Theor. Comput. Sci..

Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries pdf

Shin-ichi Tanigawa, Naoki Katoh, N. Katoh, 2011, SIAM J. Discret. Math..

A rooted-forest partition with uniform vertex demand

Shin-ichi Tanigawa, Naoki Katoh, N. Katoh, 2009, J. Comb. Optim..

Parametric polymatroid optimization and its geometric applications

Hisao Tamaki, Takeshi Tokuyama, Naoki Katoh, 2002, SODA '99.

An Enumeration Algorithm of Minimally Rigid Graph Structure

N. Katoh, A. Takizawa, T. Okano, 2011 .

Fast Enumeration Algorithms for Non-crossing Geometric Graphs

Shin-ichi Tanigawa, Naoki Katoh, N. Katoh, 2008, SCG '08.

Variants for the Hough Transform for Line Detection

Tetsuo Asano, Naoki Katoh, N. Katoh, 1996, Comput. Geom..

Geometric Spanner of Objects under L1 Distance

Yang Yang, Shin-ichi Tanigawa, Jinhui Xu, 2008, COCOON.

Geometric Spanner of Segments

Yang Yang, Jinhui Xu, Naoki Katoh, 2007, ISAAC.

Geometric Spanner of Segments (Algorithms and Computation)

Yang Yang, Naoki Katoh, Yongding Zhu, 2007 .

Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability

Katsutoshi Yada, Naoki Katoh, Edward Ip, 2007, Decis. Support Syst..

Collision Probability in an In-Line Machines Model

Takeshi Miura, Tetsuo Asano, Naoki Katoh, 2011, Trans. Comput. Sci..

On the Infinitesimal Rigidity of Bar-and-Slider Frameworks

Shin-ichi Tanigawa, Naoki Katoh, N. Katoh, 2009, ISAAC.

Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane

Naoki Katoh, Kazuo Iwano, Kazuo Iwano, 1992, SCG '92.

Triangulations intersect nicely

G. Rote, N. Katoh, F. Aurenhammer, 1996, Discret. Comput. Geom..

AN E-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS

Naoki Katoh, N. Katoh, 2009 .

Business Application for Sales Transaction Data by Using Genome Analysis Technology

Katsutoshi Yada, Naoki Katoh, Yukinobu Hamuro, 2003, Discovery Science.

Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain

Jinhee Chun, Takeshi Tokuyama, Danny Ziyi Chen, 2004, COCOON.

Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports

Naoki Katoh, Akihiro Adachi, N. Katoh, 1989 .

A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control

Toshihide Ibaraki, Naoki Katoh, Tiko Kameda, 1992, Discret. Appl. Math..

Experimental results of randomized clustering algorithm

Hiroshi Imai, Mary Inaba, Naoki Katoh, 1996, SCG '96.

A Machine Learning Algorithm for Analyzing String Patterns Helps to Discover Simple and Interpretable Business Rules from Purchase History

Katsutoshi Yada, Naoki Katoh, Yukinobu Hamuro, 2002, Progress in Discovery Science.

Notes on computing peaks in k-levels and parametric spanning trees

N. Katoh, T. Tokuyama, 2001, SCG '01.

Online graph exploration algorithms for cycles and trees by multiple searchers

Stefan Langerman, Shin-ichi Tanigawa, Naoki Katoh, 2012, Journal of Combinatorial Optimization.

Straight-Line Drawability of a Planar Graph Plus an Edge pdf

Giuseppe Liotta, Peter Eades, Sheung-Hung Poon, 2015, WADS.

A Linear-Time Algorithm for Testing Outer-1-Planarity

Giuseppe Liotta, Yusuke Suzuki, Peter Eades, 2013, Algorithmica.

Parallel K-means Clustering Algorithm on NOWs

Alva L. Couch, Mary Inaba, Naoki Katoh, 2003 .

Arc-disjoint in-trees in directed graphs

N. Katoh, A. Takizawa, Naoyuki Kamiyama, 2008, SODA '08.