01
S. Nakano, T.Nishizeki and N.Saito:
"On the f-coloring of graphs",
The First Japan Conference on Graph Theory and Applications, June 1, 1986.
T.Nishizeki, S.Nakano and N.Saito:
"Scheduling file transfers in networks",
Proc. GLOBECOM'87, pp.2109-2113 (1987).
S.Nakano and T.Nishizeki:
"Scheduling file transfers under port and channel constraints",
Proc. Int. Symp. on Algorithms, Lect. Notes in Comp. Sci., 557, Springer-Verlag pp.43-51 (1991).
X.Zhou, S.Nakano, H.Suzuki and T.Nishizeki:
"An efficient algorithm for edge-coloring series-parallel multigraphs",
Proc. LATIN'92, Lect. Notes in Comp. Sci., 583, Springer-Verlag, pp.516-529 (1992).
S. Nakano and T. Nishizeki:
"Nearly uniform scheduling of file transfers",
Proc. of the Third Conference on Integer Programming and Combinatorial Optimization, pp.425-431 (1993).
X. Zhou, S. Nakano and T. Nishizeki:
"A linear algorithm for edge-coloring partial k-trees",
Proc. of the First Europian Symposium on Algorithms, Lect. Notes in Comp. Sci., 726, Springer-Verlag, pp.409-418 (1993).
X. Zhou, S. Nakano and T. Nishizeki:
"A parallel algorithm for edge-coloring partial k-trees",
Proc. of the Fourth Scandinavian Workshop on Algorithm Theory, Lect. Notes in Comp. Sci., 824, Springer-Verlag, pp.359-369 (1994).
M. Chrobak and S. Nakano:
"Minimum-width grid drawings of plane graphs",
Proc. of the Graph Drawing '94, Lect. Notes in Comp. Sci., 894, Springer, pp.104-110 (1995).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki:
"Rectangular Grid Drawings of Plane Graphs",
Second Annual International Computing and Combinatorics Conference (COCOON'96), Hong Kong, Lect. Notes in Comp. Sci., 1090, Springer, pp.92-105 (1996).
Shin-ichi Nakano, Md. Saidur Rahman and Takao Nishizeki:
"A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs",
Graph Drawing 96, Berkeley, Lect. Notes in Comp. Sci., 1190, Springer, pp.334-344 (1997).
M. S. Rahman, S. Nakano and T. Nishizeki:
"A Linear-Time Algorithm of Orthogonal Drawings of Triconnected Cubic Plane Graphs with the Minimum Number of Bends",
Japan-Korea Workshop on Algorithms and Computation, Kyushu University, pp.24-31 (1997).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki:
"A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs",
Graph Drawing 97, Roma, Lect. Notes in Comp. Sci., 1353, Springer, pp.99-110 (1998).
K. Miura, D. Takahashi, S.Nakano, T. Nishizeki:
"A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs",
WG'98, Lect. Notes in Comp. Sci., 1517, Springer, pp.310-323 (1998).
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki:
"Box-Rectangular Drawings with Designated Four Corners",
Proc. of ICCIT98, pp.37-41 (1998).
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
"Box-rectangular Drawings of Plane Graphs"
Proc. of Graph-Theoretic Concepts in Computer Science, WG99, LNCS 1665, pp.250-261 (1999).
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
"Box-rectangular Drawings of Plane Graphs"
Proc. of Korea-Japan Joint Workshop on Algorithms and Computation, WAAC99, pp. 72-79 (1999).
(July 19-20, 1999, Seoul National University, Seoul, Korea)
K. Miura, S.Nakano, T. Nishizeki
"Grid Drawings of Four-connected Plane Graphs"
Proc. of GraphDrawing99, LNCS, 1731, pp.145-154 (2000).
Sayaka Nagai and Shin-ichi Nakano
"A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs"
Proc. of Graph-Theoretic Concepts in Computer Science, WG00,
LNCS, 1928, pp.290-301 (2000).
(2000.6.15-17, Konstanz, Germany).
(長井さん電気通信普及財団テレコムシステム技術学生賞受賞 2001.3.23)
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
"Rectangular Drawings of Plane Graphs without Designated Corners"
Proc. of Korea-Japan Joint Workshop on Algorithms and Computation, WAAC2000, pp. 130-137 (2000).
(2000.7.21-22, Tokyo, Japan.)
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
"Rectangular Drawings of Plane Graphs without Designated Corners"
Proc. of 6th Annual International Conference, COCOON 2000, LNCS, 1858, pp.85-94 (2000).
(2000.7.26-28, Sydney, Australia.)
K. Miura, S. Nakano, T. Nishizeki
"Convex Grid Drawings of Four-Connected Plane Graphs"
Proc. of eleventh Annual International Symposium on Algorithms and Computation, ISAAC 2000,
LNCS, 1969, pp.254-265 (2000).
(2000.12.18-20, Taipei, Taiwan.)
Shin-ichi Nakano, Takao Nishizeki, Takeshi Tokuyama and Shuhei Watanabe
"Labeling Points with Rectangles of Various Shapes"
Proc. of Graph Drawing 2000,
LNCS, 1984, pp.91-102 (2001). (2000.9.20-23, Williamsburg, Virginia, USA.)
Shin-ichi Nakano and Makiko Yoshikawa
"A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs"
Proc. of Graph Drawing 2000,
LNCS, 1984, pp.296-307 (2001).(2000.9.20-23, Williamsburg, Virginia, USA.)
Zhangjian Li and Shin-ichi Nakano
"Efficient Generation of Plane Triangulations without Repetitions"
Proc. of ICALP 2001, LNCS 2076, pp.433-443 (2001).(2001.7.8-12, Crete, Greece)
Shin-ichi Nakano
"Efficient Generation of Triconnected Plane Triangulations"
Proc. of COCOON 2001) LNCS 2108, pp.131-141 (2001). (2001.8.20-23 Guilin, China)
26
Zhangjian Li and Shin-ichi Nakano
"Listing All Plane Graphs"
Proc. of KOREA-JAPAN joint workshop on Algorithms and Computation 2001,
WAAC2001, pp.99-106 (2001).
(2001.06.28-29, Pusan, Korea)
27
Zhangjian Li and Shin-ichi Nakano
"Listing All Connected Plane Triangulations"
Proc. of Canadian Conference on Computational Geometry,
CCCG2001, pp.121-124 (2001).
(2001.08.13-15, Waterloo, Canada)
Shin-ichi Nakano
"Enumerating Floorplans with n Rooms"
Proc. of ISAAC 2001)
LNCS 2223, pp.107-115 (2001). (2001.12.18-21 Christchurch, New Zealand)
Yosuke Kikuchi, Hiroyuki Tanaka, Shin-ichi Nakano and Yukio Shibata,
"How to obtain the complete list of caterpillars"
COCOON 2003, LNCS 2697, pp.329-338 (2003). (2003.7.25-28, Big Sky, MT, USA)
Tatsuya Asai, Hiroki Arimura, Takeaki Uno, and Shin-ichi Nakano,
"Discovering Frequent Substructures in Large Unordered Trees"
The 6th International Conference on Discovery Science (DS'03)
LNAI 2843, 47-61 (2003). (Hokkaido University, Sapporo, Japan, October 17-19, 2003)
Shin-ichi Nakano and Takeaki Uno,
"More Efficient Generation of Plane Triangulations",
Graph Drawing 2003,
LNCS, 2912, pp.273-282 (2004).(2003.9.21-24, Perugia, Italy.)
32
(招待) Shin-ichi Nakano,
"Generating All Floorplans",
2004 SIAM Conference on Discrete Mathematics
(2004.6.13-16, Nashville, TN, USA)
Shin-ichi Nakano and Takeaki Uno,
"Constant Time Generation of Trees with Specified Diameter",
Proc. of WG 2004
LNCS, 3353, pp.33-45 (2004). (2004.6.21-23 Bad Honnef, Germany)
34
Katsuhisa Yamanaka and Shin-ichi Nakano,
"Coding Floorplans with Fewer Bits",
Proc. of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Application
pp. 401-406 (2005). (2005.6.3-6 Budapest, Hungary)
Shin-ichi Nakano and Takeaki Uno,
"Generating Colored Trees",
Proc. of WG 2005
LNCS, 3787, pp.249-260 (2005). (2005.6.23-25, Metz, France)
Akimitsu Ono and Shin-ichi Nakano,
"Constant Time Generation of Linear Extensions"
Proc. of FCT 2005, LNCS, 3623, pp.445-453 (2005). (2005.8.17-20, Lubeck, Germany)
37
Nobuhito Ohkura, Kouichi Hirata, Tetsuji Kuboyama, Masateru Harao and Shin-ichi Nakano
"The Gram Distribution for Rooted Ordered Trees"
Fourth Workshop on Learning with Logics and Logics for Learning (LLLL, L4)
(2006.6.5-6,Tower Hall Funabori, Edogawa, Tokyo JAPAN)
38
Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi and Shin-ichi Nakano
"Constant Time Generation of Integer Partitions"
Proc. of WAAC06, The 9th Japan-Korea Joint Workshop on Algorithms and Computation,
pp. 57-64 (2006) (2006.7.4-5, Hokkaido University, Sapporo, Japan)
39
(招待) Akimitsu Ono and Shin-ichi Nakano,
"Constant Time Generation of Linear Extensions"
Proc. of WALCOM 2007, pp.151-161 (2007) (2007.2.12, Dhaka, Bangladesh)
Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno,
"A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs",
Proc. of TAMC 2007, LNCS, 4484, pp.115-127 (2007). (2007.5.22-25, Shanghai, China)
Shin-ichi Nakano, Ryuhei Uehara and Takeaki Uno,
"Efficient Algorithms for Airline Problem",
Proc. of TAMC 2007, LNCS, 4484, pp.428-439 (2007). (2007.5.22-25, Shanghai, China)
Katsuhisa Yamanaka and Shin-ichi Nakano,
"A Compact Encoding of Rectangular Drawings with Efficient Query Support"
Proc. of AAIM 2007, LNCS, 4508, pp.68-81 (2007). (2007.6.6-8, Portland, USA)
43
(特別招待) Shin-ichi Nakano,
"Compact Encodings of Graphs"
Proc. of WAAC 2007, pp.1 (2007), (2007.8.9-10, Gwangju, Korea)
Katsuhisa Yamanaka and Shin-Ichi Nakano,
"Compact Encoding of Plane Triangulations with Efficient Query Support"
Proc. of WALCOM 2008, LNCS, 4921, pp.120-131 (2008). (2008.2.7-8, Dhaka, Bangladesh)
Katsuhisa Yamanaka and Shin-Ichi Nakano,
"Listing All Plane Graphs",
Proc. of WALCOM 2008, LNCS, 4921, pp.210-221 (2008). (2008.2.7-8, Dhaka, Bangladesh)
46
Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada
"Efficient Enumeration of All Ladder Lotteries"
The 20th Workshop on Topological Graph Theory in Yokohama,
第20回位相幾何学的グラフ理論研究集会,
(2008.11.24-28, 横浜)
47
Katsuhisa Yamanaka, Yota Otachi and Shin-Ichi Nakano,
"Efficient Generation of Ordered Trees with n Vertices including k leaves",
Proc. of WALCOM 2009, LNCS, 5431, pp.141-150 (2009). (2009.2.19-20, Kolkata, India)
48
Mohammad Tanvir Parvez, Md. Saidur Rahman and Shin-Ichi Nakano,
"Generating All Triangulations of Plane Graphs",
Proc. of WALCOM 2009, LNCS, 5431, pp.151-164 (2009). (2009.2.19-20, Kolkata, India)
49
Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada
"Efficient Enumeration of All Pseudoline Arrangements",
Proc. of EuroCG 2009, pp.143-146, (2009.3.16-18 Brussels, Belgium)
http://2009.eurocg.org/
http://www.research.att.com/~njas/sequences/A006245
50
Yosuke Kikuchi, Katsuhisa Yamanaka, Shin-Ichi Nakano,
"A Simple Generation of d-dimensional Partitions"
Proc. of WAAC 2009, 2009 Korea-Japan Joint Workshop on Algorithms and Computation
pp.60-67 (2009.7.4-5, Seoul, Korea)
51
Katsuhisa Yamanaka, Shin-Ichi Nakano,
"Efficient Enumeration of All Ladder Lotteries with k Bars"
Proc. of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009, pp.63-64,
(2009.11.11-13, Kanazawa)
52
Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-Ichi Nakano,
Enumerating All Graphical Sequences
Proc. of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009, pp.61-62,
(2009.11.11-13, Kanazawa)
Kozue Iwata, Shiro Ishiwata and Shin-ichi Nakano,
A Compact encoding of Unordered Binary Trees
Proc. of TAMC2011,
8th Annual Conference on Theory and Applications of Models of Computation,
(2011.5.23-25, Tokyo), LNCS 6648, pp.106--113.
Takeaki Uno, Ryuhei Uehara and Shin-Ichi Nakano
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
Proc. of WALCOM 2012, LNCS 7157, pp.5-16 (2012). (2012.2.15-17, Dhaka, Bangladesh)
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Proc. of SWAT 2012, LNCS 7357, pp.24-35 (2012). (2012.7.4-6, Helsinki, Finland)
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
Proc. of ISAAC 2012, the 23rd International Symposium on Algorithms and Computation
LNCS 7676, pp.372-381, (2012).
57
Toshihiro Akagi and Shin-Ichi Nakano
On (k,r(f))-gatherings on a Road
JCDCGG 2013,,
(2013.9.17-19 東京理科大)(発表9/18 11:20-11:40)
58
Yuto Saikawa and Shin-Ichi Nakano
A New Compact Encoding of Rectangular Drawings
JCDCGG 2013,,
(2013.9.17-19 東京理科大)(発表9/19 16:05-16:25)
59
Katsuhisa Yamanaka and Shin-Ichi Nakano
Uniformly Random Generation of Floorplans (Extended Abstract)
the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications.
http://tcslab.csce.kyushu-u.ac.jp/hj2015/
Nishijin Plaza, Fukuoka, June 2-5, 2015
Toshihiro Akagi and Shin-ichi Nakano
On r-gatherings on the Line
Proc.of FAW 2015, Guilin, Guangxi, China (July 3-5, 2015)
LNCS 9130, pp.25-32 (2015). http://faw2015.csu.edu.cn/index.htm
61
Katsuhisa Yamanaka and Shin-Ichi Nakano
Enumeration, Counting, and Random Generation of Ladder Lotteries
Proc.of FAW 2015, Guilin, Guangxi, China (July 3-5, 2015)
LNCS 9130, pp.294-303 (2015). Capter27
http://faw2015.csu.edu.cn/index.htm
62
Toshihiro Akagi, Ryota Arai and Shin-Ichi Nakano
Faster min-max r-gatherings
AAAC (Miyajima, Hiroshima, 2015.5.9-10)
http://www.iec.hiroshima-u.ac.jp/aaac2015/
63
Shin-Ichi Nakano
Assigning proximity facilities for gatherings
International Workshop on Inovative Algorithms for Big Data
(Kyoto, 2015.9.17-18)(発表は17日)
Yijie Han and Shin-Ichi Nakano
On r-Gatherings on the Line
The 12th International Conference on Foundations of Computer Science
Proc. of FCS'16, pp.99-104 (July 25-28, 2016, Las Vegas, USA)
ISBN:1-60132-434-0
Shin-Ichi Nakano
Assigning proximity facilities for gatherings
Proc.of COCOON 2016, LNCS 9797, pp.247-253, Ho Chi Minh City, Vietnam, (Aug 2-4, 2016)
66
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara and Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs
Proc. of WALCOM 2017, LNCS 10167, pp.435-447 (2017)
Hsinchu, Taiwan (2017.3.29-31)
67
(Invited)
Shin-ichi Nakano
Enumerating Floorplans
(MB-18),
IFORS 2017, Quebec City, Canada (2017.7.17-21)
68
Toshihiro Akagi, Tetsuya Araki, Hiroshi Ishikawa and Shin-ichi Nakano
The partial sum dispersion problem on the line
Proc. of JCDCG^3, (2017.8.29-9.1, Tokyo University of Science)(発表1日)
Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-Ichi Nakano
Floorplans with Columns
Proc. of COCOA, LNCS 10627, pp.33-40 (2017),
Shanghai, China, (2017.12.16-18)
Shin-ichi Nakano
A Simple Algorithm for r-gatherings on the Line
Proc. of WALCOM 2018, LNCS 10755, pp.1-7 (2018).
Dhaka, Bangladesh, (2018.3.3-5)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Exact Algorithms for the Max-Min Dispersion Problem
Proc. of FAW 2018, LNCS 10823, pp.263-272, 2018.
(Guangzhou, China, 2018.5.8-10)
Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano
More Routes for Evacuation
Proc. of COCOON 2018, LNCS 10976, pp.76-83, 2018.
Qingdao, China during July 2-4, 2018.
73
Katsuhisa Yamanaka, Yasuko Matsui and Shin-Ichi Nakano
Enumerating All Spanning Subgraphs with Edge-Connectivity At Least k
ISMP2018, Bordeaux, France (2018.7.1-6)
https://ismp2018.sciencesconf.org/
Stream COMB
Session:Connectivity problems and Steiner trees, Session 421
(2018.7.4 17:00-18:20 4件2番目.)
74
Kazuyuki Amano and Shin-Ichi Nakano
Away from Rivals
30th Canadian Conference on Computational Geometry, CCCG 2018,
UNIVERSITY OF MANITOBA
AUGUST 8-10, 2018
Tetsuya Araki and Shin-ichi Nakano
The Max-Min Dispersion on a Line
Proc. of COCOA 2018, LNCS 11346, pp.672-678 (2018)
Atlanta, Georgia, USA, (2018.12.15-17)
http://spacl.kennesaw.edu/cocoa2018
Shareef Ahmed, Shin-Ichi Nakano and Md. Saidur Rahman
r-Gatherings on a Star
Proc. of WALCOM 2019, LNCS11355, pp.31-42 (2019)
Guwahati, India (2019.2.27-3.02)
http://www.iitg.ac.in/walcom2019/
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa
Max-Min 3-dispersion Problems
Proc. of COCOON 2019, LNCS 11653, pp.291-300 (2019)
Xian, China, (2019.7.29-31)
78
Guoxin Hu, Shinichi Nakano, Ryuhei Uehara and Takeaki Uno
Simple Fold and Cut Problem for Line Segments
Proc. of CCCG 2019, pp.158-163,
The 31st Canadian Conference in Computational Geometry
University of Alberta, Edmonton, Alberta, Canada
August 8-10, 2019
Shareef Ahmed, Shin-Ichi Nakano and Md. Saidur Rahman
One-dimensional r-Gathering under Uncertainty
Proc. of AAIM 2019, LNCS 11640, pp.1-15 (2019)
Beijing, China, (2019.8.6-8)
80
(招待 Keynote) Shin-ichi Nakano
Dispersion Problems
2nd international conference on innovation in engineering and technology, ICIET, 2019
23-24 December 2019, Dhaka, Bangladesh
Katsuhisa Yamanaka and Shin-Ichi Nakano
Floorplans with Walls
TAMC2020, Changsha, China, 23-25 May 2020
Proc. of TAMC 2020, LNCS 12337, pp.50-59 (会議日程は2020.10.18-20に延期、オンライン開催に).
Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka
Max-Min 3-dispersion on a Convex Polygon
EuroCG 2021,(2021.4.9 16:10-)
Saint Petersburg, Russia, April 7-9, 2021 (オンライン開催に変更)
Tetsuya Araki, Hiroyuki Miyata and Shin-ichi Nakano
Dispersion on Intervals
Proc. of CCCG 2021, August 10-12, 2021. (オンライン開催に)
Dalhousie University, Halifax, Nova Scotia, Canada.
Shin-Ichi Nakano
The Coverage problem by Aligned Disks
Proc. of COCOON2021, LNCS 13025, pp.221-230 (オンライン開催に)
National Cheng Kung University, Tainan, Taiwan
October 24-26, 2021.
Yasuko Matsui and Shin-ichi Nakano
Find Routes on a Doughnut
JCDCGGG2022,
The 24th conference JCDCG3 2022
September 09-11, 2022, Online
Kento Kimura, Kazuyuki Amano and Shin-ichi Nakano
Escape from the Room
The 28th International Computing and Combinatorics Conference (COCOON 2022)
Shenzhen, China, October 22-24, 2022
Proc. of COCOON2022, LNCS 13595, pp.232-241
https://link.springer.com/chapter/10.1007/978-3-031-22105-7_21
会議は2022年10月 予稿集は2023年1月1日発行
Tetsuya Araki and Shin-Ichi Nakano
Away from Each Other
Proc. of WALCOM 2023, LNCS13973, pp.61-70 (2023)
Hsinchu, Taiwan, March 22-24, 2023
https://link.springer.com/book/9783031270512 Link
Yasuko Matsui and Shin-ichi Nakano
Enumerate All Routes on a Doughnut
54th Southeastern International Conference on Combinatorics, Graph Theory & Computing
March 6-10, 2023 発表 Monday, March 6
Florida Atlantic University in Boca Raton, FL USA
89
Yasuko Matsui and Shin-ichi Nakano
Enumerate All Routes on a Doughnut
ICIAM 2023 Tokyo
The 10th International Congress on Industrial and Applied Mathematics
August 20-25, 2023, 発表 2C (Aug.22, 13:20-15:00)
Waseda University, Tokyo, Japan.
https://iciam2023.org/registered_data?id=02271
https://iciam2023.org/registered_data?id=CT198#02271_Enumerate_All_Routes_on_a_Doughnut
Tetsuya Araki and Shin-Ichi Nakano
Locate Hunters Far Away
The 23rd Japan–Korea Joint Workshop on Algorithms and Computation
June 24–25, 2023 Nagoya University, Nagoya, Japan
Shin-ichi Nakano,
Variants of Euclidean k-center Clusterings
Proc. of COCOON 2023, LNCS 14422, pp.209-219 (2023)
Honolulu, Hawaii, USA, December 15-17, 2023
92
Yasuko Matsui and Shin-ichi Nakano
Enumerate All Routes on a Doughnut
The Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games
September 22-24, 2023
Courtyard by Marriott Bali Nusa Dua Resort, Bali, Indonesia.
Shin-ichi Nakano
(t, s)-completely Independent Spanning Trees
Proc. of WALCOM 2024 LNCS14549, pp.365–376 (2024)
Kanazawa, March 18-20 (2024)
Shin-ichi Nakano
A Gray Code of Ordered Trees
Proc. of TAMC2024, LNCS13637, pp.26-37 (2024)
Hong Kong, China, May 13-15 (2024)
Yosuke Kikuchi and Shin-ichi Nakano
Enumerating Floorplans with Any Set of Columns
Proc. of COCOON 2024, Proceedings, Part II, LNCS 15162, pp.313-323 (2025.3発行)
Shanghai, China, 23–25 August 2024
https://anl.sjtu.edu.cn/cocoon2024/
96 85の論文集
Yasuko Matsui and Shin-ichi Nakano
Find Routes on a Doughnut
Collection of Papers Selected from JCDCG^3 2022
LNCS 14364, pp.325-332 (2025)
12 Sep 2025発行？
97
Tetsuo Asano and Shin-ichi Nakano
Transportation Problem on a Tree Using Two-way Trips
Proc. of JCDCG^3 2024 (2024)
https://sites.google.com/view/jcdcg2024
September 10-12, 2024
Tokyo University of Science, Kagurazaka Campus
98
Keynote Speaker
Far Away from Each Other
Invitation to Dispersion Problems
Shin-ichi Nakano
3rd International Conference on Computing Advancements - ICCA 2024
https://icca.aiub.edu/index.php
American International University-Bangladesh (AIUB)
17-18th of October 2024, Dhaka, Bangladesh
Shin-Ichi Nakano
Max-Min Four-dispersion Problems
Proc. of TAMC 2025, LNCS 16084, pp: ?--? (2025)
Jinan,China,September 19-21,2025
http://www.maths.sdnu.edu.cn/TAMC2025.htm
https://link.springer.com/book/9789819548385
it is published on 23 Jan 2026
On the Constrained Maximization of Influence Over a Directed Tree Structure
Niccolò Di Marco, Andrea Frosini, Shinichi Nakano
Proc. of DGMM 2025, LNCS 16296, pp. 237-248 (2025)
4th International Conference on Discrete Geometry and Mathematical Morphology (DGMM 2025)
in Groningen, the Netherlands, 3-6 November 2025
https://www.cs.rug.nl/svcg/DGMM2025/
https://link.springer.com/chapter/10.1007/978-3-032-09544-2_17
Accepted 2025.07.16
101
Keynote Speaker
ICACM 2026
Sri Sivasubramaniya Nadar College of Engineering (SSN), Chennai, India
09-10, January 2026
https://sites.google.com/ssn.edu.in/icacm2026/
https://sites.google.com/ssn.edu.in/icacm2026/speakers
(2025.7.31)
Ma
March 18-20, 2024arch 18-20, 2024arch 18-20, 2024