Researcher Profile and Settings

Researcher

• Name

  Nakano SHINICHI

Affiliation

• Faculty of Informatics Studies course, Professor

Profile and Settings

• Name

  SHINICHI, Nakano

ホームページ

• URI

  https://sites.google.com/view/nakanoshin/nakano-e, Shin-ichi Nakano

Foreign language

• Use in presentation

  English

• Use in publication

  English

Affiliation

• Affiliation

  Graduate School of Science and Technology

• Job title

  Professor

Education

• Apr. 1978, Mar. 1981
• Apr. 1981, Mar. 1985, Tohoku University, Faculty of Engineering
• Apr. 1985, Mar. 1987, Tohoku University, Graduate School of Engineering

Degree

• (BLANK)

Association Memberships

• ACM

Research Experience

• Mar. 2004, 9999, Gunma University
• Mar. 1999, Feb. 2004, Gunma University
• Jul. 1996, Feb. 1999, Tohoku University
• Apr. 1990, Jun. 1996, Tohoku University
• Apr. 1987, Mar. 1990, Seiko Epson Corp.

Joint research and hope theme

• Technical consulting:Impossible, Joint Research:Possible, Others:Impossible
• Technical consulting:Impossible, Joint Research:Possible, Others:Impossible
• Technical consulting:Impossible, Joint Research:Possible, Others:Impossible
• Technical consulting:Impossible, Joint Research:Possible, Others:Impossible

Research Activities

Research Areas

• Informatics, Information theory

Research Interests

• Algorithm

Research Themes

• Graph Algorithms, Algorithm,graph, Institutional Collaboration, 1985

Published Papers

• 直交する2 直線上のmax-min dispersion 問題, 関 一輝 中野眞一, Sep. 2025, J108-A, Scientific journal
• (t,s)-completely Independent Spanning Trees, Shin-ichi Nakano, Sep. 2025, IEICE TRANS. FUNDAMENTALS,, E108-A, Scientific journal
• 部屋の最小面積を指定したフロアプランの列挙, 須田 瑠菜　 中野眞一, Apr. 2025, 108, 4, 192, 198, Scientific journal
• Enumerating Floorplans with Any Set of Columns, Yosuke Kikuchi and Shin-ichi Nakano, Aug. 2024, Proc. of COCOON 2024, Lecture Notes in Computer Science, International conference proceedings
• 近接条件つき2-gather clustering問題の近似アルゴリズム, 友松稔里　中野眞一, Jan. 2025, J108-D, Scientific journal
• Escape from the Room, Kento KIMURA, Tomohiro HARAMIISHI, Kazuyuki AMANO and Shin-ichi NAKANO, Mar. 2025, IEICE TRANS. INF.& SYST., E108-D, 3, Scientific journal
• Enumerating floorplans with Aligned Columns, Shin-ichi Nakano, Mar. 2025, IEICE TRANS. INF.& SYST., E108-D, 3, Scientific journal
• A Gray Code of Ordered Trees, Shin-ichi Nakano, May 2024, Proc. of TAMC2024, Lecture Notes in Computer Scince, 13637, 26, 37, International conference proceedings
• Dispersion in a Polygon, Tetsuya Araki and Shin-ichi Nakano, Sep. 2024, IEICE TRANS. FUNDAMENTALS,, E107-A, 9, 1458, 1464, Scientific journal
• 2つの型の壁が指定されたフロアプランの列挙, 林　登生, 宮田洋行, 中野眞一, May 2024, J107A, 3, 56, 63, Scientific journal
• Assigning proximity facilities for gatherings, Shin-ichi Nakano, Mar. 2024, IEICE TRANS. INF.& SYST.,, E107-D, 3, 383, 385, Scientific journal
• Enumerating Floorplans with Walls, Katsuhisa Yamanaka and Shin-ichi Nakano, 15 Jan. 2024, Discrete Applied Mathematics, 342, 1, 11, Scientific journal
• 重み付き min-max r-gathering, 知久侑生, 宮田洋行, 中野眞一, Jan. 2024, J107A, 1, 1, 5, Scientific journal
• Variants of Euclidean k-center Clusterings, Shin-ichi Nakano, Dec. 2023, Proc. of COCOON 2023, Lecture Notes in Computer Sciences, 14422, 209, 219, International conference proceedings
• Family Trees for Enumeration, Shin-ichi Nakano, 2023, International Journal of Foundations of Computer Science, Scientific journal
• Away from Each Other, Tetsuya Araki and Shin-Ichi Nakano, Mar. 2023, Proc. of WALCOM 2023, Lecture Notes in Computer Science, 13973, 61, 70, Scientific journal
• Escape from the Room, Kento Kimura, Kazuyuki Amano and Shin-ichi Nakano, Jan. 2023, Proc. COCOON 2022, LNCS, International conference proceedings
• The Coverage problem by Aligned Disks, Shin-ichi Nakano, 2022, International Journal of Computational Geometry and Applications, 31, 5, 1, 11, Scientific journal

  DOI
• Dispersion on Intervals, Tetsuya Araki, Hiroyuki Miyata and Shin-ichi Nakano, Sep. 2022, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E105-A, 9, 1181, 1186, Scientific journal
• An O(n^2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Convex Polygon, Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka, Mar. 2022, IEICE TRANS. INF.& SYST., E105-D, 3, 503, 507, Scientific journal
• r-Gatherings on a Star and Uncertain r-Gatherings on a Line, Shareef Ahmed, Shin-ichi Nakano and Md Saidur Rahman, 2022, Discrete Mathematics, Algorithms and Applications (DMAA), Scientific journal
• The Coverage problem by Aligned Disks, Shin-Ichi Nakano, Oct. 2021, Proc. of COCOON2021,, LNCS, International conference proceedings
• Max-Min 3-dispersion Problems, Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa, Sep. 2021, IEICE TRANS. FUNDAMENTALS, Vol.E104-A, 9, 1101, 1107, International conference proceedings
• 円周上のmax-min 5-dispersion問題, 角田倫久, 宮田洋行, 中野眞一, Mar. 2021, Vol.62, 3, 931, 935, Scientific journal
• Efficient Algorithms for the Partial Sum Dispersion Problem, Toshihiro Akagi, Tetsuya Araki and Shin-ichi Nakano, Oct. 2020, IEICE TRANS. FUNDAMENTALS, Vol.E103-A, 10, 1206, 1210, Scientific journal
• Floorplans with Walls, Katsuhisa Yamanaka and Shin-Ichi Nakano, May 2020, Proc. of TAMC 2020, LNCS 12337, 50, 59, International conference proceedings
• Max-Min Dispersion on a Line, Tetsuya Araki and Shin-ichi Nakano, 2022, Journal of Combinatorial Optimization, 44, 1824, 1830, Scientific journal

  DOI
• An Approximation Algorithm for the 2-Dispersion Problem, Amano, Kazuyuki;Nakano, Shin-ichi, Mar. 2020, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E103D, 3, 506, 508, Scientific journal

  DOI
• A Simple Algorithm for r-gatherings on the Line, Nakano SHINICHI, Oct. 2019, JGAA, 23, 5, 837, 845, Scientific journal
• 円周上のmax-min 4-dinspersion問題, 四家祐志,佐藤寛斗,宮田洋行,中野眞一, Oct. 2019, J102-D, 10, 670, 673, Scientific journal
• Enumerating Highly-Edge-Connected Spanning Subgraphs, Katsuhisa Yamanaka,Yasuko Matsui,Shin-Ichi Nakano, Sep. 2019, IEICE TRANS. FUNDAMENTAL, E102A, 9, 1002, 1006, Scientific journal
• Simple Fold and Cut Problem for Line Segments, Guoxin Hu,Shinichi Nakano,Ryuhei Uehara,Takeaki Uno, Aug. 2019, Proc. of CCCG 2019, 158, 163, International conference proceedings
• One-dimensional r-Gathering under Uncertainty, Shareef Ahmed,Shin-Ichi Nakano,Md. Saidur Rahman, Aug. 2019, Proc. of AAIM 2019, LNCS, 11640, 1, 15, International conference proceedings
• r-Gatherings on a Star, Shareef Ahmed,Shin-Ichi Nakano,Md. Saidur Rahman, Feb. 2019, Proc. of WALCOM 2019, LNCS, 11355, 31, 42, Scientific journal
• Sequentially Swapping Colored Tokens on Graphs, Katsuhisa Yamanaka,Erik D. Demaine,Takashi Horiyama,Akitoshi Kawamura,Shin-Ichi Nakano,Yoshio Okamoto,Toshiki Saitoh,Akira Suzuki,Ryuhei Uehara,Takeaki Uno, Jan. 2019, JGAA, 23, 1, 3, 27, Scientific journal
• Max-Min 3-Dispersion Problems., Takashi Horiyama,Shin-Ichi Nakano,Toshiki Saitoh,Koki Suetsugu,Akira Suzuki,Ryuhei Uehara,Takeaki Uno,Kunihiro Wasa, 2019, Proc. of COCOON 2019, LNCS, 11653, 291, 300, International conference proceedings

  DOI
• The Max-Min Dispersion on a Line, Tetsuya Araki,Shin-ichi Nakano, Dec. 2018, Proc. of COCOA 2018, LNCS 11346, 11346, 672, 678, International conference proceedings
• Enumerating Floorplans with Columns, Katsuhisa Yamanaka,Md. Saidur Rahman,Shin-Ichi Nakano, Sep. 2018, IEICE TRANS. FUNDAMENTALS,, E101-A, 9, 1392, 1397, Scientific journal
• Away from Rivals, Kazuyuki Amano,Shin-Ichi Nakano, Aug. 2018, Proc. of CCCG 2018, International conference proceedings
• More Routes for Evacuation, Katsuhisa Yamanaka,Yasuko Matsui,Shin-Ichi Nakano, Jul. 2018, Proc. of COCOON 2018, LNCS 10976, 10976, 76, 83, International conference proceedings
• A Simple Algorithm for r-gatherings on the Line, Shin-ichi Nakano, Mar. 2018, Proc. of WALCOM 2018, LNCS10755, LNCS 10755,, 1, 7, International conference proceedings
• Exact Algorithms for the Max-Min Dispersion Problem., Toshihiro Akagi,Tetsuya Araki,Takashi Horiyama,Shin-Ichi Nakano,Yoshio Okamoto,Yota Otachi,Toshiki Saitoh,Ryuhei Uehara,Takeaki Uno,Kunihiro Wasa, 2018, Proc. of FAW 2018, LNCS 10823, 10823, 263, 272, International conference proceedings

  DOI
• Floorplans with Columns, Katsuhisa Yamanaka,Md. Saidur Rahman,Shin-Ichi Nakano, Dec. 2017, Proc. of COCOA, LNCS 10627, 10627, 33, 40, International conference proceedings
• Enumeration, Counting, and Random Generation of Ladder Lotteries, Katsuhisa Yamanaka,Shin-ichi Nakano, Mar. 2017, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E100D, 3, 444, 451, Scientific journal

  DOI
• On r-Gatherings on the Line, Toshihiro Akagi,Shin-ichi Nakano, Mar. 2017, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E100D, 3, 428, 433, Scientific journal

  DOI
• Sequentially Swapping Colored Tokens on Graphs, Katsuhisa Yamanaka,Erik D. Demaine,Takashi Horiyama,Akitoshi Kawamura,Shin-ichi Nakano,Yoshio Okamoto,Toshiki Saitoh,Akira Suzuki,Ryuhei Uehara,Takeaki Uno, 2017, WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 10167, 435, 447, International conference proceedings

  DOI
• Computational Complexity of Sequential Token Swapping Problem, 山中 克久,ドメイン エリック,堀山 貴史,河村 彰星,中野 眞一,岡本 吉央,斎藤 寿樹,鈴木 顕,上原 隆平,宇野 毅明, 24 Jun. 2016, 116, 116, 115, 121
• Faster Min-Max r-Gatherings, Toshihiro Akagi,Ryota Arai,ShIn-ichi Nakano, Jun. 2016, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E99A, 6, 1149, 1151, Scientific journal

  DOI
• シーケンシャルな交換による色付きトークン整列問題の計算複雑さ, 山中 克久,エリック ドメイン,堀山 貴史,河村 彰星,中野 眞一,岡本 吉央,斎藤 寿樹,鈴木 顕,上原 隆平,宇野 毅明, Jun. 2016, 1, 7, Symposium
• Uniformly Random Generation of Floorplans, Katsuhisa Yamanaka,Shin-ichi Nakano, Mar. 2016, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E99D, 3, 624, 629, Scientific journal

  DOI
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares, Takehiro Ito,Shin-ichi Nakano,Yoshio Okamoto,Yota Otachi,Ryuhei Uehara,Takeaki Uno,Yushi Uno, Jan. 2016, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 51, 25, 39, Scientific journal

  DOI
• Assigning Proximity Facilities for Gatherings, Shin-ichi Nakano, 2016, COMPUTING AND COMBINATORICS, COCOON 2016, 9797, 247, 253, International conference proceedings

  DOI
• Another Optimal Binary Representation of Mosaic Floorplans, Katsuhisa Yamanaka,Shin-ichi Nakano, Jun. 2015, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E98A, 6, 1223, 1224, Scientific journal

  DOI
• On r-Gatherings on the Line, Toshihiro Akagi,Shin-ichi Nakano, 2015, FRONTIERS IN ALGORITHMICS (FAW 2015), 9130, 25, 32, International conference proceedings

  DOI
• Enumeration, Counting, and Random Generation of Ladder Lotteries, Katsuhisa Yamanaka,Shin-ichi Nakano, 2015, FRONTIERS IN ALGORITHMICS (FAW 2015), 9130, 294, 303, International conference proceedings

  DOI
• Anti-Slide, Kazuyuki Amano,Shin'ichi Nakano,Koichi Yamazaki, 2015, Journal of Information Processing, 23, 3, 252, 257, Scientific journal

  DOI
• A 4.31-approximation for the geometric unique coverage problem on unit disks, Takehiro Ito,Shin-ichi Nakano,Yoshio Okamoto,Yota Otachi,Ryuhei Uehara,Takeaki Uno,Yushi Uno, Aug. 2014, THEORETICAL COMPUTER SCIENCE, 544, 14, 31, Scientific journal

  DOI
• Efficient Enumeration of All Ladder Lotteries with k Bars, Katsuhisa Yamanaka,Shin-ichi Nakano, Jun. 2014, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E97A, 6, 1163, 1170, Scientific journal

  DOI
• 指定した次数列をもつ順序なし木の高速列挙, 石川雅信,中野眞一, Nov. 2013, J96-D, 11, 2041, 2046, Scientific journal
• Efficient algorithms for a simple network design problem, Shin-ichi Nakano,Ryuhei Uehara,Takeaki Uno, Sep. 2013, NETWORKS, 62, 2, 95, 104, Scientific journal

  DOI
• 指定した次数列をもつ連結外平面グラフの列挙, 金井 祐一,中野眞一, Sep. 2013, J96-A, 9, 643, 649, Scientific journal
• 格子L字描画のコンパクトな符号, 斎藤雅士,中野眞一, Sep. 2013, J96-D, 9, 2041, 2046, Scientific journal
• A Compact Encoding of Rectangular Drawings with Edge Lengths, Shin-ichi Nakano,Katsuhisa Yamanak, Jun. 2013, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A, 6, 1032, 1035, Scientific journal

  DOI
• Two Compact Codes for Rectangular Drawings with Degree Four Vertices, Masashi Saito,Shin-ichi Nakano, 2013, Journal of Information Processing, 21, 4, 660, 664, Scientific journal

  DOI
• Bounding the Number of Reduced Trees Cographs aned Series Parallel Graphs by Compression, T. Uno,R. Uehara,S. Nakano, 2013, Discrete Mathematics Algorithms and Applications, 5, 2, 1360001 (14page), Scientific journal
• Efficient enumeration of ordered trees with k leaves, Katsuhisa Yamanaka,Yota Otachi,Shin-ichi Nakano, Jul. 2012, THEORETICAL COMPUTER SCIENCE, 442, 22, 27, Scientific journal

  DOI
• A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares, Takehiro Ito,Shin-Ichi Nakano,Yoshio Okamoto,Yota Otachi,Ryuhei Uehara,Takeaki Uno,Yushi Uno, Jul. 2012, Proc. of SWAT 2012, LNCS 7357,, 7357, 24, 35, International conference proceedings

  DOI
• 単位正方形上の一意被覆問題に対する近似アルゴリズム, 伊藤 健洋,中野 眞一,岡本 吉央,大舘 陽太,上原 隆平,宇野 毅明,宇野 裕之, Jun. 2012, 95, 101, Symposium
• Enumerating All Rooted Trees Including k Leaves, Masanobu Ishikawa,Katsuhisa Yamanaka,Yota Otachi,Shin-ichi Nakano, Mar. 2012, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 3, 763, 768, Scientific journal

  DOI
• Bounding the number of reduced trees, cographs, and series-parallel graphs by compression, Takeaki Uno,Ryuhei Uehara,Shin-Ichi Nakano, Feb. 2012, Proc. of WALCOM 2012, LNCS 7157, 7157, 5, 16, International conference proceedings

  DOI
• A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks, Takehiro Ito,Shin-ichi Nakano,Yoshio Okamoto,Yota Otachi,Ryuhei Uehara,Takeaki Uno,Yushi Uno, 2012, ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 372, 381, International conference proceedings
• 格子方形描画のコンパクトな符号, 須田亮平,中野眞一,山中克久, Dec. 2011, J94-D,, 12, 2031, 2036, Scientific journal
• Listing All st-Orientations, Andry Setiawan,Shin-ichi Nakano, Oct. 2011, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E94A, 10, 1965, 1970, Scientific journal

  DOI
• A Compact Encoding of Unordered Binary Trees, Kozue Iwata,Shiro Ishiwata,Shin-ichi Nakano, 2011, THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 6648, 106, 113, International conference proceedings

  DOI
• Generating All Triangulations of Plane Graphs, Mohammad Tanvir Parvez,Md. Saidur Rahman,Shin-Ichi Nakano, 2011, Journal of Graph Algorithms and Applications, 15, 3, 457, 476, Scientific journal

  DOI
• A compact encoding of plane triangulations with efficient query supports, Katsuhisa Yamanaka,Shin-ichi Nakano, Sep. 2010, INFORMATION PROCESSING LETTERS, 110, 18-19, 803, 809, Scientific journal

  DOI
• 2連結平面グラフのst-numberingの列挙, 金子昌弘,中野眞一, Mar. 2010, 20, 1, 33, 44, Scientific journal
• Efficient enumeration of all ladder lotteries and its application., Katsuhisa Yamanaka,Shin-Ichi Nakano,Yasuko Matsui,Ryuhei Uehara,Kento Nakada, 2010, Theor. Comput. Sci., 411, 16-18, 1714, 1722, Scientific journal

  DOI
• A Simple Canonical Code for Fullerene Graphs, Naoki Shimotsuma,Shin-ichi Nakano, Dec. 2009, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 12, 3398, 3400, Scientific journal

  DOI
• A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs, Shin-ichi Nakano,Ryuhei Uehara,Takeaki Uno, May 2009, JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 24, 3, 517, 533, Scientific journal

  DOI
• Generating All Triangulations of Plane Graphs, Mohammad Tanvir Parvez,Md. Saidur Rahman,Shin-Ichi Nakano, Feb. 2009, Proc. of WALCOM 2009, LNCS 5431, 5431, 151, 164, International conference proceedings

  DOI
• Efficient Generation of Ordered Trees with n Vertices including k leaves, Katsuhisa Yamanaka,Yota Otachi,Shin-Ichi Nakano, Feb. 2009, Proc. of WALCOM 2009, LNCS 5431, 5431, 141, 150, International conference proceedings

  DOI
• Listing All Plane Graphs, Katsuhisa Yamanaka,Shin-Ichi Nakano, 2009, JGAA Journal of Graph Algorithms and Applications, 13, 1, 5, 18, Scientific journal
• A Compact Encoding of Rectangular Drawings with Efficient Query Supports, Katsuhisa Yamanaka,Shin-ichi Nakano, Sep. 2008, IEICE TRANS. FUNDAMENTALS, Vol.E91-A, 9, 2284, 2291, Scientific journal

  DOI
• 指定された次数列をもつグラフの列挙, 佐藤圭介,中野眞一, Jul. 2008, J91-A, 7, 716, 725, Scientific journal
• 順列の列挙, 関根航人,山中克久,中野眞一, May 2008, J91-A, 5, 543, 549, Scientific journal
• A Compact Encoding of Plane Triangulations with Efficient Query Support, Katsuhisa Yamanaka,Shin-Ichi Nakano, Feb. 2008, Proc. of WALCOM 2008, Lecture Notes in Computer Science, 4921, 120, 131, International conference proceedings

  DOI
• Listing all plane graphs, Katsuhisa Yamanaka,Shin-Ichi Nakano, 2008, WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 4921, 210, 221, International conference proceedings

  DOI
• 4連結極大平面グラフの列挙, 高埜博典,中野眞一, Dec. 2007, 17, 4, 363, 397, Scientific journal
• 葉の個数を指定した順序木の一様ランダム生成, 村松丘親,中野眞一, Dec. 2007, J90-A, 12, 940, 947, Scientific journal
• Constant time generation of integer partitions, Katsuhisa Yamanaka,Shin-ichiro Kawano,Yosuke Kikuchi,Shin-ichi Nakano, May 2007, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 888, 895, Scientific journal

  DOI
• Efficient Algorithms for Airline Problem, Shin-ichi Nakano,Ryuhei Uehara,Takeaki Uno, May 2007, Proc. of TAMC 2007, Lecture Notes in Computer Science, 4484, 428, 439, International conference proceedings
• 窓なし部屋の個数が高々kの方形描画の高速列挙アルゴリズム, 千明 大介,中野 眞一, Feb. 2007, J90-A, 2, 122, 130, Scientific journal
• A Compact Encoding of Rectangular Drawings with Efficient Query Supports, Katsuhisa Yamanaka,Shin-Ichi Nakano, 2007, Proc. of AAIM2007, Lecture Notes in Computer Sciences, 4508, 68, 81, Scientific journal
• A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs, Shin-ichi Nakano,Ryuhei Uehara,Takeaki Uno, 2007, Proc. of TAMC 2007, Lecture Notes in Computer Science, 4484, 115, 127, International conference proceedings
• Constant time generation of rectangular drawings with exactly n faces, Satoshi Yoshii,Daisuke Chigira,Katsuhisa Yamanaka,Shin-ichi Nakano, Sep. 2006, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 9, 2445, 2450, Scientific journal

  DOI
• Coding floorplans with fewer bits, Katsuhisa Yamanaka,Shin-ichi Nakano, May 2006, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1181, 1185, Scientific journal

  DOI
• Convex Grid Drawings of Four-connected Plane Graphs, KAZUYUKI MIURA,SHIN-ICHI NAKANO,TAKAO NISHIZEKI, May 2006, International Journal of Foundations of Computer Science, 17, 5, 1031, 1060, Scientific journal

  DOI
• 方形描画の数え上げ, 吉井 訓史,中野 眞一, Aug. 2005, J88-A, 8, 945, 952, Scientific journal
• Generating all series-parallel graphs, S Kawano,S Nakano, May 2005, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A, 5, 1129, 1135, Scientific journal

  DOI
• Constant time generation of set partitions, S Kawano,S Nakano, Apr. 2005, IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A, 4, 930, 934, Scientific journal

  DOI
• Generating Colored Trees, Shin-ichi Nakano,Takeaki Uno, 2005, proc. of WG 2005, Lecture Notes in Computer Science, 3787, 249, 260, International conference proceedings

  DOI
• 多面体の数え上げ, 佐藤 広幸,金子 雄一,中野 眞一, Nov. 2004, J87-A, 11, 1419, 1424, Scientific journal
• On the Enumeration of Colored Trees, 中野 眞一,宇野 毅明, May 2004, 17, 24, Symposium
• Efficient generation of triconnected plane triangulations, S Nakano, Feb. 2004, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 27, 2, 109, 122, Scientific journal

  DOI
• Efficient generation of plane triangulations with specified maximum degree, H Tanaka,SI Nakano, Feb. 2004, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E87D, 2, 330, 336, Scientific journal
• Constant time generation of trees with specified diameter, SI Nakano,T Uno, 2004, GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 3353, 33, 45, Scientific journal

  DOI
• An Improved Algorithm for the Nearly Equitable Edge-coloring Problem, Xuzhen XIE,Takao ONO,Shin-ichi NAKANO,Tomio HIRATA, 2004, IEICE TRANS. FUNDAMENTALS, E87-A, 5, 1029, 1033, Scientific journal
• L字形描画の列挙, 高木正博,中野 眞一, 2004, J87-D-I, 1, 1, 11, Scientific journal
• A Simple Constant Time Enumeration Algorithm for Free Trees, 中野 眞一,宇野 毅明, Sep. 2003, 9, 16, Symposium
• Listing All Connected Plane Triangulations, Zhang-Jian LI,Shin-ichi NAKANO, Jul. 2003, IEICE TRANS. FUNDAMENTALS, E86-A, 7, 1807, 1812, Scientific journal
• A Simple Algorithm for Generating Unordered Rooted Trees, 中野 眞一,宇野 毅明, May 2003, 25, 32, Symposium
• いくつかの特徴をもつ方形描画の列挙, 高木正博,中野 眞一, Apr. 2003, J86-D-I, 4, 208, 216, Scientific journal
• Efficient Generation of Plane Triangulations with a Degree Constraint, Hiroyuki TANAKA,Zhangjian LI,Shin-ichi NAKANO, Apr. 2003, IEICE TRANS. FUNDAMENTALS, E86-A, 4, 829, 834, Scientific journal
• Discovering frequent substructures in large unordered trees, T Asai,H Arimura,T Uno,S Nakano, 2003, DISCOVERY SCIENCE, PROCEEDINGS, 2843, 47, 61, Scientific journal
• How to obtain the complete list of caterpillars, Yosuke Kikuchi,Hiroyuki Tanaka,Shin-ichi Nakano,Yukio Shibata, 2003, Proc.of COCOON 2003, Lecture Notes in Computer Science, 2697, 329, 338, International conference proceedings
• More Efficient Generation of Plane Triangulations, Shin-ichi Nakano,Takeaki Uno, 2003, Proc. of Graph Drawing 2003, Lecture Notes in Computer Science, 2912, 273, 282, International conference proceedings
• Labeling points with rectangles of various shapes, A Koike,SI Nakano,T Nishizeki,T Tokuyama,S Watanabe, Dec. 2002, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 12, 6, 511, 528, Scientific journal

  DOI
• Efficient generation of plane trees, S Nakano, Nov. 2002, INFORMATION PROCESSING LETTERS, 84, 3, 167, 172, Scientific journal

  DOI
• 平面グラフのランダム生成とその応用, 金子雄一,中野 眞一, Sep. 2002, J85-A, 9, 976, 983, Scientific journal
• 2連結内部極大平面グラフの数え上げ, 金子雄一,中野 眞一, Jul. 2002, J85-A, 7, 811, 813, Scientific journal
• Enumerating Floorplans with n Rooms, NAKANO SHIN-ICHI, Jul. 2002, IEICE TRANS. FUNDAMENTALS, E85-A, 7, 1746, 1750, Scientific journal
• 平面三角分割グラフを列挙するアルゴリズムの改良, 中野 眞一,宇野 毅明, Jun. 2002, 39, 46, Symposium
• Rectangular drawings of plane graphs without designated corners, MS Rahman,S Nakano,T Nishizeki, Mar. 2002, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 21, 3, 121, 138, Scientific journal

  DOI
• Enumerating Floorplans with some properties, SHIN-ICHI NAKANO, 2002, Interdisciplinary Information Sciences, 8, 2, 199, 206
• A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs, Sayaka NAGAI,Shin-ichi NAKANO, Sep. 2001, IEICE TRANS. FUNDAMENTALS, E84-A, 9, 2330, 2337, Scientific journal
• A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs, Sayaka NAGAI,Shin-ichi NAKANO, May 2001, IEICE TRANS. FUNDAMENTALS, E84-A, 5, 1102, 1109, Scientific journal
• Enumerating Floorplans with n Rooms, NAKANO SHIN-ICHI, 2001, Proc. of ISAAC 2001, Lecture Notes in Computer Science, 2223, 107, 115, International conference proceedings

  DOI
• Efficient Generation of Triconnected Plane Triangulation, Shin-ichi Nakano, 2001, Proc. of COCOON 2001, Lecture Notes in Computer Science, 2108, 131, 141, International conference proceedings
• Grid Drawings of Four-connected Plane Graphs, Kazuyuki Miura,Shin-ichi Nakano,Takao Nishizeki, 2001, Discrete & Computational Geometry, 26, 73, 87, Scientific journal
• Box-rectangular drawings of plane graphs, MS Rahman,S Nakano,T Nishizeki, Nov. 2000, JOURNAL OF ALGORITHMS, 37, 2, 363, 398, Scientific journal

  DOI
• Planar Drawings of Plane Graphs, NAKANO SHIN-ICHI, Mar. 2000, IEICE TRANS. INF. & SYST., E83D, 3, 384, 391, Scientific journal
• A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs, S. NAKANO,M. Yoshikawa, 2000, Proc. of Graph Drawing 2000, Lecture Notes in Computer Science, 1984, 296, 307, International conference proceedings

  DOI
• Grid Drawings of Four-connected Plane Graphs, K.Miura,S.NAKANO,T.Nishizeki, 2000, Proc.of GraphDrawing 99, Lecture Notes in Computer Science, 1731, 145, 154, International conference proceedings

  DOI
• Labeling Points with Rectangles of Various Shapes, NAKANO SHIN-ICHI,Takao Nishizeki,Takeshi Tokuyama,Shuhei Watanabe, 2000, Proc. of Graph Drawing 2000, Lecture Notes in Computer Science, 1984, 91, 102, International conference proceedings

  DOI
• Convex Grid Drawings of Four-Connected Plane Graphs, K.Miura,S.NAKANO,T.Nishizeki, 2000, Proc.of eleventh Annual International Symposium on Algorithms and Computation, ISAAC 2000, Lecture Notes in Computer Scienc, 1969, 254, 265, International conference proceedings
• Rectangular Drawings of Plane Graphs without Designated Corners, S.Rahman,NAKANO SHIN-ICHI,Takao?Nishizeki, 2000, Proc.of 6th Annual International Conference, COCOON 2000, Lecture Notes in Computer Science, 1858, 85, 94, International conference proceedings
• A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs, Sayaka Nagai,NAKANO SHIN-ICHI, 2000, Proc. of Graph-Theoretic Concepts in Computer？Science,？WG00, Lecture Notes in Computer Science, 1928, 290, 301, International conference proceedings

  DOI
• グラフの自動描画, 中野 眞一,西関隆夫, Feb. 1999, 82, 2, 175, 180, Scientific journal
• Grid drawings of four-connected plane graphs, K Miura,S Nakano,T Nishizeki, 1999, GRAPH DRAWING, 1731, 145, 154, Scientific journal

  DOI
• A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs, Kazuyuki Miura,Daishiro Takahashi,Shin-Ichi Nakano,Takao Nishizeki, 1999, International Journal of Foundations of Computer Science, 10, 2, 195, 210, Scientific journal

  DOI
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs, Md. Saidur Rahman,Shin-ichi Nakano,Takao Nishizeki, 1999, Journal of Graph Algorithms and Applications, 3, 4, 31, 62, Scientific journal
• Box-rectangular Drawings of Plane Graphs, Md. Saidur Rahman,NAKANO SHIN-ICHI,Takao Nishizeki, 1999, Proc. of Graph-Theoretic Concepts in Computer Science, WG99, Lecture Notes in Compuer Science, 1665, 250, 261, International conference proceedings
• Minimum-width grid drawings of plane graphs, M Chrobak,S Nakano, Aug. 1998, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 11, 1, 29, 54, Scientific journal

  DOI
• Rectangular grid drawings of plane graphs, MS Rahman,S Nakano,T Nishizeki, Jun. 1998, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 10, 3, 203, 220, Scientific journal

  DOI
• A linear-time algorithm to find four independent spanning trees in four-connected planar graphs, K Miura,D Takahashi,S Nakano,T Nishizeki, 1998, GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1517, 310, 323, Scientific journal
• A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs, Md. Saidur Rahman,SHIN-ICHI NAKANO,Takao Nishizeki, 1998, Proc. of Graph Drawing 97,Lecture Notes in Computer Science, 1353, 99, 110, International conference proceedings

  DOI
• 単純多角形のサーチライトスケジューリング, 服部,中野 眞一, Dec. 1997, 7, 3, 265, 279, Scientific journal
• A linear-time algorithm for four-partitioning four-connected planar graphs, S Nakano,MS Rahman,T Nishizeki, Jun. 1997, INFORMATION PROCESSING LETTERS, 62, 6, 315, 322, Scientific journal

  DOI
• Edge-coloring partial k-trees, Zhou\, X,S Nakano,T Nishizeki, Nov. 1996, JOURNAL OF ALGORITHMS, 21, 3, 598, 617, Scientific journal

  DOI
• Rectangular Grid Drawings of Plane Graphs, Md. Saidur Rahman,SHIN-ICHI NAKANO,Takao Nishizeki, 1996, Proc. of COCOON96, Lecture Notes in Computer Science, 1090, 92, 105, International conference proceedings
• Edge-coloring algorithms, S Nakano,Zhou\, X,T Nishizeki, 1995, COMPUTER SCIENCE TODAY, 1000, 172, 183, Scientific journal
• Minimum-width grid drawings of plane graphs, M. Chrobak,S. NAKANO, 1995, Proc. of the Graph Drawing '94, Lecture Notes in Computer Science, 894, 104, 110, International conference proceedings
• グラフの均等辺彩色アルゴリズム, 中野 眞一,鈴木?康弘,西関隆夫, 1995, J78DI, 5, 437, 444, Scientific journal
• グラフをC-三角化するアルゴリズム, 中野 眞一,小熊 / 西関, Mar. 1994, J77A, 3, 543, 546, Scientific journal
• Edge-coloring problems for graphs, S. Nakano,T. Nishizeki, 1994, Interdisciplinary Information Sciences, 1, 1, 19, 32

  DOI
• A parallel algorithm for edge-coloring partial K-trees, X.Zhou,S.Nakano,T.Nishizeki, 1994, Proc. of the Fourth Scandinavian Workshop on Algorithm Theory, Lect. Notes in Comp. Sci., 824, 824, 359, 369, International conference proceedings
• グラフの辺をf彩色する近似アルゴリズム, 中野 眞一,西関 / 斎藤, Dec. 1993, 3, 4, 279, 307, Scientific journal
• Scheduling file transfers under port and channel constraints, NAKANO SHIN-ICHI,T.Nishizeki, 1993, International J. of Foundations of Computer Science, 4, 2, 101, 115, Scientific journal

  DOI
• A linear algorithm for edge-coloring partial k-tree, X.Zhou,S.Nakano,T.Nishizeki, 1993, Proc. of the First Europian Symposium on Algorithms, Lect. Notes in Comp. Sci., 726, 726, 409, 418, International conference proceedings
• AN EFFICIENT ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS, ZHOU\, X,S NAKANO,H SUZUKI,T NISHIZEKI, 1992, LATIN 92, 583, 516, 529, International conference proceedings
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS, S NAKANO,T NISHIZEKI, 1991, LECTURE NOTES IN COMPUTER SCIENCE, 557, 43, 51, Scientific journal
• グラフをfg辺彩色する近似アルゴリズム, 中野 眞一, 1991, 1, 3, 195, 211, Scientific journal
• ON THE FG-COLORING OF GRAPHS, S NAKANO,T NISHIZEKI,N SAITO, 1990, COMBINATORICA, 10, 1, 67, 80, Scientific journal
• ON THE F-COLORING OF MULTIGRAPHS, SI NAKANO,T NISHIZEKI,N SAITO, Mar. 1988, IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 35, 3, 345, 353, Scientific journal

  DOI
• グラフのfg辺彩色数の上界, 中野 眞一,西関 / 斉藤, Oct. 1987, J70-A, 10, 1463, 1471, Scientific journal
• グラフのf彩色, 中野 眞一,西関 / 斉藤, Feb. 1987, J70-A,, 2, 164, 174, Scientific journal

MISC

• How to obtain the complete list of caterpillars, KIKUCHI Yosuke,TANAKA Hiroyuki,NAKANO Shin-ichi,SHIBATA Yukio, 23 May 2003, IPSJ SIG Notes, 2003, 53, 33, 40
• Enumerating All Graphical Sequences, 菊地洋右,山中克久,中野眞一, 15 Oct. 2009, 情報処理学会研究報告(CD-ROM), 2009, 3, ROMBUNNO.AL-126,2
• Constant Time Generation of Integer Partitions, YAMANAKA Katsuhisa,KAWANO Shin-ichiro,KIKUCHI Yosuke,NAKANO Shin-ichi, 20 Jan. 2006, IPSJ SIG Notes, 2006, 7, 27, 34
• On the generation of set cover, KIKUCHI Yosuke,NAKANO Shin-ichi, 27 Sep. 2006, IPSJ SIG Notes, 2006, 100, 41, 48
• Enumerating All Graphical Sequences, KIKUCHI YOSUKE,YAMANAKA KATSUHISA,NAKANO SHIN-ICHI, 08 Sep. 2009, 研究報告アルゴリズム（AL）, 2009, 2, 1, 6
• A Simple Generation of Multi-dimensional Partitions, KIKUCHI Yosuke,YAMANAKA Katsuhisa,NAKANO Shin-ichi, 26 Nov. 2008, IEICE technical report. Theoretical foundations of Computing, 108, 330, 23, 29
• A Simple Generation of Multi-dimensional Partitions, KIKUCHI Yosuke,YAMANAKA Katsuhisa,NAKANO Shin-ichi, 26 Nov. 2008, IPSJ SIG Notes, 2008, 121, 23, 29
• AN EFFICIENT ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS, ZHOU\, X,S NAKANO,H SUZUKI,T NISHIZEKI, 1992, LECTURE NOTES IN COMPUTER SCIENCE, 583, 516, 529
• Generating biconnected plane quadrangulations, ZJ Li,SI Nakano, Apr. 2003, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E86D, 4, 698, 703
• An Efficient Algorithm for Mining Frequent Unordered Trees from Semi-structured Data, ASAI Tatsuya,ARIMURA Hiroki,UNO Takeaki,NAKANO Shinichi, 01 Oct. 2003, IEICE technical report. Data engineering, 103, 355, 33, 38
• An Efficient Algorithm for Discovering Frequent Patterns from Large Unordered Trees (Evolutionary Advancement in Fundamental Theories of Computer Science), Asai Tatsuya,Fusanobu Shinji,Arimura Hiroki,Uno Takeaki,Nakano Shin-ichi, May 2004, RIMS Kokyuroku, 1375, 113, 119
• Listing All Connected Plane Triangulations, Zhangjian Li,SHINICHI NAKANO, 2001, Proc. of Canadian Conference on Computational Geometry, pp.121-124, 121, 124, Summary international conference
• Scheduling file transfers in networks, T.Nishizeki,S.Nakano,N.Saito, 1987, Proc.GLOBECOM'87, pp.2109-2113, Summary international conference
• Listing All Plane Graphs, Zhangjian Li,NAKANO SHIN-ICHI, 2001, 99, 106
• Efficient Enumeration of All Ladder Lotteries, Katsuhisa Yamanaka,Shin-Ichi Nakano,Yasuko Matsui,Ryuhei Uehara,Kento Nakada, 2008

Books etc

• Algorithmic Foundations for Social Advancement, Joint work, Yasuko Matsui and Shin-Ichi Nakano, Cost Graph Colorings, Springer, Mar. 2025, 345--352, Scholarly book, ISBN: 978-981-96-0668-9
• WALCOM: Algorithms and Computation 13th International Conference, WALCOM 2019 Guwahati, India, February 27 - March 2, 2019 Proceedings, Editor, Gautam K. Das,Partha S. Mandal,Krishnendu Mukhopadhyaya,Shin-ichi Nakano, Springer, Feb. 2019
• WALCOM 2012: Algorithms and Computation, Lecture Notes in Computer Science, Editor, Shin-ichi Nakano,Md. Saidur Rahman, Springer, Feb. 2012, ISBN: 3642280757
• Algorithms and Computation, ISAAC 2011, Lecture Notes in Computer Science, Vol. 7074, Editor, Takao Asano,Shin-ichi Nakano,Yoshio Okamoto,Osamu Watanabe, Dec. 2011
• Proc. of 5th Annual International Conference, COCOON'99,, Joint editor, Asano,Imai\, Lee,Nakano\, Tokuyama, Springer, 1999, ISBN: 3540662006
• 離散構造とアルゴリズム7, Joint work, 2000, ISBN: 4764902818
• 離散構造とアルゴリズム1, Joint work, 1992, ISBN: 4764901943
• アルゴリズム工学-計算困難問題への挑戦-, Contributor, 2001, ISBN: 4320120124
• 離散数学のすすめ, Contributor, 2010
• WALCOM: Algorithms and Computation, Editor, Shin-ichi Nakano,Md. Saidur Rahman, Springer, Feb. 2008, ISBN: 9783540778905

Presentations

• Transportation Problem on a Tree Using Two-way Trips, Tetsuo Asano and Shin-ichi Nakano, JCDCG^3 2024, Sep. 2024, English, Japan, International conference
• Enumerate All Routes on a Doughnut, Yasuko Matsui and Shin-ichi Nakano, The Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games, 23 Sep. 2023, Bali, Indonesia, International conference
• Enumerate All Routes on a Doughnut, Yasuko Matsui and Shin-ichi Nakano, The 10th International Congress on Industrial and Applied Mathematics, 22 Aug. 2023, English, Tokyo, Japan, International conference
• Locate Hunters Far Away, Tetsuya Araki and Shin-Ichi Nakano, The 23rd Japan Korea Joint Workshop on Algorithms and Computation, 25 Jun. 2023, English, Nagoya, Japan, International conference
• Enumerate All Routes on a Doughnut, Yasuko Matsui and Shin-ichi Nakano, 54th Southeastern International Conference on Combinatorics, Graph Theory & Computing, 06 Mar. 2023, English, United States, International conference
• Find Routes on a Doughnut, 松井 泰子，中野眞一, 第 34 回位相幾何学的グラフ理論研究集会, 11 Nov. 2022, English, Japan
• Find Routes on a Doughnut, Yasuko Matsui and Shin-ichi Nakano, JCDCGGG2022, 09 Sep. 2022, English, online
• Dispersion on Intervals, Tetsuya Araki, Hiroyuki Miyata and Shin-ichi Nakano, CCCG2021, Aug. 2021, Aug. 2021, Canada, Canada, International conference
• Max-Min 3-dispersion on a Convex Polygon, Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka, Euro CG, Apr. 2021, Russian Federation, International conference
• Dispersion on Intervals, Tetsuya Araki, Hiroyuki Miyata and Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, May 2021, English
• Max-Min 3-dispersion on a Convex Polygon, Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka, 情報処理学会アルゴリズム研究会, May 2021, English
• Greedy描画可能な木の完全な組合せ的特徴づけ, 野坂怜哉, 宮田洋行, 中野眞一, 情報処理学会アルゴリズム研究会, Mar. 2021, Japanese
• Sorting by Five Prefix Reversals, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Katsuhisa Yamanaka, 情報処理学会アルゴリズム研究会, Sep. 2020, English, Domestic conference
• Dispersion Problems, Shin-ichi Nakano, 2nd international conference on innovation in engineering and technology, ICIET, 2019, Dec. 2019, Dhaka,, Bangladesh, International conference
• Simple Fold and Cut Problem for Line Segments, Guoin Hu,Shin-ichi Nakano,Ryuhei Uehara,Takeaki Uno, 電子情報通信学会コンピュテーション研究会, 25 Oct. 2019, English, Domestic conference
• Floorplans with Columns, Katsuhisa Yamanaka,Md. Saidur Rahman,Nakano SHINICHI, 電子情報通信学会コンピュテーション研究会, 12 Dec. 2018, English, Domestic conference
• Max-Min Dispersion on a line, Tetsuya Araki,Shin-ichi Nakano, 電子情報通信学会コンピュテーション研究会, 18 Sep. 2018, English, Domestic conference
• An Approximation Algorithm for the 2-Dispersion Problem, Kazuyuki Amano,Shin-ichi Nakano, 電子情報通信学会コンピュテーション研究会, 26 Oct. 2018, English, Domestic conference
• Max-Min 3-dispersion Problems, Takashi Horiyama,○Shin-ichi Nakano,Toshiki Saitoh,Koki Suetsugu,Akira Suzuki,Ryuhei Uehara,Takeaki Uno,Kunihiro Wasa, 電子情報通信学会コンピュテーション研究会, 12 Dec. 2018, English, Domestic conference
• On the f-coloring of graphs, S.Nakano,T.Nishizeki,N.Saito, The First Japan Conference on Graph Theory and Applications, Jun. 1986, Jun. 1986, English, International conference
• Nearly uniform scheduling of file transfers, S.NAKANO,T.Nishizeki, Proc. of the Third Conference on Integer Programming and Combinatoria Optimization, 1993, English, International conference
• グラフ描画システムの設計とJavaによる実装, 金子雄一,中野眞一, 第61回情報処理学会全国大会, Oct. 2000, Japanese, Domestic conference
• 5連結内部極大平面グラフの5分割を求める線形時間アルゴリズム, 長井さやか,金子雄一,中野眞一, 第61回情報処理学会全国大会, Oct. 2000, Japanese, Domestic conference
• 2連結3次平面グラフの最適な直交描画を求める線形アルゴリズム, 吉川万紀子,中野眞一, 第61回情報処理学会全国大会, Oct. 2000, Japanese, Domestic conference
• 建築デザインへのグラフ理論の応用 -すべてのフロアプランのリストを作ろう-, 中野眞一, 第14回RAMPシンポジウム, 24 Sep. 2002, Japanese, Domestic conference
• A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs, S. Nagai,S. Nakano, The 13th Workshop on Circuits and Systems in Karuizawa, Apr. 2000, English, Domestic conference
• Efficient Generation of Plane Triangulations with a Degree Constraint, Hiroyuki Tanaka,Zhangjian Li,Shin-ichi Nakano, The 15th Workshop on Circuits and Systems in Karuizawa, 22 Apr. 2002, English, Domestic conference
• 矩形描画の列挙, 高木正博,中野眞一, 第15回回路とシステム軽井沢ワークショップ論文集, 22 Apr. 2002, Japanese, Domestic conference
• L字形描画の列挙, 高木正博,中野眞一, 第16回回路とシステム軽井沢ワークショップ, 27 Apr. 2003, Japanese, Domestic conference
• A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs, S.Nagai,S.NAKANO, IEICE COMP, 16 Nov. 1999, English, Domestic conference
• 4連結平面グラフの格子凸描画, 三浦,中野 眞一, 情報処理学会アルゴリズム研究会, 21 Sep. 2000, Japanese, Domestic conference
• Algorithms for Shape-Flexible Labeling of Points, S. NAKANO,T.Nishizeki,T.Tokuyama,S.Watanabe, SIGAL, IPSJ, 19 May 2000, English, Domestic conference
• Efficient Generation of Plane Triangulations without Repetitions, Zhangjian Li,NAKANO SHIN-ICHI, 電子情報通信学会コンピュテーション研究会, 2001
• Improved Algorithm for Enumerating Plane Triangulations, NAKANO SHIN-ICHI,T. Uno, 電子情報通信学会コンピュテーション研究会, 24 Jun. 2002, English, Domestic conference
• A Simple Algorithm for Generating Unordered Rooted Trees, Shin-ichi Nakano,Takeaki Uno, 情報処理学会アルゴリズム研究会, 23 May 2003, English, Domestic conference
• フロアプラン列挙アルゴリズムの実装, 吉井,中野 眞一, 電子情報通信学会コンピュテーション研究会, 18 Jun. 2003, Japanese, Domestic conference
• A Simple Constant Time Enumeration Algorithm for Free Trees, Shin-ichi Nakano,Takeaki Uno, 情報処理学会アルゴリズム研究会, 19 Sep. 2003, English, Domestic conference
• 半構造データからの効率のよい無順序木パターン発見手法, 浅井,有村,宇野,中野 眞一, 電子情報通信学会データ工学研究会, 08 Oct. 2003, Japanese, Domestic conference
• Efficiently Mining Frequent Substructures from Large Unordered Trees, Asai,Arimura / Uno,NAKANO SHIN-ICHI, 電子情報通信学会人工知能と知識処理研究会, 31 Jul. 2003, English, Domestic conference
• 高速な無順序木パターン発見アルゴリズム, 浅井達哉,房延慎二,有村博紀,宇野毅明,中野 眞一, 人工知能基礎論研究会, 01 Mar. 2004, Japanese, Domestic conference
• 大規模木構造データからの頻出部分構造パターン発見アルゴリズム, 房延,浅井,有村,宇野,中野 眞一, 電子情報通信学会コンピュテーション研究会, 19 Jan. 2004, Japanese, Domestic conference
• Generating All Series-parallel Graphs, KAWANO SHINICHIRO,NAKANO SHIN-ICHI, 情報処理学会アルゴリズム研究会, 19 Mar. 2004, English, Domestic conference
• An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem, Xuzhen XIE,Ono,NAKANO SHIN-ICHI,Hirata, 情報処理学会アルゴリズム研究会, 07 Nov. 2003, English, Domestic conference
• リアライザの列挙, 山中克久,中野眞一, 夏のLAシンポジウム2004, 14 Jul. 2004, Japanese, Domestic conference
• On the Enumeration of Colored Trees, NAKANO SHIN-ICHI,Uno, 情報処理学会アルゴリズム研究会, 21 May 2004, English, Domestic conference
• Constant Time Generation of Set Partitions, Shin-ichiro Kawano,Shin-ichi Nakano, 第17回回路とシステム軽井沢ワークショップ, 27 Apr. 2004, English, Domestic conference
• Coding Floorplans with Fewer Bits, YAMANAKA KATSUHISA,NAKANO SHIN-ICHI, Proc. of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Application, 20 Jan. 2005, English, Domestic conference
• Compact Encoding of Plane Triangulations with Efficient Query Support, 山中 克久,中野 眞一, IPSJ SIGAL, 19 May 2005, English, Domestic conference
• Constant Time Generation of Linear Extensions, Ono,NAKANO SHIN-ICHI, 電子情報通信学会コンピュテーション研究会, 20 May 2005, English, Domestic conference
• A Compact Encoding of Rectangular Drawings with Efficient Query Supports, 山中克久,中野眞一, 電子情報通信学会2006年総合大会 シンポジウム講演(B)DS-1-8 COMP-NHC 学生シンポジウム, 26 Mar. 2006, English, Domestic conference
• Constant Time Generation of Integer Partitions, YAMANAKA KATSUHISA,KAWANO SHINICHIRO,Kikuchi,NAKANO SHIN-ICHI, SIGAL, IPSJ, 20 Jan. 2006, English, Domestic conference
• 集合の被覆の列挙アルゴリズム, 菊地洋右,中野 眞一, 情報処理学会アルゴリズム研究会, 27 Sep. 2006, Japanese, Domestic conference
• 窓なし部屋の個数が高々kの方形描画の 高速列挙アルゴリズム, 千明大介,中野 眞一, 情報処理学会アルゴリズム研究会, 18 May 2006, Japanese, Domestic conference
• 半構造データマイニングのための高速な無順序木パターン発見方法, 房延慎二,浅井達哉,有村博紀,宇野毅明,中野眞一, 第15回データ工学ワークショップ(DEWS2004), Jun. 2004, Japanese, Domestic conference
• 頻出無順序木パターン発見を用いた木やグラフからのデータマイニング, 房延慎二,浅井達哉,有村博紀,宇野毅明,中野眞一, 人工知能学会全国大会, Jun. 2004, Japanese, Domestic conference
• 大規模木構造データからの頻出無順序木パターン発見アルゴリズム, 浅井達哉,房延慎二,有村博紀,宇野毅明,中野眞一, 冬のLAシンポジウム2004, 03 Feb. 2004, Japanese, Domestic conference
• Listing All Plane Graphs, Katsuhisa Yamanaka,Zhangjian Li,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, 21 Sep. 2007, English, Domestic conference
• Efficient Enumeration of Ordered Trees with k Leaves, Y. Otachi,K. Yamanaka,S. Nakano, IPSJ SIGAL, 12 Sep. 2008, English, Domestic conference
• A Simple Generation of Multi-dimensional Partitions, 菊地洋右,山中克久,中野眞一, 情報処理学会アルゴリズム研究会, 03 Dec. 2008, Japanese, Domestic conference
• グラフ的列の列挙, 菊地洋右,山中克久,中野眞一, 情報処理学会アルゴリズム研究会, 15 Sep. 2009, English, Domestic conference
• k本の横線をもつあみだくじの列挙, 山中克久,中野眞一, 情報処理学会アルゴリズム研究会, 15 Sep. 2009, English, Domestic conference
• A Simple Generation of d-dimensional Partitions, Yosuke Kikuchi,Katsuhisa Yamanaka,Shin-Ichi Nakano, Proc. of WAAC 2009, 2009 Korea-Japan Joint Workshop on Algorithms and Computation, 04 Jul. 2009, English, International conference
• Efficient Enumeration of All Ladder Lotteries, 山中克久,中野眞一,松井泰子,上原隆平,仲田研登, 電子情報通信学会コンピュテーション研究会, 11 May 2009, English, Domestic conference
• Listing All st-orientations, Andry Setiawan,Shin-Ichi Nakano, 電子情報通信学会コンピュテーション研究会, 26 May 2009, English, Domestic conference
• A Compact Encoding of Rectangular Drawings with Edge Lengths, 中野眞一,山中克久, 情報処理学会アルゴリズム研究会, 06 Sep. 2011, English, Domestic conference
• On the number of reduced trees, cographs, and series-parallel graphs by compression, Takeaki Uno,Ryuhei Uehara,Shin-Ichi Nakano, 情報処理学会アルゴリズム研究会, 19 Nov. 2011, English, Domestic conference
• Enumerating All Rooted Trees including k Leaves, M.Ishikawa,K.Yamanaka,Y.Otachi,S.Nakano, LAシンポジウム, 20 Jul. 2010, English, Domestic conference
• The Gram Distribution for Rooted Ordered Trees, Nobuhito Ohkura,Kouichi Hirata,Tetsuji Kuboyama,Masateru Harao,Shin-ichi Nakano, Proc. of Fourth Workshop on Learning with Logics and Logics for Learning, 04 Jun. 2006, English, International conference
• Generating All Floorplans, Shin-ichi Nakano, 2004 SIAM Conference on Discrete Mathematics, 13 Jun. 2004, English, International conference
• Compact Encodings of Graphs, Shin-ichi Nakano, 2007 Korea-Japan Joint Workshhop on Algorithms and Computation,WAAC 2007, 09 Aug. 2007, English, International conference
• 順列の列挙, 関根航人,山中克久,中野眞一, LAシンポジウム, 18 Jul. 2007, Japanese, Domestic conference
• A canonical Coding for Fullerene Graphs, 下間直樹,中野眞一, LAシンポジウム,学生セッション, 12 Jul. 2008, Japanese, Domestic conference
• 2連結平面グラフのst-numberingの列挙, 金子昌弘,中野眞一, LAシンポジウム,学生セッション, 12 Jul. 2008, Japanese, Domestic conference
• Listing All Trees with Specified Degree Sequence, Shin-ichi Nakano, Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems, 29 Sep. 2008, English, International conference
• Efficient Enumeration of All Pseudoline Arrangements, Katsuhisa Yamanaka,Shin-Ichi Nakano,Yasuko Matsui,Ryuhei Uehara,Kento Nakada, Proc. of EuroCG 2009, Mar. 2009, English, International conference
• Efficient Enumeration of All Ladder Lotteries with k Bars, Katsuhisa Yamanaka,Shin-Ichi Nakano, Proc. of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009, 12 Nov. 2009, English, International conference
• Enumerating All Graphical Sequences, Yosuke Kikuchi,Katsuhisa Yamanaka,Shin-Ichi Nakano, Proc. of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009, 12 Nov. 2009, English, International conference
• 順序なし2分木の効率的な符号, 岩田梢江,中野眞一,石渡史朗, 情報処理学会第73回全国大会, 02 Mar. 2011, Japanese, Domestic conference
• 2連結平面グラフのst-orientationの列挙, etiawan Andry,中野眞一, 情報処理学会第73回全国大会, 02 Mar. 2011, English, Domestic conference
• 格子方形描画のコンパクトな符号, 須田亮平,中野眞一,山中克久, 情報処理学会第73回全国大会, 02 Mar. 2011, Japanese, Domestic conference
• Two Compact Codesfor Rectangular Drawings with Degree Four Vertices, Masashi Saito,Shin-ichi Nakano, FIT 2012, 04 Sep. 2012, English, Domestic conference
• 大規模グラフのspannerを生成するストリーミングアルゴリズムの実装, 石島 正大,中野 眞一, 第11回情報科学技術フォーラム,, 04 Sep. 2012, Japanese, Domestic conference
• Approximation for the Geometric Unique Coverage Problem on Unit Squares, Takehiro Ito,Shin-ichi Nakano,Yoshio Okamoto,Yota Otachi,Ryuhei Uehara,Takeaki Uno,Yushi Uno, 電子情報通信学会コンピュテーション研究会, 21 Jun. 2012, English, Domestic conference
• Two Compact codes for L-floorplans, Md. Rezaul Karim,Shin-ichi Nakano,Md,Saidur Rahman, 情報処理学会アルゴリズム研究会, 14 May 2012, English, Domestic conference
• On (k, r)-gatherings on a Road, 赤木 俊裕,中野眞一, FIT2013, 04 Sep. 2013, English, Domestic conference
• Another Optimal Binary Representation of Mosaic Floorplans, Katsuhisa Yamanaka,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, May 2013, English, Domestic conference
• Enumeration, Counting, and Random Generation of Ladder Lotteries, Katsuhisa Yamanaka,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, Nov. 2014, English, Domestic conference
• Computational Complexity of Sequential Token Swapping Problem, Katsuhisa Yamanaka,Erik D. Demaine,Takashi Horiyama,Akitoshi Kawamura,Shin-ichi Nakano,Yoshio Okamoto,Toshiki Saitoh,Akira Suzuki,Ryuhei Uehara,Takeaki Uno, 電子情報通信学会コンピュテーション研究会, 25 Jun. 2016, English, Domestic conference
• Dispersion on the Line, Toshihiro Akagi,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, 24 Jun. 2016, English, Domestic conference
• The LR-dispersion problem, Toshihiro Akagi,Tetsuya Araki,Shin-ichi Nakano, 冬のLAシンポジウム2017, 02 Feb. 2017, English, Domestic conference
• Faster min-max r-gatherings, Toshihiro Akagi,Ryota Arai,Shin-Ichi Nakano, The 8th Annual Meeting of Asian Association for Algorithms and Computation, May 2015, English, International conference
• Uniformly Random Generation of Floorplans (Extended Abstract), Katsuhisa Yamanaka,Shin-Ichi Nakano, the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Jun. 2015, English, International conference
• 各施設にr人以上集まるような施設配置問題（r-gathering問題）とデータ俯瞰, 中野眞一, 日本オペレーションズ・リサーチ学会関西支部主催研究講演会, 27 Jun. 2015, Japanese, Domestic conference
• Assigning proximity facilities for gatherings, Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, 13 Jan. 2015, English, Domestic conference
• Efficient Algorithms for the Partial Sum Dispersion Problem, Toshihiro Akagi,Tetsuya Araki,Hiroshi Ishikawa,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, 16 Nov. 2017, English, Domestic conference
• Variants of the dispersion problem, Toshihiro Akagi,Tetsuya Araki,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, 17 Jan. 2017, English, Domestic conference
• On (k,r(f))-gatherings on a Road, Toshihiro Akagi,Shin-Ichi Nakano, JCDCGG 2013, 18 Sep. 2013, English, International conference
• The partial sum dispersion problem on the line, Toshihiro Akagi,Tetsuya Araki,Hiroshi Ishikawa,Shin-ichi Nakano, Proc. of JCDCG^3, 01 Sep. 2017, English, International conference
• On r-gatherings, 赤木 俊裕,中野眞一, 電子情報通信学会総合大会, 10 Mar. 2015, Japanese, Domestic conference
• On r-gatherings on the Line, 情報処理学会第77回全国大会, 18 Mar. 2015, Japanese, Domestic conference
• 弱l-多様性問題を解く3近似アルゴリズム, 小池優,赤木俊裕,宮田洋行,中野眞一, 第15回情報科学技術フォーラム, FIT 2016, 07 Sep. 2016, Japanese, Domestic conference
• l-diversity clustering on the line, Toshihiro Akagi,Shin-ichi Nakano, 第15回情報科学技術フォーラム, FIT 2016, 07 Sep. 2016, English, Domestic conference
• 直線上のmin-sum r-cellular Clustering, 小川航平,赤木俊裕,宮田洋行,中野 眞一, 情報処理学会第79回全国大会, 17 Mar. 2017, Japanese, Domestic conference
• グラフのn多角形上描画可能性判定アルゴリズムについて, 平澤 紹,宮田洋行,中野眞一, 第17回情報科学技術フォーラム, 20 Sep. 2018, Japanese, Domestic conference
• k-外平面的グラフのangular resolution, 小島大輝,中野眞一,宮田洋行, 情報処理学会第80回全国大会, 15 Mar. 2018, Japanese, Domestic conference
• k-anonymity with h-outlier, BATBAYAR DULAMDARI,中野眞一,宮田洋行, 情報処理学会第80回全国大会, 15 Mar. 2018, English, Domestic conference
• Uniformly Random Generation of Floorplans, Katsuhisa Yamanaka,Shin-ichi Nakano, 情報処理学会アルゴリズム研究会, 2013
• 平面グラフを描こう, 2001年電子情報通信学会総合大会, 2001
• (k,r)-gatherings, Enumeration Algorithm Seminar, 2013
• Listing All Trees with Specified Degree Sequence, 2009

Awards

• Mar. 2025, Others, Japan
• FIT2012 Best Paper Award, M. Saito,S. Nakano, Two Compact Codes for Rectangular Drawings with Degree Four Vertices, 2012
• 2007
• 2008
• 1994
• 1991
• 1994
• 2004
• 2005
• 2012

Research Projects

• 科研費データベース参照 https://nrid.nii.ac.jp/ja/nrid/1000030227855/, 科研費, 1990, Competitive research funding
• Graph Algorithms, 1985, Competitive research funding

Academic Contribution

• WALCOM 2025, Academic society etc, 28 Feb. 2025, 02 Mar. 2025, Kanazawa, International academic contribution
• Academic society etc, 22 Mar. 2024, 24 Mar. 2024
• WALCOM 2024, Academic society etc, 18 Mar. 2024, 20 Mar. 2024, Kanazawa, International academic contribution
• Academic society etc, 30 Aug. 2023, 01 Sep. 2023
• WALCOM 2023, Academic society etc, 22 Mar. 2023, 24 Mar. 2023, International academic contribution
• WALCOM 2022, Academic society etc, 24 Mar. 2022, 26 Mar. 2022, International academic contribution
• WALCOM 2021, Academic society etc, 28 Feb. 2021, 02 Mar. 2021, International academic contribution
• WALCOM 2020, Academic society etc, 31 Mar. 2020, 02 Apr. 2020, International academic contribution
• Academic society etc, 30 Jan. 2020, 01 Feb. 2020
• Academic society etc, 23 Apr. 2019, 25 Apr. 2019
• Academic society etc, 12 Dec. 2019
• 25 Oct. 2019
• 02 Sep. 2019
• Academic society etc, 10 May 2019
• WALCOM 2019, Academic society etc, 28 Feb. 2019, 02 Mar. 2019, Guwahati, India, International academic contribution

Social Contribution

Social Contribution

• 国際会議WALCOM Steering Committee常任委員, Sep. 2009
• 国際会議WALCOM2024　PCメンバー, Apr. 2023, Mar. 2024
• 国際会議WALCOM2023　PCメンバー, 27 Jun. 2022, Mar. 2023
• 国際会議WALCOM2022　PCメンバー, Feb. 2021, Mar. 2022
• 国際会議WALCOM2021　PCメンバー, 2020, Mar. 2021
• 国際会議WALCOM2020　PCメンバー, Jul. 2019, Apr. 2020
• 国際会議WALCOM2019　PC Chair, Mar. 2017, Mar. 2019

Academic Contribution

• International conf. WALCOM2025 PC Chair, Academic society etc, PC Chair, 28 Feb. 2025, 02 Mar. 2025, Chengdu, China, International academic contribution
• International Conference WALCOM Steering Committee member, Academic society etc