Nakano SHINICHI

J-GLOBAL         Last updated: Oct 4, 2019 at 14:36
 
Avatar
Name
Nakano SHINICHI
URL
http://www.cs.gunma-u.ac.jp/~nakano/
Affiliation
Gunma University
Job title
Professor
Degree
(BLANK)(Tohoku University)
ORCID ID
0000-0003-2368-6183

Research Interests

 
 

Research Areas

 
 

Academic & Professional Experience

 
1990
 - 
1996
Tohoku University, Research Assistant
 
1996
 - 
1999
Tohoku University, Associate Professor
 
1999
 - 
2004
Gunma University, Associate Professor
 
2004
   
 
- Gunma University, Professor
 

Education

 
 
 - 
1987
Graduate School, Division of Engineering, Tohoku University
 
 
 - 
1985
Faculty of Engineering, Tohoku University
 

Awards & Honors

 
2012
Two Compact Codes for Rectangular Drawings with Degree Four Vertices, FIT2012 Best Paper Award
Winner: M. Saito and S. Nakano
 

Published Papers

 
Enumerating Highly-Edge-Connected Spanning Subgraphs
Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano
IEICE TRANS. FUNDAMENTAL   E102A(9) 1002-1006   Sep 2019   [Refereed]
Away from Rivals
Kazuyuki Amano and Shin-Ichi Nakano
Proc. of CCCG 2018      Aug 2018   [Refereed]
One-dimensional r-Gathering under Uncertainty
Shareef Ahmed, Shin-Ichi Nakano and Md. Saidur Rahman
Proc. of AAIM 2019, LNCS   11640 1-15   Aug 2019   [Refereed]
Simple Fold and Cut Problem for Line Segments
Guoxin Hu, Shinichi Nakano, Ryuhei Uehara and Takeaki Uno
Proc. of CCCG 2019   158-163   Aug 2019   [Refereed]
Max-Min 3-dispersion Problems
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa
Proc. of COCOON 2019, LNCS   11653 291-300   Jul 2019   [Refereed]
r-Gatherings on a Star
Shareef Ahmed, Shin-Ichi Nakano and Md. Saidur Rahman
Proc. of WALCOM 2019, LNCS   11355 31-42   Feb 2019   [Refereed]
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, and Takeaki Uno,
JGAA   23(1) 3-27   Jan 2019   [Refereed]
The Max-Min Dispersion on a Line
Tetsuya Araki and Shin-ichi Nakano
Proc. of COCOA 2018, LNCS 11346   11346 672-678   Dec 2018   [Refereed]
Enumerating Floorplans with Columns
Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-Ichi Nakano
IEICE TRANS. FUNDAMENTALS,   E101-A(9) 1392-1397   Sep 2018   [Refereed]
More Routes for Evacuation
Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano
Proc. of COCOON 2018, LNCS 10976   10976 76-83   Jul 2018   [Refereed]
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
Proc. of FAW 2018, LNCS 10823   10823 263-272   May 2018   [Refereed]
A Simple Algorithm for r-gatherings on the Line
Shin-ichi Nakano
Proc. of WALCOM 2018, LNCS10755   LNCS 10755, 1-7   Mar 2018   [Refereed]
Floorplans with Columns
Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-Ichi Nakano
Proc. of COCOA, LNCS 10627   10627 33-40   Dec 2017   [Refereed]
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 and Takeaki Uno
Proc. of WALCOM2017, LNCS 10167,   10167 435-447   Mar 2017   [Refereed]
Toshihiro Akagi and Shin-Ichi Nakano
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST.,   E100D(3) 428-433   Mar 2017   [Refereed]
Katsuhisa Yamanaka and Shin-Ichi Nakano
IEICE TRANS. INF.& SYST.,   E100-D(no.3) 444-451   Mar 2017   [Refereed]
Shin-ichi Nakano
Proc. of COCOON2016, LNCS 9797,   9797 247-253   Aug 2016   [Refereed]
Toshihiro Akagi, Ryota Arai and Shin-Ichi Nakano
電子情報通信学会英文論文誌, IEICE TRANS. Fundamentals   E99-A(6) 1149-1151   Jun 2016   [Refereed]
Katsuhisa Yamanaka and Shin-Ichi Nakano
電子情報通信学会英文論文誌, IEICE TRANS. INF.& SYST   E99D(3) 624-629   Mar 2016   [Refereed]
Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Computational GeometryTheory and Applications   51 25-29   2016   [Refereed]
Toshihiro Akagi and Shin-ichi Nakano
Proc. of FAW 2015, LNCS 9130,   9130 25-32   Jul 2015   [Refereed]
Katsuhisa Yamanaka and Shin-Ichi Nakano
Proc. of FAW 2015, LNCS 9130,   9130 294-303   Jul 2015   [Refereed]
Katsuhisa Yamanaka and Shin-Ichi Nakano
IEICE TRANS. FUNDAMENTALS,   Vol.E98-A,(6) 1223-1224   Jun 2015   [Refereed]
Kazuyuki Amano, Shin'ichi Nakano and Koichi Yamazaki
Journal of Information Processing   23(3) 252-257   2015   [Refereed]
Katsuhisa Yamanaka and Shin-Ichi Nakano
IEICE TRANS. FUNDAMENTALS   E97A(6) 1163-1170   Jun 2014   [Refereed]
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
Theoretical Computer Science,   544 14-31   2014   [Refereed]
Shin-Ichi Nakano and Katsuhisa Yamanaka
IEICE TRANS. FUNDAMENTALS, Special Section, Discrete Mathematics and Its Applications,   E96A(6) 1032-1035   Jun 2013   [Refereed]
Bounding the Number of Reduced Trees Cographs aned Series Parallel Graphs by Compression
T. Uno, R. Uehara and S. Nakano
Discrete Mathematics Algorithms and Applications   5(2) 1360001 (14page)   2013   [Refereed]
Masashi Saito and Shin-ichi Nakano
Journal of Information Processing   21(4) 660-664   2013   [Refereed]
Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno
Networks   62(2) 95-104   2013   [Refereed]
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 and Yushi Uno
Proc. of ISAAC 2012, the 23rd International Symposium on Algorithms and Computation, LNCS 7676,   7676 372-381   Dec 2012   [Refereed]
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
Proc. of SWAT 2012, LNCS 7357,   7357 24-35   Jul 2012   [Refereed]
M. Ishikawa, K. Yamanaka, Y. Otachi and S. Nakano
IEICE TRANS. INF.& SYST   E95-D(3) 763-768   Mar 2012   [Refereed]
Takeaki Uno, Ryuhei Uehara and Shin-Ichi Nakano
Proc. of WALCOM 2012, LNCS 7157   7157 5-16   Feb 2012   [Refereed]
Katsuhisa Yamanaka, Yota Otachi and Shin-Ichi Nakano
Theoretical Computer Science,   442 22-27   2012   [Refereed]
Andry Setiawan and Shin-ichi Nakano
IEICE TRANS. FUNDAMENTALS   E94A(10) 1965-1970   Oct 2011   [Refereed]
Kozue Iwata, Shiro Ishiwata and Shin-ichi Nakano
Proc. of TAMC2011,8th Annual Conference on Theory and Applications of Models of Computation, LNCS 6648   6648 106-113   May 2011   [Refereed]
Mohammad Tanvir Parvez, Md. Saidur Rahman and Shin-Ichi Nakano
Journal of Graph Algorithms and Applications   15(3) 457-476   2011   [Refereed]
Katsuhisa Yamanaka /Shin-Ichi Nakano
Information Processing Letters   110 803-809   2010   [Refereed]
Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada,
Theoretical Computer Science   411 1714-1722   2010   [Refereed]
Naoki Shimotsuma/Shin-ichi Nakano,
IEICE TRANS. FUNDAMENTALS   E92-A(No.12) 3398-3400   Dec 2009   [Refereed]
Mohammad Tanvir Parvez, Md. Saidur Rahman and Shin-Ichi Nakano
Proc. of WALCOM 2009, LNCS 5431   5431 151-164   Feb 2009   [Refereed]
Katsuhisa Yamanaka, Yota Otachi and Shin-Ichi Nakano
Proc. of WALCOM 2009, LNCS 5431   5431 141-150   Feb 2009   [Refereed]
Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno
Journal of Computer Science and Technology   24(3) 517-533   2009   [Refereed]
Listing All Plane Graphs
Katsuhisa Yamanaka and Shin-Ichi Nakano
JGAA Journal of Graph Algorithms and Applications   13(1) 5-18   2009   [Refereed]
Katsuhisa Yamanaka / Shin-ichi Nakano
IEICE TRANS. FUNDAMENTALS   Vol.E91-A(9) 2284-2291   Sep 2008   [Refereed]
Katsuhisa Yamanaka /Shin-Ichi Nakano
Proc. of WALCOM 2008, Lecture Notes in Computer Science   4921 120-131   Feb 2008   [Refereed]
Katsuhisa Yamanaka / Shin-Ichi Nakano
Proc. of WALCOM 2008, Lecture Notes in Computer Science   4921 210-221   Feb 2008   [Refereed]
Katsuhisa Yamanaka / Shin-ichiro Kawano /Yosuke Kikuchi / Shin-ichi Nakano
IEICE TRANS. FUNDAMENTALS   E90-A(5) 888-895   May 2007   [Refereed]
Efficient Algorithms for Airline Problem
Shin-ichi Nakano / Ryuhei Uehara / Takeaki Uno
Proc. of TAMC 2007, Lecture Notes in Computer Science   4484 428-439   May 2007   [Refereed]
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
Katsuhisa Yamanaka / Shin-Ichi Nakano
Proc. of AAIM2007, Lecture Notes in Computer Sciences   4508 68-81   2007   [Refereed]
A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs
Shin-ichi Nakano / Ryuhei Uehara / Takeaki Uno
Proc. of TAMC 2007, Lecture Notes in Computer Science   4484 115-127   2007   [Refereed]
Satoshi YOSHII / Daisuke CHIGIRA / Katsuhisa YAMANAKA / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E89-A(9) 2445-2450   Sep 2006   [Refereed]
KAZUYUKI MIURA / SHIN-ICHI NAKANO/ TAKAO NISHIZEKI
International Journal of Foundations of Computer Science   17(5) 1031-1060   May 2006   [Refereed]
Katsuhisa YAMANAKA / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E89-A(5) 1181-1185   May 2006   [Refereed]
Shin-ichiro KAWANO / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E88-A(4) 930-934   Apr 2005   [Refereed]
Shin-ichi Nakano / Takeaki Uno
proc. of WG 2005, Lecture Notes in Computer Science   3787 249-260   2005   [Refereed]
Shin-ichiro KAWANO / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E88-A(5) 1129-1135   May 2005   [Refereed]
Efficient Generation of Plane Triangulations with Specified Maximum Degree
Hiroyuki TANAKA / Shin-ichi NAKANO
IEICE TRANSACTIONS on Information and Systems   E87-D(2) 330-336   Feb 2004   [Refereed]
Shin-ichi Nakano
Computational Geometry Theory and Applications   27(2) 109-122   2004   [Refereed]
Shin-ichi Nakano / Takeaki Uno
Proc. of WG 2004, Lecture Notes in Computer Science   3353 33-45   2004   [Refereed]
An Improved Algorithm for the Nearly Equitable Edge-coloring Problem
Xuzhen XIE / Takao ONO / Shin-ichi NAKANO / Tomio HIRATA
IEICE TRANS. FUNDAMENTALS   E87-A(5) 1029-1033   2004   [Refereed]
Efficient Generation of Plane Triangulations with a Degree Constraint
Hiroyuki TANAKA / Zhangjian LI / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E86-A(4) 829-834   Apr 2003   [Refereed]
More Efficient Generation of Plane Triangulations
Shin-ichi Nakano / Takeaki Uno
Proc. of Graph Drawing 2003, Lecture Notes in Computer Science   2912 273-282   2003   [Refereed]
Discovering Frequent Substructures in Large Unordered Trees
Tatsuya Asai / Hiroki Arimura / Takeaki Uno / NAKANO SHIN-ICHI
Proc. of The 6th International Conference on Discovery Science (DS'03), Lecture Notes in AI,   2843 47-61   2003   [Refereed]
How to obtain the complete list of caterpillars
Yosuke Kikuchi / Hiroyuki Tanaka / Shin-ichi Nakano / Yukio Shibata
Proc.of COCOON 2003, Lecture Notes in Computer Science   2697 329-338   2003   [Refereed]
Listing All Connected Plane Triangulations
Zhang-Jian LI / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E86-A(7) 1807-1812   Jul 2003   [Refereed]
Md. Saidur Rahman / Shin-Ichi Nakano / Takao Nishizeki:
Computational Geometry Theory and Applications   21(3) 121-138   2002   [Refereed]
Enumerating Floorplans with n Rooms
NAKANO SHIN-ICHI
IEICE TRANS. FUNDAMENTALS   E85-A(7) 1746-1750   Jul 2002   [Refereed]
ATSUSHI KOIKE / SHIN-ICHI NAKANO / TAKAO NISHIZEKI / TAKESHI TOKUYAMA / SHUHEI WATANABE
International Journal of Computational Geometry \& Applications   12(6) 511-528   2002   [Refereed]
Shin-ichi Nakano
Information Processing Letters   84(3) 167-172   2002   [Refereed]
Grid Drawings of Four-connected Plane Graphs
Kazuyuki Miura / Shin-ichi Nakano / Takao Nishizeki
Discrete & Computational Geometry   26 73-87   2001   [Refereed]
Efficient Generation of Triconnected Plane Triangulation
Shin-ichi Nakano
Proc. of COCOON 2001, Lecture Notes in Computer Science   2108 131-141   2001   [Refereed]
NAKANO SHIN-ICHI
Proc. of ISAAC 2001, Lecture Notes in Computer Science   2223 107-115   2001   [Refereed]
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Sayaka NAGAI and Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E84-A(5) 1102-1109   May 2001   [Refereed]
A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs
Sayaka NAGAI / Shin-ichi NAKANO
IEICE TRANS. FUNDAMENTALS   E84-A(9) 2330-2337   Sep 2001   [Refereed]
Planar Drawings of Plane Graphs
NAKANO SHIN-ICHI
IEICE TRANS. INF. & SYST.   E83D(3) 384-391   Mar 2000   [Refereed]
K.Miura / S.NAKANO / T.Nishizeki
Proc.of GraphDrawing 99, Lecture Notes in Computer Science   1731 145-154   2000   [Refereed]
Rahman MS, Nakano S, Nishizeki T
JOURNAL OF ALGORITHMS   37(2) 363-398   2000   [Refereed]
S. NAKANO / M. Yoshikawa
Proc. of Graph Drawing 2000, Lecture Notes in Computer Science   1984 296-307   2000   [Refereed]
NAKANO SHIN-ICHI / Takao Nishizeki / Takeshi Tokuyama / Shuhei Watanabe
Proc. of Graph Drawing 2000, Lecture Notes in Computer Science   1984 91-102   2000   [Refereed]
Convex Grid Drawings of Four-Connected Plane Graphs
K.Miura / S.NAKANO/ T.Nishizeki
Proc.of eleventh Annual International Symposium on Algorithms and Computation, ISAAC 2000, Lecture Notes in Computer Scienc   1969 254-265   2000   [Refereed]
Rectangular Drawings of Plane Graphs without Designated Corners
S.Rahman / NAKANO SHIN-ICHI / Takao?Nishizeki
Proc.of 6th Annual International Conference, COCOON 2000, Lecture Notes in Computer Science   1858 85-94   2000   [Refereed]
Sayaka Nagai / NAKANO SHIN-ICHI
Proc. of Graph-Theoretic Concepts in Computer?Science,?WG00, Lecture Notes in Computer Science   1928 290-301   2000   [Refereed]
Box-rectangular Drawings of Plane Graphs
Md. Saidur Rahman / NAKANO SHIN-ICHI / Takao Nishizeki
Proc. of Graph-Theoretic Concepts in Computer Science, WG99, Lecture Notes in Compuer Science   1665 250-261   1999   [Refereed]
Miura K, Nakano S, Nishizeki T
Proc. of Graph Drawing 1999, Lecture Notes in Computer Science   1731 145-154   1999   [Refereed]
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
Journal of Graph Algorithms and Applications   3(4) 31-62   1999   [Refereed]
Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
International Journal of Foundations of Computer Science   10(2) 195-210   1999   [Refereed]
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
K. Miura / D. Takahashi / S. NAKANO / T. Nishizeki
Proc. of WG'98, Lecture Notes in Computer Science   1517 310-323   1998   [Refereed]
Md. Saidur Rahman / SHIN-ICHI NAKANO / Takao Nishizeki
Proc. of Graph Drawing 97,Lecture Notes in Computer Science   1353 99-110   1998   [Refereed]
Rahman MS / Nakano S / Nishizeki T
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS   10(3) 203-220   1998   [Refereed]
Chrobak M, Nakano S
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS   11(1) 29-54   1998   [Refereed]
Shin-ichi Nakano, Md. Saidur Rahman and Takao Nishizeki
Information Processing Letters   62(6) 315-322   1997   [Refereed]
Rectangular Grid Drawings of Plane Graphs
Md. Saidur Rahman / SHIN-ICHI NAKANO/ Takao Nishizeki
Proc. of COCOON96, Lecture Notes in Computer Science   1090 92-105   1996   [Refereed]
Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
Journal of Algorithms   21(3) 598-617   1996   [Refereed]
Edge-coloring algorithms
Nakano S, Zhou X, Nishizeki T
COMPUTER SCIENCE TODAY, Lecture Notes in Computer Science   1000 172-183   1995   [Invited]
Minimum-width grid drawings of plane graphs
M. Chrobak / S. NAKANO
Proc. of the Graph Drawing '94, Lecture Notes in Computer Science   894 104-110   1995   [Refereed]
A parallel algorithm for edge-coloring partial K-trees
X.Zhou, S.Nakano and T.Nishizeki
Proc. of the Fourth Scandinavian Workshop on Algorithm Theory, Lect. Notes in Comp. Sci., 824   824 359-369   1994   [Refereed]
A linear algorithm for edge-coloring partial k-tree
X.Zhou, S.Nakano and T.Nishizeki
Proc. of the First Europian Symposium on Algorithms, Lect. Notes in Comp. Sci., 726   726 409-418   1993   [Refereed]
NAKANO SHIN-ICHI / T.Nishizeki
International J. of Foundations of Computer Science   4(2) 101-115   1993   [Refereed]

Misc

 
Efficient Enumeration of All Ladder Lotteries
Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada
Proc. of The 20th Workshop on Topological Graph Theory in Yokohama      2008
Generating Biconnected Plane Quadrangulations
Zhang-Jian LI / Shin-ichi NAKANO
IEICE TRANSACTIONS on Information and Systems   E86-D(4) 698-703   2003
Enumerating Floorplans with some properties
SHIN-ICHI NAKANO
Interdisciplinary Information Sciences   8(2) 199-206   2002   [Refereed]
Listing All Connected Plane Triangulations
Zhangjian Li / SHINICHI NAKANO
Proc. of Canadian Conference on Computational Geometry   pp.121-124 121-124   2001   [Refereed]
Listing All Plane Graphs
Zhangjian Li / NAKANO SHIN-ICHI
Proc. of KOREA-JAPAN joint workshop on Algorithms and Computation 2001, WAAC2001   99-106   2001
S. Nakano and T. Nishizeki
Interdisciplinary Information Sciences   1(1) 19-32   1994   [Refereed]
Scheduling file transfers in networks
T.Nishizeki, S.Nakano and N.Saito
Proc.GLOBECOM'87   pp.2109-2113    1987   [Refereed]

Books etc

 
WALCOM: Algorithms and Computation 13th International Conference, WALCOM 2019 Guwahati, India, February 27 - March 2, 2019 Proceedings
Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, and Shin-ichi Nakano (Part:Editor)
Springer   Feb 2019   
WALCOM: Algorithms and Computation, Lecture Notes in Computer Science
Shin-ichi Nakano, Md. Saidur Rahman (Part:Editor)
Springer   Feb 2012   ISBN:3642280757
Algorithms and Computation, ISAAC 2011, Lecture Notes in Computer Science, Vol. 7074
Takao Asano, Shin-ichi Nakano, Yoshio Okamoto and Osamu Watanabe (Part:Editor)
Dec 2011   
Algorithms and Computation 22nd International Symposium, ISAAC 2011 Yokohama, Japan, December 5-8, 2011, Proceedings Lecture Notes in Computer Science, ARCoSS, Vol. 7074 (2011)
springer   2011   
WALCOM: Algorithms and Computation
Shin-ichi Nakano, Md. Saidur Rahman (Part:Editor)
Springer   Feb 2008   ISBN:978-3-540-77890-5
Proc. of 5th Annual International Conference, COCOON'99,
Asano, Imai, Lee, Nakano, Tokuyama (Part:Joint Editor)
Springer   1999   ISBN:3540662006

Conference Activities & Talks

 
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   
An Approximation Algorithm for the 2-Dispersion Problem
Kazuyuki Amano and ○Shin-ichi Nakano
情報処理学会アルゴリズム研究会   26 Oct 2018   
Max-Min Dispersion on a line
Tetsuya Araki and Shin-ichi Nakano
18 Sep 2018   
k-anonymity with h-outlier
BATBAYAR DULAMDARI, 中野眞一, 宮田洋行
情報処理学会第80回全国大会   15 Mar 2018   
Efficient Algorithms for the Partial Sum Dispersion Problem
Toshihiro Akagi, Tetsuya Araki, Hiroshi Ishikawa and Shin-ichi Nakano
情報処理学会アルゴリズム研究会   16 Nov 2017   
The partial sum dispersion problem on the line
Toshihiro Akagi, Tetsuya Araki, Hiroshi Ishikawa and Shin-ichi Nakano
Proc. of JCDCG^3   1 Sep 2017   
The LR-dispersion problem
Toshihiro Akagi, Tetsuya Araki, Shin-ichi Nakano
冬のLAシンポジウム2017   2 Feb 2017   
Variants of the dispersion problem
Toshihiro Akagi, Tetsuya Araki, Shin-ichi Nakano
情報処理学会アルゴリズム研究会   17 Jan 2017   
l-diversity clustering on the line
Toshihiro Akagi and Shin-ichi Nakano
第15回情報科学技術フォーラム, FIT 2016   7 Sep 2016   
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   
Dispersion on the Line
Toshihiro Akagi, Shin-ichi Nakano
情報処理学会アルゴリズム研究会   24 Jun 2016   
Uniformly Random Generation of Floorplans (Extended Abstract)
Katsuhisa Yamanaka and Shin-Ichi Nakano
the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications   Jun 2015   
Faster min-max r-gatherings
Toshihiro Akagi, Ryota Arai and Shin-Ichi Nakano
The 8th Annual Meeting of Asian Association for Algorithms and Computation   May 2015   
Assigning proximity facilities for gatherings
Shin-ichi Nakano
情報処理学会アルゴリズム研究会   13 Jan 2015   
Enumeration, Counting, and Random Generation of Ladder Lotteries
Katsuhisa Yamanaka ,Shin-ichi Nakano
情報処理学会アルゴリズム研究会   Nov 2014   
On (k,r(f))-gatherings on a Road
Toshihiro Akagi and Shin-Ichi Nakano
JCDCGG 2013   18 Sep 2013   
On (k, r)-gatherings on a Road
赤木 俊裕・中野眞一
FIT2013   4 Sep 2013   
Another Optimal Binary Representation of Mosaic Floorplans
Katsuhisa Yamanaka ,Shin-ichi Nakano
情報処理学会アルゴリズム研究会   May 2013   
Uniformly Random Generation of Floorplans
Katsuhisa Yamanaka ,Shin-ichi Nakano
情報処理学会アルゴリズム研究会   2013   
(k,r)-gatherings
Enumeration Algorithm Seminar   2013   
Two Compact Codesfor Rectangular Drawings with Degree Four Vertices
Masashi Saito and Shin-ichi Nakano
FIT 2012   4 Sep 2012   
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   
Two Compact codes for L-floorplans
Md. Rezaul Karim,Shin-ichi Nakano,Md. Saidur Rahman
情報処理学会アルゴリズム研究会   14 May 2012   
On the number of reduced trees, cographs, and series-parallel graphs by compression
Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
情報処理学会アルゴリズム研究会   19 Nov 2011   
A Compact Encoding of Rectangular Drawings with Edge Lengths
中野眞一, 山中克久
情報処理学会アルゴリズム研究会   6 Sep 2011   
Enumerating All Rooted Trees including k Leaves
M.Ishikawa, K.Yamanaka, Y.Otachi and S.Nakano
LAシンポジウム   20 Jul 2010   
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   
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   
グラフ的列の列挙
菊地洋右, 山中克久, 中野眞一
情報処理学会アルゴリズム研究会   15 Sep 2009   
k本の横線をもつあみだくじの列挙
山中克久, 中野眞一
情報処理学会アルゴリズム研究会   15 Sep 2009   
Efficient Enumeration of All Ladder Lotteries
山中克久, 中野眞一, 松井泰子, 上原隆平, 仲田研登
電子情報通信学会コンピュテーション研究会   11 May 2009   
Efficient Enumeration of All Pseudoline Arrangements
Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada
Proc. of EuroCG 2009   Mar 2009   
Listing All st-orientations
Andry Setiawan and Shin-Ichi Nakano
電子情報通信学会コンピュテーション研究会   26 May 2009   
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   4 Jul 2009   
Listing All Trees with Specified Degree Sequence
2009   
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   
Efficient Enumeration of Ordered Trees with k Leaves
Y. Otachi / K. Yamanaka / S. Nakano
IPSJ SIGAL   12 Sep 2008   
Compact Encodings of Graphs [Invited]
Shin-ichi Nakano
2007 Korea-Japan Joint Workshhop on Algorithms and Computation,WAAC 2007   9 Aug 2007   
Listing All Plane Graphs
Katsuhisa Yamanaka /Zhangjian Li/ Shin-ichi Nakano,
情報処理学会アルゴリズム研究会   21 Sep 2007   
The Gram Distribution for Rooted Ordered Trees
Nobuhito Ohkura, Kouichi Hirata, Tetsuji Kuboyama, Masateru Harao and Shin-ichi Nakano
Proc. of Fourth Workshop on Learning with Logics and Logics for Learning   4 Jun 2006   
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
山中克久, 中野眞一
電子情報通信学会2006年総合大会 シンポジウム講演(B)DS-1-8 COMP-NHC 学生シンポジウム   26 Mar 2006   
Constant Time Generation of Integer Partitions
YAMANAKA KATSUHISA / KAWANO SHINICHIRO / Kikuchi / NAKANO SHIN-ICHI
SIGAL, IPSJ   20 Jan 2006   
Constant Time Generation of Linear Extensions
Ono / NAKANO SHIN-ICHI
電子情報通信学会コンピュテーション研究会   20 May 2005   
Compact Encoding of Plane Triangulations with Efficient Query Support
山中 克久 / 中野 眞一
IPSJ SIGAL   19 May 2005   
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   
Generating All Floorplans [Invited]
Shin-ichi Nakano
2004 SIAM Conference on Discrete Mathematics   13 Jun 2004   
Constant Time Generation of Set Partitions
Shin-ichiro Kawano, Shin-ichi Nakano
第17回回路とシステム軽井沢ワークショップ   27 Apr 2004   
On the Enumeration of Colored Trees
NAKANO SHIN-ICHI / Uno
情報処理学会アルゴリズム研究会   21 May 2004   
Generating All Series-parallel Graphs
KAWANO SHINICHIRO / NAKANO SHIN-ICHI
情報処理学会アルゴリズム研究会   19 Mar 2004   
An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem
Xuzhen XIE / Ono / NAKANO SHIN-ICHI / Hirata
情報処理学会アルゴリズム研究会   7 Nov 2003   
Efficiently Mining Frequent Substructures from Large Unordered Trees
Asai / Arimura / Uno / NAKANO SHIN-ICHI
電子情報通信学会人工知能と知識処理研究会   31 Jul 2003   
A Simple Constant Time Enumeration Algorithm for Free Trees
Shin-ichi Nakano / Takeaki Uno
情報処理学会アルゴリズム研究会   19 Sep 2003   
A Simple Algorithm for Generating Unordered Rooted Trees
Shin-ichi Nakano / Takeaki Uno
情報処理学会アルゴリズム研究会   23 May 2003   
Improved Algorithm for Enumerating Plane Triangulations
NAKANO SHIN-ICHI / T. Uno
電子情報通信学会コンピュテーション研究会   24 Jun 2002   
Efficient Generation of Plane Triangulations with a Degree Constraint
Hiroyuki Tanaka, Zhangjian Li and Shin-ichi Nakano
The 15th Workshop on Circuits and Systems in Karuizawa   22 Apr 2002   
Efficient Generation of Plane Triangulations without Repetitions
Zhangjian Li / NAKANO SHIN-ICHI
電子情報通信学会コンピュテーション研究会   2001   
Algorithms for Shape-Flexible Labeling of Points
S. NAKANO / T.Nishizeki / T.Tokuyama / S.Watanabe
SIGAL, IPSJ   19 May 2000   
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
S. Nagai and S. Nakano
The 13th Workshop on Circuits and Systems in Karuizawa   Apr 2000   
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
S.Nagai / S.NAKANO
IEICE COMP   16 Nov 1999   
Nearly uniform scheduling of file transfers
S.NAKANO / T.Nishizeki
Proc. of the Third Conference on Integer Programming and Combinatoria Optimization   1993   
On the f-coloring of graphs
S.Nakano, T.Nishizeki and N.Saito
The First Japan Conference on Graph Theory and Applications   Jun 1986   

Association Memberships

 
 

Research Grants & Projects

 
Graph Algorithms
Project Year: 1985