# Naoki Katoh

According to our database

Collaborative distances:

^{1}, Naoki Katoh authored at least 155 papers between 1981 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Theor. Comput. Sci., 2020

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.

CoRR, 2020

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".

Rev. Socionetwork Strateg., 2019

Rev. Socionetwork Strateg., 2019

CoRR, 2019

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Theory Comput. Syst., 2018

J. Comb. Optim., 2018

CoRR, 2018

CoRR, 2018

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

NII Shonan Meet. Rep., 2017

A population-based algorithm for solving linear assignment problems with two objectives.

Comput. Oper. Res., 2017

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Math. Program., 2016

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

Inf. Process. Lett., 2016

CoRR, 2016

CoRR, 2016

Comput. Geom., 2016

2015

Theor. Comput. Sci., 2015

Theor. Comput. Sci., 2015

Theor. Comput. Sci., 2015

CoRR, 2015

CoRR, 2015

Algorithmica, 2015

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

Theor. Comput. Sci., 2014

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity.

J. Graph Algorithms Appl., 2014

J. Comb. Optim., 2014

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

Discret. Appl. Math., 2014

CoRR, 2014

2013

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

Theor. Comput. Sci., 2013

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

SIAM J. Discret. Math., 2013

IEICE Trans. Inf. Syst., 2013

Discret. Math., 2013

Proceedings of the Theory and Applications of Models of Computation, 2013

Emerging Pattern Based Crime Spots Analysis and Rental Price Prediction.

Proceedings of the Contrast Data Mining: Concepts, Algorithms, and Applications, 2013

2012

Rev. Socionetwork Strateg., 2012

J. Comb. Optim., 2012

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Trans. Comput. Sci., 2011

J. Comb. Optim., 2011

Discret. Comput. Geom., 2011

2010

Int. J. Comput. Geom. Appl., 2010

2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Discret. Comput. Geom., 2009

Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees.

Discret. Appl. Math., 2009

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

Discret. Appl. Math., 2009

Comb., 2009

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Discret. Comput. Geom., 2008

Proceedings of the Modelling, 2008

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Theor. Comput. Sci., 2007

Risk discovery of car-related crimes from urban spatial attributes using emerging patterns.

Int. J. Knowl. Based Intell. Eng. Syst., 2007

Graphs Comb., 2007

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

Decis. Support Syst., 2007

Applying graph mining to discover substructures of room layouts which affect the rent of apartments.

Proceedings of the IEEE International Conference on Systems, 2007

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

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

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Int. J. Comput. Geom. Appl., 2006

IEICE Trans. Inf. Syst., 2006

IEICE Trans. Inf. Syst., 2006

An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity.

IEICE Trans. Inf. Syst., 2006

An approximation algorithm for the pickup and delivery vehicle routing problem on trees.

Discret. Appl. Math., 2006

Discret. Appl. Math., 2006

Algorithmica, 2006

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths.

Proceedings of the Algorithmic Aspects in Information and Management, 2006

An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications.

J. Comb. Optim., 2005

Comput. Geom., 2005

The Future Direction of New Computing Environment for Exabyte Data in the Business World.

Proceedings of the 2005 IEEE/IPSJ International Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops), 31 January, 2005

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Theor. Comput. Sci., 2004

Proceedings of the Algorithm Theory, 2004

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

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Matrix Rounding under the L<sup>p</sup>-Discrepancy Measure and Its Application to Digital Halftoning.

SIAM J. Comput., 2003

Proceedings of the System Modeling and Optimization, 2003

Proceedings of the Evolutionary Multi-Criterion Optimization, 2003

Business Application for Sales Transaction Data by Using Genome Analysis Technology.

Proceedings of the Discovery Science, 6th International Conference, 2003

Proceedings of the Active Mining, Second International Workshop, 2003

2002

Theor. Comput. Sci., 2002

Int. J. Comput. Geom. Appl., 2002

Discret. Comput. Geom., 2002

Proceedings of the Geometry, 2002

Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

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

Proceedings of the Progress in Discovery Science, 2002

2001

A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.

J. Comb. Optim., 2001

Int. J. Comput. Geom. Appl., 2001

Comput. Geom., 2001

Proceedings of the Evolutionary Multi-Criterion Optimization, 2001

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Comput. Geom., 2000

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Proceedings of the Discovery Science, 2000

1999

SIAM J. Discret. Math., 1999

Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications.

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming.

Proceedings of the Discovery Science, 1999

1998

Data Min. Knowl. Discov., 1998

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Proceedings of the Discovery Science, 1998

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems.

Inf. Process. Lett., 1997

Covering Points in the Plane by <i>k</i>-Tours: Towards a Polynomial Time Approximation Scheme for General <i>k</i>.

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Discret. Comput. Geom., 1996

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

Discret. Appl. Math., 1996

Comput. Geom., 1996

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

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

Int. J. Comput. Geom. Appl., 1995

Discret. Comput. Geom., 1995

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Networks, 1994

Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based <i>k</i>-Clustering (Extended Abstract).

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Networks, 1993

Inf. Process. Lett., 1993

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Discret. Appl. Math., 1992

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

Discret. Appl. Math., 1992

A fully polynomial time approximation scheme for minimum cost-reliability ratio problems.

Discret. Appl. Math., 1992

An e-approximation scheme for combinatorial optimization problems with minimum variance criterion.

Discret. Appl. Math., 1992

Finding <i>k</i> Farthest Pairs and <i>k</i> Closest/Farthest Bichromatic Pairs for Points in the Plane.

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Networks, 1991

J. Algorithms, 1991

Proceedings of the Algorithms and Data Structures, 1991

1990

IEEE Trans. Software Eng., 1990

Ann. Math. Artif. Intell., 1990

1989

Systems and Computers in Japan, 1989

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

IEEE Trans. Software Eng., 1988

Math. Oper. Res., 1988

Resource allocation problems - algorithmic approaches.

MIT Press series in the foundations of computing, MIT Press, ISBN: 978-0-262-09027-8, 1988

1987

Math. Program., 1987

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

Discret. Appl. Math., 1987

Algorithmica, 1987

1985

ACM Trans. Database Syst., 1985

Math. Oper. Res., 1985

Discret. Appl. Math., 1985

1983

Inf. Process. Lett., 1983

1982

Networks, 1982

1981

SIAM J. Comput., 1981

J. ACM, 1981