| 2009 |
|---|
| 97 | EE | Naoki Katoh:
Combinatorial Optimization Algorithms in Resource Allocation Problems.
Encyclopedia of Optimization 2009: 382-387 |
| 2008 |
|---|
| 96 | EE | Yongding Zhu,
Jinhui Xu,
Yang Yang,
Naoki Katoh,
Shin-ichi Tanigawa:
Geometric Spanner of Objects under L1 Distance.
COCOON 2008: 395-404 |
| 95 | EE | Naoyuki Kamiyama,
Naoki Katoh:
Covering Directed Graphs by In-Trees.
COCOON 2008: 444-457 |
| 94 | EE | Naoyuki Kamiyama,
Naoki Katoh:
The Minimum Weight In-Tree Cover Problem.
MCO 2008: 155-164 |
| 93 | EE | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs.
SODA 2008: 518-526 |
| 92 | EE | Naoki Katoh,
Shin-ichi Tanigawa:
Fast enumeration algorithms for non-crossing geometric graphs.
Symposium on Computational Geometry 2008: 328-337 |
| 91 | EE | Naoyuki Kamiyama,
Naoki Katoh:
Covering Directed Graphs by In-trees
CoRR abs/0802.2755: (2008) |
| 2007 |
|---|
| 90 | EE | 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: 178-190 |
| 89 | EE | Naoki Katoh,
Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Geometric Spanning Trees.
COCOON 2007: 243-253 |
| 88 | EE | Yang Yang,
Yongding Zhu,
Jinhui Xu,
Naoki Katoh:
Geometric Spanner of Segments.
ISAAC 2007: 75-87 |
| 87 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Voronoi Diagram with Respect to Criteria on Vision Information.
ISVD 2007: 25-32 |
| 86 | EE | Katsutoshi Yada,
Edward Ip,
Naoki Katoh:
Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability.
Decision Support Systems 44(1): 223-234 (2007) |
| 85 | EE | Atsushi Takizawa,
Fumie Kawaguchi,
Naoki Katoh,
Kenji Mori,
Kazuo Yoshida:
Risk discovery of car-related crimes from urban spatial attributes using emerging patterns.
KES Journal 11(5): 301-311 (2007) |
| 84 | EE | 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): 143-151 (2007) |
| 2006 |
|---|
| 83 | EE | Shin-ichi Tanigawa,
Naoki Katoh:
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths.
AAIM 2006: 161-172 |
| 82 | EE | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.
AAIM 2006: 231-242 |
| 81 | EE | David Avis,
Naoki Katoh,
Makoto Ohsaki,
Ileana Streinu,
Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks.
COCOON 2006: 205-215 |
| 80 | EE | Naoki Katoh:
Foreword.
Algorithmica 44(2): 101-101 (2006) |
| 79 | EE | Naoki Katoh,
Hiro Ito:
Preface.
Discrete Applied Mathematics 154(16): 2239-2240 (2006) |
| 78 | EE | Naoki Katoh,
Taihei Yano:
An approximation algorithm for the pickup and delivery vehicle routing problem on trees.
Discrete Applied Mathematics 154(16): 2335-2349 (2006) |
| 77 | EE | Sachio Teramoto,
Tetsuo Asano,
Naoki Katoh,
Benjamin Doerr:
Inserting Points Uniformly at Every Instance.
IEICE Transactions 89-D(8): 2348-2356 (2006) |
| 76 | EE | Shin-ichi Tanigawa,
Naoki Katoh:
Finding a Triangular Mesh with a Constant Number of Different Edge Lengths.
IEICE Transactions 89-D(8): 2364-2371 (2006) |
| 75 | EE | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity.
IEICE Transactions 89-D(8): 2372-2379 (2006) |
| 74 | EE | Boris Aronov,
Tetsuo Asano,
Naoki Katoh,
Kurt Mehlhorn,
Takeshi Tokuyama:
Polyline Fitting of Planar Points under Min-sum Criteria.
Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006) |
| 2005 |
|---|
| 73 | EE | Shin-ichi Tanigawa,
Naoki Katoh:
Finding a triangular mesh with a constant number of different edge lengths.
CCCG 2005: 274-277 |
| 72 | EE | Yin-Feng Xu,
Wenqiang Dai,
Naoki Katoh,
Makoto Ohsaki:
Triangulating a Convex Polygon with Small Number of Non-standard Bars.
COCOON 2005: 481-489 |
| 71 | EE | Katsutoshi Yada,
Yukinobu Hamuro,
Naoki Katoh,
Kazuhiro Kishiya:
The Future Direction of New Computing Environment for Exabyte Data in the Business World.
SAINT Workshops 2005: 316-319 |
| 70 | EE | Tetsuo Asano,
Mark de Berg,
Otfried Cheong,
Hazel Everett,
Herman J. Haverkort,
Naoki Katoh,
Alexander Wolff:
Optimal spanners for axis-aligned rectangles.
Comput. Geom. 30(1): 59-77 (2005) |
| 69 | EE | Danny Z. Chen,
Ovidiu Daescu,
Yang Dai,
Naoki Katoh,
Xiaodong Wu,
Jinhui Xu:
Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications.
J. Comb. Optim. 9(1): 69-90 (2005) |
| 2004 |
|---|
| 68 | EE | Danny Z. Chen,
Jinhee Chun,
Naoki Katoh,
Takeshi Tokuyama:
Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain.
COCOON 2004: 238-248 |
| 67 | EE | Boris Aronov,
Tetsuo Asano,
Naoki Katoh,
Kurt Mehlhorn,
Takeshi Tokuyama:
Polyline Fitting of Planar Points Under Min-sum Criteria.
ISAAC 2004: 77-88 |
| 66 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces.
SWAT 2004: 455-467 |
| 65 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
The structure and number of global roundings of a graph.
Theor. Comput. Sci. 325(3): 425-437 (2004) |
| 2003 |
|---|
| 64 | | Toshihide Ibaraki,
Naoki Katoh,
Hirotaka Ono:
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
Springer 2003 |
| 63 | EE | Katsutoshi Yada,
Yukinobu Hamuro,
Naoki Katoh,
Takashi Washio,
Issey Fusamoto,
Daisuke Fujishima,
Takaya Ikeda:
Data Mining Oriented CRM Systems Based on MUSASHI: C-MUSASHI.
Active Mining 2003: 152-173 |
| 62 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
The Structure and Number of Global Roundings of a Graph.
COCOON 2003: 130-138 |
| 61 | EE | Naoki Katoh,
Katsutoshi Yada,
Yukinobu Hamuro:
Business Application for Sales Transaction Data by Using Genome Analysis Technology.
Discovery Science 2003: 208-219 |
| 60 | EE | Xavier Gandibleux,
Hiroyuki Morita,
Naoki Katoh:
Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives.
EMO 2003: 43-57 |
| 59 | EE | Tetsuo Asano,
Naoki Katoh,
Koji Obokata,
Takeshi Tokuyama:
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning.
SIAM J. Comput. 32(6): 1423-1435 (2003) |
| 2002 |
|---|
| 58 | EE | Yukinobu Hamuro,
Hideki Kawata,
Naoki Katoh,
Katsutoshi Yada:
A Machine Learning Algorithm for Analyzing String Patterns Helps to Discover Simple and Interpretable Business Rules from Purchase History.
Progress in Discovery Science 2002: 565-575 |
| 57 | EE | Tetsuo Asano,
Naoki Katoh,
Koji Obokata,
Takeshi Tokuyama:
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning.
SODA 2002: 896-904 |
| 56 | EE | Tetsuo Asano,
Naoki Katoh,
Koji Obokata,
Takeshi Tokuyama:
Combinatorial and Geometric Problems Related to Digital Halftoning.
Theoretical Foundations of Computer Vision 2002: 58-71 |
| 55 | EE | Naoki Katoh,
Takeshi Tokuyama:
K-Levels of Concave Surfaces.
Discrete & Computational Geometry 27(4): 567-584 (2002) |
| 54 | EE | Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications.
Int. J. Comput. Geometry Appl. 12(5): 429- (2002) |
| 53 | | Franz Aurenhammer,
Naoki Katoh,
Hiromichi Kojima,
Makoto Ohsaki,
Yin-Feng Xu:
Approximating uniform triangular meshes in polygons.
Theor. Comput. Sci. 289(2): 879-895 (2002) |
| 2001 |
|---|
| 52 | EE | Xavier Gandibleux,
Hiroyuki Morita,
Naoki Katoh:
The Supported Solutions Used as a Genetic Information in a Population Heuristics.
EMO 2001: 429-442 |
| 51 | EE | Naoki Katoh,
Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees.
Symposium on Computational Geometry 2001: 241-248 |
| 50 | EE | Naoki Katoh,
Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees
CoRR cs.CG/0103024: (2001) |
| 49 | | Tetsuo Asano,
Naoki Katoh,
Takeshi Tokuyama:
A unified scheme for detecting fundamental curves in binary edge images.
Comput. Geom. 18(2): 73-93 (2001) |
| 48 | | Tetsuo Asano,
Danny Z. Chen,
Naoki Katoh,
Takeshi Tokuyama:
Efficient Algorithms for Optimization-Based Image Segmentation.
Int. J. Comput. Geometry Appl. 11(2): 145-166 (2001) |
| 47 | | Tetsuo Asano,
Naoki Katoh,
Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.
J. Comb. Optim. 5(2): 213-231 (2001) |
| 2000 |
|---|
| 46 | EE | Franz Aurenhammer,
Naoki Katoh,
Hiromichi Kojima,
Makoto Ohsaki,
Yinfeng Xu:
Approximating Uniform Triangular Meshes in Polygons.
COCOON 2000: 23-33 |
| 45 | EE | Yukinobu Hamuro,
Naoki Katoh,
Katsutoshi Yada:
Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior.
Discovery Science 2000: 263-267 |
| 44 | EE | Naoki Katoh,
Hiromichi Kojima,
Ryo Taniguchi:
Approximating Uniform Triangular Meshes for Spheres.
JCDCG 2000: 192-204 |
| 43 | EE | Danny Z. Chen,
Ovidiu Daescu,
Yang Dai,
Naoki Katoh,
Xiaodong Wu,
Jinhui Xu:
Optimizing the sum of linear fractional functions and applications.
SODA 2000: 707-716 |
| 42 | | Yang Dai,
Naoki Katoh,
Siu-Wing Cheng:
LMT-skeleton heuristics for several new classes of optimal triangulations.
Comput. Geom. 17(1-2): 51-68 (2000) |
| 1999 |
|---|
| 41 | EE | Katsuki Fujisawa,
Yukinobu Hamuro,
Naoki Katoh,
Takeshi Tokuyama,
Katsutoshi Yada:
Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming.
Discovery Science 1999: 148-159 |
| 40 | EE | Naoki Katoh,
Takeshi Tokuyama:
Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications.
FOCS 1999: 389-398 |
| 39 | EE | Tetsuo Asano,
Naoki Katoh,
Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.
ISAAC 1999: 317-326 |
| 38 | EE | Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications.
SODA 1999: 517-526 |
| 37 | EE | Magnús M. Halldórsson,
Kazuo Iwano,
Naoki Katoh,
Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures.
SIAM J. Discrete Math. 12(3): 342-359 (1999) |
| 1998 |
|---|
| 36 | EE | Yang Dai,
Naoki Katoh:
On Computing New Classes of Optimal Trangulations with Angular Constraints.
COCOON 1998: 15-24 |
| 35 | EE | Yukinobu Hamuro,
Naoki Katoh,
Katsutoshi Yada:
Data Mining Oriented System for Business Applications.
Discovery Science 1998: 441-442 |
| 34 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Convertibility among Grid Filling Curves.
ISAAC 1998: 307-316 |
| 33 | EE | Shin-ya Hamaguchi,
Naoki Katoh:
A Capacitated Vehicle Routing Problem on a Tree.
ISAAC 1998: 397-406 |
| 32 | | Yukinobu Hamuro,
Naoki Katoh,
Yasuyuki Matsuda,
Katsutoshi Yada:
Mining Pharmacy Data Helps to Make Profits.
Data Min. Knowl. Discov. 2(4): 391-398 (1998) |
| 1997 |
|---|
| 31 | EE | Tetsuo Asano,
Naoki Katoh,
Hisao Tamaki,
Takeshi Tokuyama:
Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k.
STOC 1997: 275-283 |
| 30 | EE | Yang Dai,
Kazuo Iwano,
Naoki Katoh:
A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems.
Inf. Process. Lett. 64(5): 255-261 (1997) |
| 1996 |
|---|
| 29 | | Siu-Wing Cheng,
Naoki Katoh,
Manabu Sugai:
A Study of the LMT-Skeleton.
ISAAC 1996: 256-265 |
| 28 | | Tetsuo Asano,
Danny Z. Chen,
Naoki Katoh,
Takeshi Tokuyama:
Polynomial-Time Solutions to Image Segmentation.
SODA 1996: 104-113 |
| 27 | EE | Mary Inaba,
Hiroshi Imai,
Naoki Katoh:
Experimental Results of Randomized Clustering Algorithm.
Symposium on Computational Geometry 1996: C-1-C-2 |
| 26 | | Tetsuo Asano,
Naoki Katoh:
Variants for the Hough Transform for Line Detection.
Comput. Geom. 6: 231-252 (1996) |
| 25 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Siu-Wing Cheng,
Naoki Katoh,
Günter Rote,
Michael Taschwer,
Yin-Feng Xu:
Triangulations Intersect Nicely.
Discrete & Computational Geometry 16(4): 339-359 (1996) |
| 24 | EE | Yang Dai,
Hiroshi Imai,
Kazuo Iwano,
Naoki Katoh,
Keiji Ohtsuka,
Nobuhiko Yoshimura:
A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.
Discrete Applied Mathematics 65(1-3): 167-190 (1996) |
| 1995 |
|---|
| 23 | | John Staples,
Peter Eades,
Naoki Katoh,
Alistair Moffat:
Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings
Springer 1995 |
| 22 | | Magnús M. Halldórsson,
Kazuo Iwano,
Naoki Katoh,
Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures.
SODA 1995: 150-159 |
| 21 | | Naoki Katoh,
Takeshi Tokuyama,
Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points.
Discrete & Computational Geometry 13: 161-176 (1995) |
| 20 | | Naoki Katoh,
Kazuo Iwano:
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane.
Int. J. Comput. Geometry Appl. 5: 37-51 (1995) |
| 1994 |
|---|
| 19 | | Tetsuo Asano,
Naoki Katoh,
Takeshi Tokuyama:
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images.
ESA 1994: 215-226 |
| 18 | EE | Mary Inaba,
Naoki Katoh,
Hiroshi Imai:
Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract).
Symposium on Computational Geometry 1994: 332-339 |
| 1993 |
|---|
| 17 | | Tetsuo Asano,
Naoki Katoh:
Number Theory Helps Line Detection in Digital Images.
ISAAC 1993: 313-322 |
| 16 | | Yang Dai,
Hiroshi Imai,
Kazuo Iwano,
Naoki Katoh:
How to Treat Delete Requests in Semi-Online Problems.
ISAAC 1993: 48-57 |
| 15 | | Kazuo Iwano,
Naoki Katoh:
Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree.
Inf. Process. Lett. 48(5): 211-213 (1993) |
| 1992 |
|---|
| 14 | | Naoki Katoh,
Takeshi Tokuyama,
Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points
FOCS 1992: 396-405 |
| 13 | EE | Naoki Katoh,
Kazuo Iwano:
Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane.
Symposium on Computational Geometry 1992: 320-329 |
| 12 | | Naoki Katoh,
Toshihide Ibaraki,
Tiko Kameda:
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control.
Discrete Applied Mathematics 40(4): 379-395 (1992) |
| 1991 |
|---|
| 11 | | Naoki Katoh,
Kazuo Iwano:
Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract).
WADS 1991: 80-91 |
| 10 | | Alok Aggarwal,
Hiroshi Imai,
Naoki Katoh,
Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems.
J. Algorithms 12(1): 38-56 (1991) |
| 1990 |
|---|
| 9 | | Toshihide Ibaraki,
Naoki Katoh:
Searching Minimax Game Trees under Memory Space Constraint.
Ann. Math. Artif. Intell. 1: (1990) |
| 8 | EE | Toshihide Ibaraki,
Tiko Kameda,
Naoki Katoh:
Multiversion Cautious Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng. 16(3): 302-315 (1990) |
| 1989 |
|---|
| 7 | EE | Alok Aggarwal,
Hiroshi Imai,
Naoki Katoh,
Subhash Suri:
Fining k Points with Minimum Spanning Trees and Related Problems.
Symposium on Computational Geometry 1989: 283-291 |
| 1988 |
|---|
| 6 | EE | Toshihide Ibaraki,
Tiko Kameda,
Naoki Katoh:
Cautious Transaction Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng. 14(7): 997-1009 (1988) |
| 1987 |
|---|
| 5 | | Naoki Katoh,
Tiko Kameda,
Toshihide Ibaraki:
A Cautious Scheduler for Multistep Transactions.
Algorithmica 2: 1-26 (1987) |
| 1985 |
|---|
| 4 | EE | Naoki Katoh,
Toshihide Ibaraki,
Tiko Kameda:
Cautious Transaction Schedulers with Admission Control.
ACM Trans. Database Syst. 10(2): 205-229 (1985) |
| 1983 |
|---|
| 3 | | Toshihide Ibaraki,
Naoki Katoh:
On-Line Computation of Transitive Closures of Graphs.
Inf. Process. Lett. 16(2): 95-97 (1983) |
| 1981 |
|---|
| 2 | EE | Naoki Katoh,
Toshihide Ibaraki,
H. Mine:
An Algorithm for the K Best Solutions of the Resource Allocation Problem.
J. ACM 28(4): 752-764 (1981) |
| 1 | | Naoki Katoh,
Toshihide Ibaraki,
H. Mine:
An Algorithm for Finding K Minimum Spanning Trees.
SIAM J. Comput. 10(2): 247-255 (1981) |
