default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoki Katoh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j91]Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
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. 107(6): 732-740 (2024)- [j90]Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
:
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights. J. Comb. Optim. 48(2): 15 (2024) - [j89]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges. J. Comb. Optim. 48(3): 18 (2024) - 2023
- [j88]Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi:
Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs. Int. J. Comput. Math. Comput. Syst. Theory 8(1): 67-79 (2023) - [c89]Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG 2023: 191-196 - [c88]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges. COCOA (1) 2023: 29-42 - [c87]Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa:
The Line-Constrained Maximum Coverage Facility Location Problem. COCOA (1) 2023: 406-418 - [c86]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu:
Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) 2023: 220-231 - [c85]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - [i19]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges. CoRR abs/2301.06857 (2023) - [i18]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu:
The Two-Squirrel Problem and Its Relatives. CoRR abs/2302.05937 (2023) - 2021
- [j87]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks. Theor. Comput. Sci. 873: 87-113 (2021) - [c84]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - [c83]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. COCOON 2021: 244-256 - [c82]Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. WALCOM 2021: 52-64 - 2020
- [j86]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. Theor. Comput. Sci. 806: 388-401 (2020) - [c81]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. COCOA 2020: 198-213 - [i17]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. CoRR abs/2010.05729 (2020) - [i16]Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. CoRR abs/2011.13569 (2020)
2010 – 2019
- 2019
- [j85]Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno:
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13(2): 99-100 (2019) - [j84]Yuya Higashikawa, Naoki Katoh:
A Survey on Facility Location Problems in Dynamic Flow Networks. Rev. Socionetwork Strateg. 13(2): 163-208 (2019) - [c80]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC 2019: 42-58 - [i15]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - 2018
- [j83]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The mixed evacuation problem. J. Comb. Optim. 36(4): 1299-1314 (2018) - [j82]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. Theory Comput. Syst. 62(6): 1392-1408 (2018) - [c79]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC 2018: 14:1-14:13 - [c78]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA 2018: 78-89 - [i14]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR abs/1806.00814 (2018) - [i13]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Path Networks. CoRR abs/1810.10631 (2018) - 2017
- [j81]Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
A population-based algorithm for solving linear assignment problems with two objectives. Comput. Oper. Res. 79: 291-303 (2017) - [c77]Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - [i12]Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy:
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j80]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the edge crossing properties of Euclidean minimum weight Laman graphs. Comput. Geom. 51: 15-24 (2016) - [j79]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Adnan Sljoka:
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs. Inf. Process. Lett. 116(2): 175-178 (2016) - [j78]Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended formulations for sparsity matroids. Math. Program. 158(1-2): 565-574 (2016) - [c76]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The Mixed Evacuation Problem. COCOA 2016: 18-32 - [c75]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. IWOCA 2016: 122-134 - [i11]Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan:
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. CoRR abs/1606.07208 (2016) - [i10]Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR abs/1609.01373 (2016) - 2015
- [j77]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72(4): 1033-1054 (2015) - [j76]Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu:
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588: 24-36 (2015) - [j75]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. 607: 2-15 (2015) - [j74]Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell:
Optimally bracing grid frameworks with holes. Theor. Comput. Sci. 607: 337-350 (2015) - [c74]Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [c73]Takashi Horiyama, Jin-ichi Itoh, Naoki Katoh, Yuki Kobayashi, Chie Nara:
Continuous Folding of Regular Dodecahedra. JCDCGG 2015: 120-131 - [c72]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-Line Drawability of a Planar Graph Plus an Edge. WADS 2015: 301-313 - [i9]Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto:
Polynomial-time approximability of the k-Sink Location problem. CoRR abs/1503.02835 (2015) - [i8]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-line Drawability of a Planar Graph Plus an Edge. CoRR abs/1504.06540 (2015) - [i7]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. CoRR abs/1509.07600 (2015) - [i6]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - 2014
- [j73]Naoyuki Kamiyama, Naoki Katoh:
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discret. Appl. Math. 178: 89-100 (2014) - [j72]Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa:
Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28(2): 480-495 (2014) - [j71]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. J. Graph Algorithms Appl. 18(4): 539-555 (2014) - [j70]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama:
An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. 556: 2-12 (2014) - [c71]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple Sink Location Problems in Dynamic Path Networks. AAIM 2014: 149-161 - [c70]Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell:
Optimally Bracing Grid Frameworks with Holes. COCOA 2014: 474-489 - [c69]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM 2014: 125-137 - [i5]Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto:
Extended Formulations for Sparsity Matroids. CoRR abs/1403.7272 (2014) - [i4]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. CoRR abs/1405.5613 (2014) - 2013
- [j69]András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh:
Independent arborescences in directed graphs. Discret. Math. 313(4): 453-459 (2013) - [j68]Yuya Higashikawa, Naoki Katoh:
Online Vertex Exploration Problems in a Simple Polygon. IEICE Trans. Inf. Syst. 96-D(3): 489-497 (2013) - [j67]Naoki Katoh, Shin-ichi Tanigawa:
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. SIAM J. Discret. Math. 27(1): 155-185 (2013) - [j66]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513: 65-76 (2013) - [c68]Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi:
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA 2013: 165-177 - [c67]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. GD 2013: 71-82 - [c66]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. ISAAC 2013: 33-43 - [c65]Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu:
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC 2013: 121-132 - [p1]Naoki Katoh, Atsushi Takizawa:
Emerging Pattern Based Crime Spots Analysis and Rental Price Prediction. Contrast Data Mining 2013: 337-350 - 2012
- [j65]Naoki Katoh, Shin-ichi Tanigawa:
A rooted-forest partition with uniform vertex demand. J. Comb. Optim. 24(2): 67-98 (2012) - [j64]Atsushi Takizawa, Masaki Inoue, Naoki Katoh:
An Emergency Evacuation Planning Model Using the Universally Quickest Flow. Rev. Socionetwork Strateg. 6(1): 15-28 (2012) - [c64]Yuya Higashikawa, Naoki Katoh:
Online Exploration of All Vertices in a Simple Polygon. FAW-AAIM 2012: 315-326 - [c63]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). GD 2012: 339-345 - 2011
- [j63]Naoki Katoh, Shin-ichi Tanigawa:
A Proof of the Molecular Conjecture. Discret. Comput. Geom. 45(4): 647-700 (2011) - [j62]Naoyuki Kamiyama, Naoki Katoh:
Covering directed graphs by in-trees. J. Comb. Optim. 21(1): 2-18 (2011) - [j61]Eishi Chiba, Tetsuo Asano, Takeshi Miura, Naoki Katoh, Ikuo Mitsuka:
Collision Probability in an In-Line Machines Model. Trans. Comput. Sci. 13: 1-12 (2011) - [e4]Naoki Katoh, Amit Kumar:
WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6552, Springer 2011, ISBN 978-3-642-19093-3 [contents] - [i3]Naoki Katoh, Shin-ichi Tanigawa:
Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. CoRR abs/1109.0787 (2011) - 2010
- [j60]Jinhui Xu, Yang Yang, Yongding Zhu, Naoki Katoh:
A Geometric Spanner of Segments. Int. J. Comput. Geom. Appl. 20(1): 43-67 (2010) - [c62]Naoki Katoh, Shin-ichi Tanigawa:
A Rooted-Forest Partition with Uniform Vertex Demand. WALCOM 2010: 179-190
2000 – 2009
- 2009
- [j59]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. Comb. 29(2): 197-214 (2009) - [j58]Naoki Katoh, Shin-ichi Tanigawa:
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. Discret. Appl. Math. 157(17): 3569-3585 (2009) - [j57]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. 157(17): 3665-3677 (2009) - [j56]Naoki Katoh, Shin-ichi Tanigawa:
Fast Enumeration Algorithms for Non-crossing Geometric Graphs. Discret. Comput. Geom. 42(3): 443-468 (2009) - [c61]Naoki Katoh, Shin-ichi Tanigawa:
A proof of the molecular conjecture. SCG 2009: 296-305 - [c60]Naoki Katoh:
A Proof of the Molecular Conjecture. ISAAC 2009: 2-3 - [c59]Naoki Katoh, Shin-ichi Tanigawa:
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. ISAAC 2009: 524-533 - [c58]Naoyuki Kamiyama, Naoki Katoh:
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. ISAAC 2009: 802-811 - [r1]Naoki Katoh:
Combinatorial Optimization Algorithms in Resource Allocation Problems. Encyclopedia of Optimization 2009: 382-387 - 2008
- [j55]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40(1): 31-46 (2008) - [c57]Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa:
Geometric Spanner of Objects under L1 Distance. COCOON 2008: 395-404 - [c56]Naoyuki Kamiyama, Naoki Katoh:
Covering Directed Graphs by In-Trees. COCOON 2008: 444-457 - [c55]Naoki Katoh, Shin-ichi Tanigawa:
Fast enumeration algorithms for non-crossing geometric graphs. SCG 2008: 328-337 - [c54]Naoyuki Kamiyama, Naoki Katoh:
The Minimum Weight In-Tree Cover Problem. MCO 2008: 155-164 - [c53]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. SODA 2008: 518-526 - [e3]Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno:
Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers. Lecture Notes in Computer Science 4535, Springer 2008, ISBN 978-3-540-89549-7 [contents] - [i2]Naoyuki Kamiyama, Naoki Katoh:
Covering Directed Graphs by In-trees. CoRR abs/0802.2755 (2008) - 2007
- [j54]Katsutoshi Yada, Edward Hak-Sing Ip, Naoki Katoh:
Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability. Decis. Support Syst. 44(1): 223-234 (2007) - [j53]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23(Supplement-1): 117-134 (2007) - [j52]Atsushi Takizawa, Fumie Kawaguchi, Naoki Katoh, Kenji Mori, Kazuo Yoshida:
Risk discovery of car-related crimes from urban spatial attributes using emerging patterns. Int. J. Knowl. Based Intell. Eng. Syst. 11(5): 301-311 (2007) - [j51]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) - [c52]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 - [c51]Naoki Katoh, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Geometric Spanning Trees. COCOON 2007: 243-253 - [c50]Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh:
Geometric Spanner of Segments. ISAAC 2007: 75-87 - [c49]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32 - [c48]Atsushi Takizawa, Kazuma Yoshida, Naoki Katoh:
Applying graph mining to discover substructures of room layouts which affect the rent of apartments. SMC 2007: 3512-3518 - 2006
- [j50]Naoki Katoh:
Foreword. Algorithmica 44(2): 101-101 (2006) - [j49]Naoki Katoh, Hiro Ito:
Preface. Discret. Appl. Math. 154(16): 2239-2240 (2006) - [j48]Naoki Katoh, Taihei Yano:
An approximation algorithm for the pickup and delivery vehicle routing problem on trees. Discret. Appl. Math. 154(16): 2335-2349 (2006) - [j47]Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr:
Inserting Points Uniformly at Every Instance. IEICE Trans. Inf. Syst. 89-D(8): 2348-2356 (2006) - [j46]Shin-ichi Tanigawa, Naoki Katoh:
Finding a Triangular Mesh with a Constant Number of Different Edge Lengths. IEICE Trans. Inf. Syst. 89-D(8): 2364-2371 (2006) - [j45]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. IEICE Trans. Inf. Syst. 89-D(8): 2372-2379 (2006) - [j44]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. 16(2-3): 97-116 (2006) - [c47]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 - [c46]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. AAIM 2006: 231-242 - [c45]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. COCOON 2006: 205-215 - [c44]Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama:
Angular Voronoi Diagram with Applications. ISVD 2006: 18-24 - 2005
- [j43]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) - [j42]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) - [c43]Shin-ichi Tanigawa, Naoki Katoh:
Finding a triangular mesh with a constant number of different edge lengths. CCCG 2005: 274-277 - [c42]Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki:
Triangulating a Convex Polygon with Small Number of Non-standard Bars. COCOON 2005: 481-489 - [c41]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 - 2004
- [j41]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) - [c40]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 - [c39]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama:
Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88 - [c38]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467 - 2003
- [j40]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) - [c37]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 - [c36]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138 - [c35]Naoki Katoh, Katsutoshi Yada, Yukinobu Hamuro:
Business Application for Sales Transaction Data by Using Genome Analysis Technology. Discovery Science 2003: 208-219 - [c34]Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives. EMO 2003: 43-57 - [c33]Naoki Katoh:
Matrix Rounding and Related Problems with Application to Digital Halftoning. System Modelling and Optimization 2003: 59-72 - [e2]Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono:
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Lecture Notes in Computer Science 2906, Springer 2003, ISBN 3-540-20695-7 [contents] - 2002
- [j39]Naoki Katoh, Takeshi Tokuyama:
K-Levels of Concave Surfaces. Discret. Comput. Geom. 27(4): 567-584 (2002) - [j38]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. 12(5): 429-444 (2002) - [j37]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) - [c32]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 - [c31]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 - [c30]Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama:
Combinatorial and Geometric Problems Related to Digital Halftoning. Theoretical Foundations of Computer Vision 2002: 58-71 - 2001
- [j36]Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama:
A unified scheme for detecting fundamental curves in binary edge images. Comput. Geom. 18(2): 73-93 (2001) - [j35]Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama:
Efficient Algorithms for Optimization-Based Image Segmentation. Int. J. Comput. Geom. Appl. 11(2): 145-166 (2001) - [j34]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) - [c29]Naoki Katoh, Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees. SCG 2001: 241-248 - [c28]Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
The Supported Solutions Used as a Genetic Information in a Population Heuristics. EMO 2001: 429-442 - [i1]Naoki Katoh, Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees. CoRR cs.CG/0103024 (2001) - 2000
- [j33]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) - [c27]Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu:
Approximating Uniform Triangular Meshes in Polygons. COCOON 2000: 23-33 - [c26]Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada:
Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior. Discovery Science 2000: 263-267 - [c25]Naoki Katoh, Hiromichi Kojima, Ryo Taniguchi:
Approximating Uniform Triangular Meshes for Spheres. JCDCG 2000: 192-204 - [c24]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
1990 – 1999
- 1999
- [j32]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SIAM J. Discret. Math. 12(3): 342-359 (1999) - [c23]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 - [c22]Naoki Katoh, Takeshi Tokuyama:
Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. FOCS 1999: 389-398 - [c21]Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. ISAAC 1999: 317-326 - [c20]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999: 517-526 - 1998
- [j31]Yukinobu Hamuro, Naoki Katoh, Yasuyuki Matsuda, Katsutoshi Yada:
Mining Pharmacy Data Helps to Make Profits. Data Min. Knowl. Discov. 2(4): 391-398 (1998) - [c19]Shunzo Yamashita, Naoki Katoh, Yasuhiko Sasaki, Yohei Akita, Hidetoshi Chikata, Kazuo Yano:
Hole filling: a novel delay reduction technique using selector logic. CICC 1998: 291-294 - [c18]Yang Dai, Naoki Katoh:
On Computing New Classes of Optimal Trangulations with Angular Constraints. COCOON 1998: 15-24 - [c17]Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada:
Data Mining Oriented System for Business Applications. Discovery Science 1998: 441-442 - [c16]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Convertibility among Grid Filling Curves. ISAAC 1998: 307-316 - [c15]Shin-ya Hamaguchi, Naoki Katoh:
A Capacitated Vehicle Routing Problem on a Tree. ISAAC 1998: 397-406 - 1997
- [j30]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) - [c14]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 - 1996
- [j29]Tetsuo Asano, Naoki Katoh:
Variants for the Hough Transform for Line Detection. Comput. Geom. 6: 231-252 (1996) - [j28]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. Discret. Appl. Math. 65(1-3): 167-190 (1996) - [j27]Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu:
Triangulations Intersect Nicely. Discret. Comput. Geom. 16(4): 339-359 (1996) - [c13]Mary Inaba, Hiroshi Imai, Naoki Katoh:
Experimental Results of Randomized Clustering Algorithm. SCG 1996: C-1-C-2 - [c12]Siu-Wing Cheng, Naoki Katoh, Manabu Sugai:
A Study of the LMT-Skeleton. ISAAC 1996: 256-265 - [c11]Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama:
Polynomial-Time Solutions to Image Segmentation. SODA 1996: 104-113 - 1995
- [j26]Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points. Discret. Comput. Geom. 13: 161-176 (1995) - [j25]Naoki Katoh, Kazuo Iwano:
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. Int. J. Comput. Geom. Appl. 5: 37-51 (1995) - [c10]Tetsuo Asano, Naoki Katoh, Elena Lodi, Thomas Roos:
Optimal approximation of monotone curves on a grid. CCCG 1995: 37-42 - [c9]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SODA 1995: 150-159 - [e1]John Staples, Peter Eades, Naoki Katoh, Alistair Moffat:
Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings. Lecture Notes in Computer Science 1004, Springer 1995, ISBN 3-540-60573-8 [contents] - 1994
- [j24]Naoki Katoh, Kazuo Iwano:
Efficient algorithms for minimum range cut problems. Networks 24(7): 395-407 (1994) - [c8]Mary Inaba, Naoki Katoh, Hiroshi Imai:
Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). SCG 1994: 332-339 - [c7]Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama:
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. ESA 1994: 215-226 - 1993
- [j23]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) - [j22]Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita:
Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993) - [c6]Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh:
How to Treat Delete Requests in Semi-Online Problems. ISAAC 1993: 48-57 - [c5]Tetsuo Asano, Naoki Katoh:
Number Theory Helps Line Detection in Digital Images. ISAAC 1993: 313-322 - 1992
- [j21]Naoki Katoh:
An e-approximation scheme for combinatorial optimization problems with minimum variance criterion. Discret. Appl. Math. 35(2): 131-141 (1992) - [j20]Naoki Katoh:
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems. Discret. Appl. Math. 35(2): 143-155 (1992) - [j19]Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki:
Optimal strategies for some team games. Discret. Appl. Math. 35(3): 275-291 (1992) - [j18]Naoki Katoh, Toshihide Ibaraki, Tiko Kameda:
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discret. Appl. Math. 40(4): 379-395 (1992) - [c4]Naoki Katoh, Kazuo Iwano:
Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. SCG 1992: 320-329 - [c3]Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points. FOCS 1992: 396-405 - 1991
- [j17]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12(1): 38-56 (1991) - [j16]Tetsuo Ichimori, Naoki Katoh:
A two-commodity sharing problem on networks. Networks 21(5): 547-563 (1991) - [c2]Naoki Katoh, Kazuo Iwano:
Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). WADS 1991: 80-91 - 1990
- [j15]Toshihide Ibaraki, Naoki Katoh:
Searching Minimax Game Trees under Memory Space Constraint. Ann. Math. Artif. Intell. 1: 141-153 (1990) - [j14]Toshihide Ibaraki, Tiko Kameda, Naoki Katoh:
Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 16(3): 302-315 (1990)
1980 – 1989
- 1989
- [j13]Jun Kiniwa, Naoki Katoh:
A 1-Version Cautious Transaction Scheduler with Dynamic Version Selection. Syst. Comput. Jpn. 20(12): 91-100 (1989) - [c1]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Fining k Points with Minimum Spanning Trees and Related Problems. SCG 1989: 283-291 - 1988
- [b1]Toshihide Ibaraki, Naoki Katoh:
Resource allocation problems - algorithmic approaches. MIT Press series in the foundations of computing, MIT Press 1988, ISBN 978-0-262-09027-8, pp. I-IX, 1-229 - [j12]Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori:
The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. 13(1): 164-173 (1988) - [j11]Toshihide Ibaraki, Tiko Kameda, Naoki Katoh:
Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14(7): 997-1009 (1988) - 1987
- [j10]Naoki Katoh, Tiko Kameda, Toshihide Ibaraki:
A Cautious Scheduler for Multistep Transactions. Algorithmica 2: 1-26 (1987) - [j9]Naoki Katoh, Toshihide Ibaraki:
A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program. Discret. Appl. Math. 17(1-2): 39-66 (1987) - [j8]Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki:
Approximation algorithms for combinatorial fractional programming problems. Math. Program. 37(3): 255-267 (1987) - 1985
- [j7]Naoki Katoh, Toshihide Ibaraki:
An efficient algorithm for the parametric resource allocation problem. Discret. Appl. Math. 10(3): 261-274 (1985) - [j6]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the Equipollent Resource Allocation Problem. Math. Oper. Res. 10(1): 44-53 (1985) - [j5]Naoki Katoh, Toshihide Ibaraki, Tiko Kameda:
Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. 10(2): 205-229 (1985) - 1983
- [j4]Toshihide Ibaraki, Naoki Katoh:
On-Line Computation of Transitive Closures of Graphs. Inf. Process. Lett. 16(2): 95-97 (1983) - 1982
- [j3]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An efficient algorithm for K shortest simple paths. Networks 12(4): 411-427 (1982) - 1981
- [j2]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the K Best Solutions of the Resource Allocation Problem. J. ACM 28(4): 752-764 (1981) - [j1]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. 10(2): 247-255 (1981)
Coauthor Index
Binay K. Bhattacharya
aka: Binay Bhattacharya
aka: Binay Bhattacharya
[j91] [j90] [j89] [j88] [c89] [c88] [c87] [c86] [c85] [i19] [i18] [j87] [c84] [c83] [c82] [j86] [c81] [i17] [i16] [j85] [j84] [c80] [i15] [j83] [j82] [c79] [c78] [i14] [i13] [c77] [j79] [c76] [c75] [i11] [i10] [j76] [j75] [j74] [c74] [i9] [i7] [i6] [j72] [j71] [j70] [c71] [c70] [c69] [i4] [j68] [c68] [c65] [c64]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-09 15:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
