Shin-Ichi Nakano

152 papers A* 1A 8B 28C 9Misc 13Journal 78Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Special issue on selected papers from the 19th International Workshop on Algorithms and Computation (WALCOM 2025). Inf. Comput. Shin-Ichi Nakano, Mingyu Xiao
2025	J	`jnl`	( IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shin-Ichi Nakano
2025	J	`jnl`	Enumerating Floorplans with Aligned Columns. IEICE Trans. Inf. Syst. Shin-Ichi Nakano
2025	J	`jnl`	Escape from the Room. IEICE Trans. Inf. Syst. Kento Kimura, Tomohiro Haramiishi, Kazuyuki Amano, Shin-Ichi Nakano
2025	J	`jnl`	Euclidean k-center Fair Clusterings. CoRR Ayano Moritaka, Shin-Ichi Nakano, Kento Tanaka, Noriaki Yoshida
2025	C	`conf`	Max-Min Four-Dispersion Problems. TAMC Shin-Ichi Nakano
2025	—	`conf`	On the Constrained Maximization of Influence Over a Directed Tree Structure. DGMM Niccolò Di Marco, Andrea Frosini, Shin-Ichi Nakano
2025	J	`jnl`	Transportation Problem on a Tree Using Two-way Trips. J. Inf. Process. Tetsuo Asano, Shin-Ichi Nakano
2025	B	`ed.`	WALCOM: Algorithms and Computation - 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025, Proceedings WALCOM Shin-Ichi Nakano, Mingyu Xiao
2024	B	`conf`	(t, s)-Completely Independent Spanning Trees. WALCOM Shin-Ichi Nakano
2024	C	`conf`	A Gray Code of Ordered Trees. TAMC Shin-Ichi Nakano
2024	J	`jnl`	Assigning Proximity Facilities for Gatherings. IEICE Trans. Inf. Syst. Shin-Ichi Nakano
2024	J	`jnl`	Dispersion in a Polygon. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tetsuya Araki, Shin-Ichi Nakano
2024	—	`conf`	Enumerating Floorplans with Any Set of Columns. COCOON (2) Yosuke Kikuchi, Shin-Ichi Nakano
2024	J	`jnl`	Enumerating floorplans with walls. Discret. Appl. Math. Katsuhisa Yamanaka, Shin-Ichi Nakano
2023	B	`conf`	Away from Each Other. WALCOM Tetsuya Araki, Shin-Ichi Nakano
2023	J	`jnl`	Family Trees for Enumeration. Int. J. Found. Comput. Sci. Shin-Ichi Nakano
2023	J	`jnl`	The Coverage Problem by Aligned Disks. Int. J. Comput. Geom. Appl. Shin-Ichi Nakano
2023	—	`conf`	Variants of Euclidean k-Center Clusterings. COCOON (1) Shin-Ichi Nakano
2022	J	`jnl`	A Gray Code of Ordered Trees. CoRR Shin-Ichi Nakano
2022	J	`jnl`	An IEICE Trans. Inf. Syst. Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
2022	J	`jnl`	Dispersion on Intervals. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tetsuya Araki, Hiroyuki Miyata, Shin-Ichi Nakano
2022	Misc	`conf`	Escape from the Room. COCOON Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano
2022	—	`conf`	Find Routes on a Doughnut. JCDCGGG Yasuko Matsui, Shin-Ichi Nakano
2022	J	`jnl`	Max-min dispersion on a line. J. Comb. Optim. Tetsuya Araki, Shin-Ichi Nakano
2022	J	`jnl`	r-Gatherings on a star and uncertain r-gatherings on a line. Discret. Math. Algorithms Appl. Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman
2021	—	`conf`	Dispersion on Intervals. CCCG Tetsuya Araki, Hiroyuki Miyata, Shin-Ichi Nakano
2021	J	`jnl`	Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2021	Misc	`conf`	The Coverage Problem by Aligned Disks. COCOON Shin-Ichi Nakano
2020	J	`jnl`	An Approximation Algorithm for the 2-Dispersion Problem. IEICE Trans. Inf. Syst. Kazuyuki Amano, Shin-Ichi Nakano
2020	J	`jnl`	Efficient Algorithms for the Partial Sum Dispersion Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Toshihiro Akagi, Tetsuya Araki, Shin-Ichi Nakano
2020	C	`conf`	Floorplans with Walls. TAMC Katsuhisa Yamanaka, Shin-Ichi Nakano
2020	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Krishnendu Mukhopadhyaya, Shin-Ichi Nakano
2019	J	`jnl`	A Simple Algorithm for r-gatherings on the Line. J. Graph Algorithms Appl. Shin-Ichi Nakano
2019	J	`jnl`	Enumerating Highly-Edge-Connected Spanning Subgraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano
2019	Misc	`conf`	Max-Min 3-Dispersion Problems. COCOON Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2019	C	`conf`	One-Dimensional r-Gathering Under Uncertainty. AAIM Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman
2019	J	`jnl`	Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019	—	`conf`	Simple Fold and Cut Problem for Line Segments. CCCG Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2019	B	`ed.`	WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings WALCOM Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano
2019	B	`conf`	r-Gatherings on a Star. WALCOM Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman
2018	B	`conf`	A Simple Algorithm for r-gatherings on the Line. WALCOM Shin-Ichi Nakano
2018	—	`conf`	Away from Rivals. CCCG Kazuyuki Amano, Shin-Ichi Nakano
2018	J	`jnl`	Enumerating Floorplans with Columns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano
2018	Misc	`conf`	Exact Algorithms for the Max-Min Dispersion Problem. FAW Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2018	C	`conf`	Max-Min Dispersion on a Line. COCOA Tetsuya Araki, Shin-Ichi Nakano
2018	Misc	`conf`	More Routes for Evacuation. COCOON Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano
2017	J	`jnl`	Enumeration, Counting, and Random Generation of Ladder Lotteries. IEICE Trans. Inf. Syst. Katsuhisa Yamanaka, Shin-Ichi Nakano
2017	—	`conf`	Floorplans with Columns. COCOA (1) Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano
2017	J	`jnl`	On IEICE Trans. Inf. Syst. Toshihiro Akagi, Shin-Ichi Nakano
2017	B	`conf`	Sequentially Swapping Colored Tokens on Graphs. WALCOM Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2016	J	`jnl`	A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2016	Misc	`conf`	Assigning Proximity Facilities for Gatherings. COCOON Shin-Ichi Nakano
2016	J	`jnl`	Faster Min-Max IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Toshihiro Akagi, Ryota Arai, Shin-Ichi Nakano
2016	—	`ch.`	Geometric Object Enumeration. Encyclopedia of Algorithms Shin-Ichi Nakano
2016	—	`ch.`	Tree Enumeration. Encyclopedia of Algorithms Shin-Ichi Nakano
2016	J	`jnl`	Uniformly Random Generation of Floorplans. IEICE Trans. Inf. Syst. Katsuhisa Yamanaka, Shin-Ichi Nakano
2015	J	`jnl`	Another Optimal Binary Representation of Mosaic Floorplans. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Shin-Ichi Nakano
2015	J	`jnl`	Anti-Slide. J. Inf. Process. Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki
2015	Misc	`conf`	Enumeration, Counting, and Random Generation of Ladder Lotteries. FAW Katsuhisa Yamanaka, Shin-Ichi Nakano
2015	Misc	`conf`	On r-Gatherings on the Line. FAW Toshihiro Akagi, Shin-Ichi Nakano
2014	J	`jnl`	A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014	J	`jnl`	Efficient Enumeration of All Ladder Lotteries with IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Shin-Ichi Nakano
2013	J	`jnl`	A Compact Encoding of Rectangular Drawings with Edge Lengths. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shin-Ichi Nakano, Katsuhisa Yamanaka
2013	J	`jnl`	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. Discret. Math. Algorithms Appl. Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
2013	J	`jnl`	Efficient algorithms for a simple network design problem. Networks Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2013	J	`jnl`	Guest Editor's Foreword. J. Graph Algorithms Appl. Shin-Ichi Nakano
2013	J	`jnl`	Guest Editorial: Selected Papers from ISAAC 2011. Algorithmica Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
2013	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
2013	J	`jnl`	Two Compact Codes for Rectangular Drawings with Degree Four Vertices. Inf. Media Technol. Masashi Saito, Shin-Ichi Nakano
2013	J	`jnl`	Two Compact Codes for Rectangular Drawings with Degree Four Vertices. J. Inf. Process. Masashi Saito, Shin-Ichi Nakano
2012	B	`conf`	A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	—	`conf`	A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	B	`conf`	Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano
2012	J	`jnl`	Efficient enumeration of ordered trees with k leaves. Theor. Comput. Sci. Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2012	J	`jnl`	Enumerating All Rooted Trees Including IEICE Trans. Inf. Syst. Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2012	B	`ed.`	WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings WALCOM Md. Saidur Rahman, Shin-Ichi Nakano
2011	C	`conf`	A Compact Encoding of Unordered Binary Trees. TAMC Kozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano
2011	B	`ed.`	Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings ISAAC Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe
2011	J	`jnl`	Generating All Triangulations of Plane Graphs. J. Graph Algorithms Appl. Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano
2011	J	`jnl`	Listing All IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Andry Setiawan, Shin-Ichi Nakano
2010	J	`jnl`	A compact encoding of plane triangulations with efficient query supports. Inf. Process. Lett. Katsuhisa Yamanaka, Shin-Ichi Nakano
2010	J	`jnl`	Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada
2009	J	`jnl`	A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2009	J	`jnl`	A Simple Canonical Code for Fullerene Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Naoki Shimotsuma, Shin-Ichi Nakano
2009	B	`conf`	Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2009	B	`conf`	Generating All Triangulations of Plane Graphs (Extended Abstract). WALCOM Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano
2009	J	`jnl`	Listing All Plane Graphs. J. Graph Algorithms Appl. Katsuhisa Yamanaka, Shin-Ichi Nakano
2008	B	`conf`	A Compact Encoding of Plane Triangulations with Efficient Query Supports. WALCOM Katsuhisa Yamanaka, Shin-Ichi Nakano
2008	J	`jnl`	A Compact Encoding of Rectangular Drawings with Efficient Query Supports. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Shin-Ichi Nakano
2008	B	`conf`	Listing All Plane Graphs. WALCOM Katsuhisa Yamanaka, Shin-Ichi Nakano
2008	B	`ed.`	WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008. WALCOM Shin-Ichi Nakano, Md. Saidur Rahman
2007	C	`conf`	A Compact Encoding of Rectangular Drawings with Efficient Query Supports. AAIM Katsuhisa Yamanaka, Shin-Ichi Nakano
2007	C	`conf`	A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2007	J	`jnl`	Constant Time Generation of Integer Partitions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, Shin-Ichi Nakano
2007	B	`conf`	Constant Time Generation of Linear Extensions. WALCOM Akimitsu Ono, Shin-Ichi Nakano
2007	C	`conf`	Efficient Algorithms for Airline Problem. TAMC Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
2007	J	`jnl`	Special Section on Foundations of Computer Science. IEICE Trans. Inf. Syst. Shin-Ichi Nakano
2006	J	`jnl`	Coding Floorplans with Fewer Bits. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Katsuhisa Yamanaka, Shin-Ichi Nakano
2006	J	`jnl`	Constant Time Generation of Rectangular Drawings with Exactly IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, Shin-Ichi Nakano
2006	J	`jnl`	Convex Grid Drawings of Four-connected Plane Graphs. Int. J. Found. Comput. Sci. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
2005	B	`conf`	Constant Time Generation of Linear Extensions. FCT Akimitsu Ono, Shin-Ichi Nakano
2005	J	`jnl`	Constant Time Generation of Set Partitions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shin-ichiro Kawano, Shin-Ichi Nakano
2005	J	`jnl`	Generating All Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shin-ichiro Kawano, Shin-Ichi Nakano
2005	B	`conf`	Generating Colored Trees. WG Shin-Ichi Nakano, Takeaki Uno
2004	B	`conf`	Constant Time Generation of Trees with Specified Diameter. WG Shin-Ichi Nakano, Takeaki Uno
2004	J	`jnl`	Efficient Generation of Plane Triangulations with Specified Maximum Degree. IEICE Trans. Inf. Syst. Hiroyuki Tanaka, Shin-Ichi Nakano
2004	J	`jnl`	Efficient generation of triconnected plane triangulations. Comput. Geom. Shin-Ichi Nakano
2004	J	`jnl`	Listing all rectangular drawings with certain properties. Syst. Comput. Jpn. Masahiro Takagi, Shin-Ichi Nakano
2003	B	`conf`	Discovering Frequent Substructures in Large Unordered Trees. Discovery Science Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano
2003	J	`jnl`	Efficient Generation of Plane Triangulations with a Degree Constraint. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hiroyuki Tanaka, Zhangjian Li, Shin-Ichi Nakano
2003	Misc	`conf`	How to Obtain the Complete List of Caterpillars (Extended Abstract). COCOON Yosuke Kikuchi, Hiroyuki Tanaka, Shin-Ichi Nakano, Yukio Shibata
2003	J	`jnl`	Listing All Connected Plane Triangulations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Zhangjian Li, Shin-Ichi Nakano
2003	A	`conf`	More Efficient Generation of Plane Triangulations. GD Shin-Ichi Nakano, Takeaki Uno
2002	J	`jnl`	Efficient generation of plane trees. Inf. Process. Lett. Shin-Ichi Nakano
2002	J	`jnl`	Enumerating Floorplans with IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shin-Ichi Nakano
2002	J	`jnl`	Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shin-Ichi Nakano
2002	J	`jnl`	Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geom. Appl. Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
2002	J	`jnl`	Rectangular drawings of plane graphs without designated corners. Comput. Geom. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
2001	A*	`conf`	Efficient Generation of Plane Triangulations without Repetitions. ICALP Zhangjian Li, Shin-Ichi Nakano
2001	Misc	`conf`	Efficient Generation of Triconnected Plane Triangulations. COCOON Shin-Ichi Nakano
2001	B	`conf`	Enumerating Floorplans with n Rooms. ISAAC Shin-Ichi Nakano
2001	J	`jnl`	Grid Drawings of 4-Connected Plane Graphs. Discret. Comput. Geom. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
2001	—	`conf`	Listing all connected plane triangulation. CCCG Zhangjian Li, Shin-Ichi Nakano
2000	A	`conf`	A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). GD Shin-Ichi Nakano, Makiko Yoshikawa
2000	B	`conf`	A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. WG Sayaka Nagai, Shin-Ichi Nakano
2000	J	`jnl`	Box-Rectangular Drawings of Plane Graphs. J. Algorithms Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
2000	B	`conf`	Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano
2000	A	`conf`	Labeling Points with Rectangles of Various Shapes. GD Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
2000	Misc	`conf`	Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999	J	`jnl`	A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. J. Graph Algorithms Appl. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999	J	`jnl`	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. Int. J. Found. Comput. Sci. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
1999	B	`conf`	Box-Rectangular Drawings of Plane Graphs. WG Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999	Misc	`ed.`	Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings COCOON Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama
1999	A	`conf`	Grid Drawings of Four-Connected Plane Graphs. GD Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
1998	B	`conf`	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. WG Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
1998	J	`jnl`	Minimum-width grid drawings of plane graphs. Comput. Geom. Marek Chrobak, Shin-Ichi Nakano
1998	J	`jnl`	Rectangular grid drawings of plane graphs. Comput. Geom. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1997	A	`conf`	A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. GD Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1997	J	`jnl`	A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Inf. Process. Lett. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
1996	A	`conf`	A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. GD Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
1996	J	`jnl`	Edge-Coloring Partial k-Trees. J. Algorithms Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1996	Misc	`conf`	Rectangular Grid Drawings of Plane Graphs. COCOON Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1995	—	`ch.`	Edge-Coloring Algorithms. Computer Science Today Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki
1994	—	`conf`	A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1994	A	`conf`	Minimum-Width Grid Drawings of Plane Graphs. GD Marek Chrobak, Shin-Ichi Nakano
1993	A	`conf`	A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1993	B	`conf`	Nearly uniform scheduling of file transfers. IPCO Shin-Ichi Nakano, Takao Nishizeki
1993	J	`jnl`	Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. Shin-Ichi Nakano, Takao Nishizeki
1992	B	`conf`	An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
1991	—	`conf`	Scheduling File Transfers under Port and Channel Constraints. ISA Shin-Ichi Nakano, Takao Nishizeki
1990	J	`jnl`	On the fg-coloring of graphs. Comb. Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito