Naoki Katoh - RankMe

211 papers A* 9A 3B 28C 15Misc 11Journal 113Unranked 28

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Properties of Euclidean minimum weight (k,ℓ)-tight graphs. Discret. Appl. Math. Hitomi Hayashi, Yuya Higashikawa, Takashi Horiyama, Naoki Katoh, Yuki Kawakami
2025	J	`jnl`	Constructing red-black spanners for mixed-charging vehicular networks. Theor. Comput. Sci. Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu
2025	J	`jnl`	Improved algorithms for optimal k sink location on path networks. Theor. Comput. Sci. Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2024	J	`jnl`	Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges. J. Comb. Optim. Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2024	Misc	`conf`	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. ICMLC Munehiko Sasajima, Ken Ishibashi, Takehiro Yamamoto, Takayuki Yumoto, Hiroaki Ohshima, Tetsuya Fujie, Naoki Katoh
2024	J	`jnl`	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. Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
2024	J	`jnl`	Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights. J. Comb. Optim. Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2023	J	`jnl`	Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs. Int. J. Comput. Math. Comput. Syst. Theory Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi
2023	—	`conf`	Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges. COCOA (1) Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2023	J	`jnl`	Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges. CoRR Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2023	—	`conf`	Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
2023	B	`conf`	On Computing a Center Persistence Diagram. FCT Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2023	—	`conf`	Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu
2023	—	`conf`	The Line-Constrained Maximum Coverage Facility Location Problem. COCOA (1) Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa
2023	J	`jnl`	The Two-Squirrel Problem and Its Relatives. CoRR Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu
2022	—	`conf`	The Two-Squirrel Problem and Its Relatives. JCDCGGG Sergey Bereg, Yuya Higashikawa, Naoki Katoh, László Kozma, Manuel Lafond, Günter Rote, Yuki Tokuni, Max Willert, Binhai Zhu
2021	J	`jnl`	Almost linear time algorithms for minsum Theor. Comput. Sci. Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
2021	Misc	`conf`	Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. COCOON Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
2021	C	`conf`	Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
2021	B	`conf`	Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. WALCOM Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2020	C	`conf`	Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. COCOA Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
2020	J	`jnl`	Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. CoRR Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
2020	J	`jnl`	Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. CoRR Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2020	J	`jnl`	Minsum Theor. Comput. Sci. Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2019	J	`jnl`	A Survey on Facility Location Problems in Dynamic Flow Networks. Rev. Socionetwork Strateg. Yuya Higashikawa, Naoki Katoh
2019	C	`conf`	Minmax-Regret Evacuation Planning for Cycle Networks. TAMC Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2019	J	`jnl`	On Computing a Center Persistence Diagram. CoRR Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2019	J	`jnl`	Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
2018	B	`conf`	An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018	J	`jnl`	Minimax Regret 1-Median Problem in Dynamic Path Networks. Theory Comput. Syst. Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
2018	J	`jnl`	Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018	C	`conf`	Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018	J	`jnl`	Minsum k-Sink Problem on Path Networks. CoRR Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018	J	`jnl`	The mixed evacuation problem. J. Comb. Optim. Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2017	J	`jnl`	A population-based algorithm for solving linear assignment problems with two objectives. Comput. Oper. Res. Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh
2017	J	`jnl`	Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy
2017	B	`conf`	Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2016	J	`jnl`	Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs. Inf. Process. Lett. Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Adnan Sljoka
2016	J	`jnl`	Extended formulations for sparsity matroids. Math. Program. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2016	J	`jnl`	Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2016	C	`conf`	Minimax Regret 1-Median Problem in Dynamic Path Networks. IWOCA Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
2016	J	`jnl`	On the edge crossing properties of Euclidean minimum weight Laman graphs. Comput. Geom. Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa
2016	J	`jnl`	Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. CoRR Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan
2016	C	`conf`	The Mixed Evacuation Problem. COCOA Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2015	J	`jnl`	A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2015	—	`conf`	Continuous Folding of Regular Dodecahedra. JCDCGG Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara
2015	J	`jnl`	Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2015	—	`conf`	Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2015	J	`jnl`	Minimax Regret 1-Median Problem in Dynamic Path Networks. CoRR Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
2015	J	`jnl`	Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu
2015	J	`jnl`	Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2015	J	`jnl`	Optimally bracing grid frameworks with holes. Theor. Comput. Sci. Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell
2015	J	`jnl`	Polynomial-time approximability of the k-Sink Location problem. CoRR Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto
2015	B	`conf`	Straight-Line Drawability of a Planar Graph Plus an Edge. WADS Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
2015	J	`jnl`	Straight-line Drawability of a Planar Graph Plus an Edge. CoRR Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
2014	J	`jnl`	An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama
2014	J	`jnl`	Extended Formulations for Sparsity Matroids. CoRR Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2014	J	`jnl`	Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. CoRR Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	B	`conf`	Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	J	`jnl`	Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. J. Graph Algorithms Appl. Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	C	`conf`	Multiple Sink Location Problems in Dynamic Path Networks. AAIM Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	J	`jnl`	Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa
2014	C	`conf`	Optimally Bracing Grid Frameworks with Holes. COCOA Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell
2014	J	`jnl`	The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. Naoyuki Kamiyama, Naoki Katoh
2013	A	`conf`	A Linear-Time Algorithm for Testing Outer-1-Planarity. GD Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2013	J	`jnl`	A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2013	C	`conf`	An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi
2013	—	`ch.`	Emerging Pattern Based Crime Spots Analysis and Rental Price Prediction. Contrast Data Mining Naoki Katoh, Atsushi Takizawa
2013	J	`jnl`	Independent arborescences in directed graphs. Discret. Math. András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
2013	C	`conf`	Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu
2013	B	`conf`	On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. ISAAC Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa
2013	J	`jnl`	Online Vertex Exploration Problems in a Simple Polygon. IEICE Trans. Inf. Syst. Yuya Higashikawa, Naoki Katoh
2013	J	`jnl`	Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. SIAM J. Discret. Math. Naoki Katoh, Shin-ichi Tanigawa
2012	J	`jnl`	A rooted-forest partition with uniform vertex demand. J. Comb. Optim. Naoki Katoh, Shin-ichi Tanigawa
2012	J	`jnl`	An Emergency Evacuation Planning Model Using the Universally Quickest Flow. Rev. Socionetwork Strateg. Atsushi Takizawa, Masaki Inoue, Naoki Katoh
2012	—	`conf`	Online Exploration of All Vertices in a Simple Polygon. FAW-AAIM Yuya Higashikawa, Naoki Katoh
2012	A	`conf`	Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). GD Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2011	J	`jnl`	A Proof of the Molecular Conjecture. Discret. Comput. Geom. Naoki Katoh, Shin-ichi Tanigawa
2011	J	`jnl`	Collision Probability in an In-Line Machines Model. Trans. Comput. Sci. Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka
2011	J	`jnl`	Covering directed graphs by in-trees. J. Comb. Optim. Naoyuki Kamiyama, Naoki Katoh
2011	J	`jnl`	Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries CoRR Naoki Katoh, Shin-ichi Tanigawa
2011	B	`ed.`	WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings WALCOM Naoki Katoh, Amit Kumar
2010	J	`jnl`	A Geometric Spanner of Segments. Int. J. Comput. Geom. Appl. Jinhui Xu, Yang Yang, Yongding Zhu, Naoki Katoh
2010	B	`conf`	A Rooted-Forest Partition with Uniform Vertex Demand. WALCOM Naoki Katoh, Shin-ichi Tanigawa
2009	B	`conf`	A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. ISAAC Naoyuki Kamiyama, Naoki Katoh
2009	B	`conf`	A Proof of the Molecular Conjecture. ISAAC Naoki Katoh
2009	—	`conf`	A proof of the molecular conjecture. SCG Naoki Katoh, Shin-ichi Tanigawa
2009	J	`jnl`	An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2009	J	`jnl`	Arc-disjoint in-trees in directed graphs. Comb. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2009	—	`ch.`	Combinatorial Optimization Algorithms in Resource Allocation Problems. Encyclopedia of Optimization Naoki Katoh
2009	J	`jnl`	Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. Discret. Appl. Math. Naoki Katoh, Shin-ichi Tanigawa
2009	J	`jnl`	Fast Enumeration Algorithms for Non-crossing Geometric Graphs. Discret. Comput. Geom. Naoki Katoh, Shin-ichi Tanigawa
2009	B	`conf`	On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. ISAAC Naoki Katoh, Shin-ichi Tanigawa
2008	A*	`conf`	Arc-disjoint in-trees in directed graphs. SODA Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2008	—	`ed.`	Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers KyotoCGGT Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno
2008	Misc	`conf`	Covering Directed Graphs by In-Trees. COCOON Naoyuki Kamiyama, Naoki Katoh
2008	J	`jnl`	Covering Directed Graphs by In-trees CoRR Naoyuki Kamiyama, Naoki Katoh
2008	J	`jnl`	Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
2008	—	`conf`	Fast enumeration algorithms for non-crossing geometric graphs. SCG Naoki Katoh, Shin-ichi Tanigawa
2008	Misc	`conf`	Geometric Spanner of Objects under L1 Distance. COCOON Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa
2008	—	`conf`	The Minimum Weight In-Tree Cover Problem. MCO Naoyuki Kamiyama, Naoki Katoh
2007	C	`conf`	An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. AAIM Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2007	B	`conf`	Applying graph mining to discover substructures of room layouts which affect the rent of apartments. SMC Atsushi Takizawa, Kazuma Yoshida, Naoki Katoh
2007	Misc	`conf`	Enumerating Constrained Non-crossing Geometric Spanning Trees. COCOON Naoki Katoh, Shin-ichi Tanigawa
2007	J	`jnl`	Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
2007	B	`conf`	Geometric Spanner of Segments. ISAAC Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh
2007	J	`jnl`	Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability. Decis. Support Syst. Katsutoshi Yada, Edward Hak-Sing Ip, Naoki Katoh
2007	J	`jnl`	Risk discovery of car-related crimes from urban spatial attributes using emerging patterns. Int. J. Knowl. Based Intell. Eng. Syst. Atsushi Takizawa, Fumie Kawaguchi, Naoki Katoh, Kenji Mori, Kazuo Yoshida
2007	J	`jnl`	Triangulating a convex polygon with fewer number of non-standard bars. Theor. Comput. Sci. Yinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
2007	—	`conf`	Voronoi Diagram with Respect to Criteria on Vision Information. ISVD Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2006	J	`jnl`	An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. IEICE Trans. Inf. Syst. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2006	C	`conf`	An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. AAIM Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
2006	J	`jnl`	An approximation algorithm for the pickup and delivery vehicle routing problem on trees. Discret. Appl. Math. Naoki Katoh, Taihei Yano
2006	—	`conf`	Angular Voronoi Diagram with Applications. ISVD Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama
2006	Misc	`conf`	Enumerating Non-crossing Minimally Rigid Frameworks. COCOON David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
2006	J	`jnl`	Finding a Triangular Mesh with a Constant Number of Different Edge Lengths. IEICE Trans. Inf. Syst. Shin-ichi Tanigawa, Naoki Katoh
2006	J	`jnl`	Foreword. Algorithmica Naoki Katoh
2006	J	`jnl`	Inserting Points Uniformly at Every Instance. IEICE Trans. Inf. Syst. Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr
2006	C	`conf`	Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. AAIM Shin-ichi Tanigawa, Naoki Katoh
2006	J	`jnl`	Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2006	J	`jnl`	Preface. Discret. Appl. Math. Naoki Katoh, Hiro Ito
2005	J	`jnl`	Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. J. Comb. Optim. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
2005	—	`conf`	Finding a triangular mesh with a constant number of different edge lengths. CCCG Shin-ichi Tanigawa, Naoki Katoh
2005	J	`jnl`	Optimal spanners for axis-aligned rectangles. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
2005	—	`conf`	The Future Direction of New Computing Environment for Exabyte Data in the Business World. SAINT Workshops Katsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Kazuhiro Kishiya
2005	Misc	`conf`	Triangulating a Convex Polygon with Small Number of Non-standard Bars. COCOON Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
2004	Misc	`conf`	Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. COCOON Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama
2004	—	`conf`	On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2004	B	`conf`	Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
2004	J	`jnl`	The structure and number of global roundings of a graph. Theor. Comput. Sci. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2003	B	`ed.`	Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings ISAAC Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
2003	B	`conf`	Business Application for Sales Transaction Data by Using Genome Analysis Technology. Discovery Science Naoki Katoh, Katsutoshi Yada, Yukinobu Hamuro
2003	—	`conf`	Data Mining Oriented CRM Systems Based on MUSASHI: C-MUSASHI. Active Mining Katsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Takashi Washio, Issey Fusamoto, Daisuke Fujishima, Takaya Ikeda
2003	—	`conf`	Matrix Rounding and Related Problems with Application to Digital Halftoning. System Modelling and Optimization Naoki Katoh
2003	J	`jnl`	Matrix Rounding under the L SIAM J. Comput. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
2003	Misc	`conf`	The Structure and Number of Global Roundings of a Graph. COCOON Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2003	C	`conf`	Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives. EMO Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh
2002	—	`conf`	A Machine Learning Algorithm for Analyzing String Patterns Helps to Discover Simple and Interpretable Business Rules from Purchase History. Progress in Discovery Science Yukinobu Hamuro, Hideki Kawata, Naoki Katoh, Katsutoshi Yada
2002	J	`jnl`	Approximating uniform triangular meshes in polygons. Theor. Comput. Sci. Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
2002	—	`conf`	Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
2002	J	`jnl`	K-Levels of Concave Surfaces. Discret. Comput. Geom. Naoki Katoh, Takeshi Tokuyama
2002	A*	`conf`	Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. SODA Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
2002	J	`jnl`	Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
2001	J	`jnl`	A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
2001	J	`jnl`	A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
2001	J	`jnl`	Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geom. Appl. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
2001	J	`jnl`	Notes on computing peaks in k-levels and parametric spanning trees CoRR Naoki Katoh, Takeshi Tokuyama
2001	—	`conf`	Notes on computing peaks in k-levels and parametric spanning trees. SCG Naoki Katoh, Takeshi Tokuyama
2001	C	`conf`	The Supported Solutions Used as a Genetic Information in a Population Heuristics. EMO Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh
2000	—	`conf`	Approximating Uniform Triangular Meshes for Spheres. JCDCG Naoki Katoh, Hiromichi Kojima, Ryo Taniguchi
2000	Misc	`conf`	Approximating Uniform Triangular Meshes in Polygons. COCOON Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
2000	B	`conf`	Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior. Discovery Science Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada
2000	J	`jnl`	LMT-skeleton heuristics for several new classes of optimal triangulations. Comput. Geom. Yang Dai, Naoki Katoh, Siu-Wing Cheng
2000	A*	`conf`	Optimizing the sum of linear fractional functions and applications. SODA Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
1999	B	`conf`	A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
1999	B	`conf`	Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. Discovery Science Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada
1999	J	`jnl`	Finding Subsets Maximizing Minimum Structures. SIAM J. Discret. Math. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
1999	A*	`conf`	Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS Naoki Katoh, Takeshi Tokuyama
1999	A*	`conf`	Parametric Polymatroid Optimization and Its Geometric Applications. SODA Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1998	B	`conf`	A Capacitated Vehicle Routing Problem on a Tree. ISAAC Shin-ya Hamaguchi, Naoki Katoh
1998	B	`conf`	Convertibility among Grid Filling Curves. ISAAC Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1998	B	`conf`	Data Mining Oriented System for Business Applications. Discovery Science Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada
1998	—	`conf`	Hole filling: a novel delay reduction technique using selector logic. CICC Shunzo Yamashita, Naoki Katoh, Yasuhiko Sasaki, Yohei Akita, Hidetoshi Chikata, Kazuo Yano
1998	J	`jnl`	Mining Pharmacy Data Helps to Make Profits. Data Min. Knowl. Discov. Yukinobu Hamuro, Naoki Katoh, Yasuyuki Matsuda, Katsutoshi Yada
1998	Misc	`conf`	On Computing New Classes of Optimal Trangulations with Angular Constraints. COCOON Yang Dai, Naoki Katoh
1997	J	`jnl`	A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. Inf. Process. Lett. Yang Dai, Kazuo Iwano, Naoki Katoh
1997	A*	`conf`	Covering Points in the Plane by STOC Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
1996	J	`jnl`	A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discret. Appl. Math. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura
1996	B	`conf`	A Study of the LMT-Skeleton. ISAAC Siu-Wing Cheng, Naoki Katoh, Manabu Sugai
1996	—	`conf`	Experimental Results of Randomized Clustering Algorithm. SCG Mary Inaba, Hiroshi Imai, Naoki Katoh
1996	A*	`conf`	Polynomial-Time Solutions to Image Segmentation. SODA Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
1996	J	`jnl`	Triangulations Intersect Nicely. Discret. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
1996	J	`jnl`	Variants for the Hough Transform for Line Detection. Comput. Geom. Tetsuo Asano, Naoki Katoh
1995	B	`ed.`	Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings ISAAC John Staples, Peter Eades, Naoki Katoh, Alistair Moffat
1995	A*	`conf`	Finding Subsets Maximizing Minimum Structures. SODA Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
1995	J	`jnl`	Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. Int. J. Comput. Geom. Appl. Naoki Katoh, Kazuo Iwano
1995	J	`jnl`	On Minimum and Maximum Spanning Trees of Linearly Moving Points. Discret. Comput. Geom. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
1995	—	`conf`	Optimal approximation of monotone curves on a grid. CCCG Tetsuo Asano, Naoki Katoh, Elena Lodi, Thomas Roos
1994	A	`conf`	A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
1994	—	`conf`	Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based SCG Mary Inaba, Naoki Katoh, Hiroshi Imai
1994	J	`jnl`	Efficient algorithms for minimum range cut problems. Networks Naoki Katoh, Kazuo Iwano
1993	J	`jnl`	Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree. Inf. Process. Lett. Kazuo Iwano, Naoki Katoh
1993	J	`jnl`	Graph endpoint coloring and distributed processing. Networks Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita
1993	B	`conf`	How to Treat Delete Requests in Semi-Online Problems. ISAAC Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
1993	B	`conf`	Number Theory Helps Line Detection in Digital Images. ISAAC Tetsuo Asano, Naoki Katoh
1992	J	`jnl`	A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discret. Appl. Math. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
1992	J	`jnl`	A fully polynomial time approximation scheme for minimum cost-reliability ratio problems. Discret. Appl. Math. Naoki Katoh
1992	J	`jnl`	An e-approximation scheme for combinatorial optimization problems with minimum variance criterion. Discret. Appl. Math. Naoki Katoh
1992	—	`conf`	Finding SCG Naoki Katoh, Kazuo Iwano
1992	A*	`conf`	On Minimum and Maximum Spanning Trees of Linearly Moving Points FOCS Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
1992	J	`jnl`	Optimal strategies for some team games. Discret. Appl. Math. Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki
1991	J	`jnl`	A two-commodity sharing problem on networks. Networks Tetsuo Ichimori, Naoki Katoh
1991	B	`conf`	Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). WADS Naoki Katoh, Kazuo Iwano
1991	J	`jnl`	Finding k Points with Minimum Diameter and Related Problems. J. Algorithms Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
1990	J	`jnl`	Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
1990	J	`jnl`	Searching Minimax Game Trees under Memory Space Constraint. Ann. Math. Artif. Intell. Toshihide Ibaraki, Naoki Katoh
1989	J	`jnl`	A 1-Version Cautious Transaction Scheduler with Dynamic Version Selection. Syst. Comput. Jpn. Jun Kiniwa, Naoki Katoh
1989	—	`conf`	Fining SCG Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
1988	J	`jnl`	Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
1988	—	`book`	Resource allocation problems - algorithmic approaches. Toshihide Ibaraki, Naoki Katoh
1988	J	`jnl`	The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori
1987	J	`jnl`	A Cautious Scheduler for Multistep Transactions. Algorithmica Naoki Katoh, Tiko Kameda, Toshihide Ibaraki
1987	J	`jnl`	A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program. Discret. Appl. Math. Naoki Katoh, Toshihide Ibaraki
1987	J	`jnl`	Approximation algorithms for combinatorial fractional programming problems. Math. Program. Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki
1985	J	`jnl`	An Algorithm for the Equipollent Resource Allocation Problem. Math. Oper. Res. Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1985	J	`jnl`	An efficient algorithm for the parametric resource allocation problem. Discret. Appl. Math. Naoki Katoh, Toshihide Ibaraki
1985	J	`jnl`	Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
1983	J	`jnl`	On-Line Computation of Transitive Closures of Graphs. Inf. Process. Lett. Toshihide Ibaraki, Naoki Katoh
1982	J	`jnl`	An efficient algorithm for K shortest simple paths. Networks Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1981	J	`jnl`	An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1981	J	`jnl`	An Algorithm for the K Best Solutions of the Resource Allocation Problem. J. ACM Naoki Katoh, Toshihide Ibaraki, Hisashi Mine