default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShin-Ichi Nakano
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j71]Katsuhisa Yamanaka
, Shin-Ichi Nakano:
Enumerating floorplans with walls. Discret. Appl. Math. 342: 1-11 (2024)- [j70]Tetsuya Araki, Shin-Ichi Nakano:
Dispersion in a Polygon. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1458-1464 (2024) - [j69]Shin-Ichi Nakano:
Assigning Proximity Facilities for Gatherings. IEICE Trans. Inf. Syst. 107(3): 383-385 (2024) - [c61]Shin-Ichi Nakano:
A Gray Code of Ordered Trees. TAMC 2024: 26-37 - [c60]Shin-Ichi Nakano:
(t, s)-Completely Independent Spanning Trees. WALCOM 2024: 365-376 - 2023
- [j68]Shin-Ichi Nakano:
The Coverage Problem by Aligned Disks. Int. J. Comput. Geom. Appl. 33(1&2): 13-23 (2023) - [j67]Shin-Ichi Nakano:
Family Trees for Enumeration. Int. J. Found. Comput. Sci. 34(7): 715-736 (2023) - [c59]Shin-Ichi Nakano:
Variants of Euclidean k-Center Clusterings. COCOON (1) 2023: 209-219 - [c58]Tetsuya Araki, Shin-Ichi Nakano:
Away from Each Other. WALCOM 2023: 61-70 - 2022
- [j66]Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman:
r-Gatherings on a star and uncertain r-gatherings on a line. Discret. Math. Algorithms Appl. 14(5): 2150160:1-2150160:31 (2022) - [j65]Tetsuya Araki, Hiroyuki Miyata, Shin-Ichi Nakano:
Dispersion on Intervals. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1181-1186 (2022) - [j64]Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka:
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. 105-D(3): 503-507 (2022) - [j63]Tetsuya Araki, Shin-Ichi Nakano:
Max-min dispersion on a line. J. Comb. Optim. 44(3): 1824-1830 (2022) - [c57]Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano:
Escape from the Room. COCOON 2022: 232-241 - [i1]Shin-Ichi Nakano:
A Gray Code of Ordered Trees. CoRR abs/2207.01129 (2022) - 2021
- [j62]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1101-1107 (2021) - [c56]Tetsuya Araki, Hiroyuki Miyata, Shin-Ichi Nakano:
Dispersion on Intervals. CCCG 2021: 297-302 - [c55]Shin-Ichi Nakano:
The Coverage Problem by Aligned Disks. COCOON 2021: 221-230 - 2020
- [j61]Kazuyuki Amano, Shin-Ichi Nakano:
An Approximation Algorithm for the 2-Dispersion Problem. IEICE Trans. Inf. Syst. 103-D(3): 506-508 (2020) - [j60]Toshihiro Akagi, Tetsuya Araki, Shin-Ichi Nakano:
Efficient Algorithms for the Partial Sum Dispersion Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1206-1210 (2020) - [j59]Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
Guest Editors' Foreword. J. Graph Algorithms Appl. 24(2): 63-64 (2020) - [c54]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Floorplans with Walls. TAMC 2020: 50-59
2010 – 2019
- 2019
- [j58]Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
Enumerating Highly-Edge-Connected Spanning Subgraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1002-1006 (2019) - [j57]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23(1): 3-27 (2019) - [j56]Shin-Ichi Nakano:
A Simple Algorithm for r-gatherings on the Line. J. Graph Algorithms Appl. 23(5): 837-845 (2019) - [c53]Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman:
One-Dimensional r-Gathering Under Uncertainty. AAIM 2019: 1-15 - [c52]Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Simple Fold and Cut Problem for Line Segments. CCCG 2019: 153-158 - [c51]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. COCOON 2019: 291-300 - [c50]Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman:
r-Gatherings on a Star. WALCOM 2019: 31-42 - [e5]Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings. Lecture Notes in Computer Science 11355, Springer 2019, ISBN 978-3-030-10563-1 [contents] - 2018
- [j55]Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano:
Enumerating Floorplans with Columns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1392-1397 (2018) - [c49]Kazuyuki Amano, Shin-Ichi Nakano:
Away from Rivals. CCCG 2018: 68-71 - [c48]Tetsuya Araki, Shin-Ichi Nakano:
Max-Min Dispersion on a Line. COCOA 2018: 672-678 - [c47]Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
More Routes for Evacuation. COCOON 2018: 76-83 - [c46]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. FAW 2018: 263-272 - [c45]Shin-Ichi Nakano:
A Simple Algorithm for r-gatherings on the Line. WALCOM 2018: 1-7 - 2017
- [j54]Toshihiro Akagi, Shin-Ichi Nakano:
On r-Gatherings on the Line. IEICE Trans. Inf. Syst. 100-D(3): 428-433 (2017) - [j53]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Enumeration, Counting, and Random Generation of Ladder Lotteries. IEICE Trans. Inf. Syst. 100-D(3): 444-451 (2017) - [c44]Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano:
Floorplans with Columns. COCOA (1) 2017: 33-40 - [c43]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. WALCOM 2017: 435-447 - 2016
- [j52]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51: 25-39 (2016) - [j51]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Uniformly Random Generation of Floorplans. IEICE Trans. Inf. Syst. 99-D(3): 624-629 (2016) - [j50]Toshihiro Akagi, Ryota Arai, Shin-Ichi Nakano:
Faster Min-Max r-Gatherings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1149-1151 (2016) - [c42]Shin-Ichi Nakano:
Assigning Proximity Facilities for Gatherings. COCOON 2016: 247-253 - [r2]Shin-Ichi Nakano:
Geometric Object Enumeration. Encyclopedia of Algorithms 2016: 837-840 - [r1]Shin-Ichi Nakano:
Tree Enumeration. Encyclopedia of Algorithms 2016: 2252-2254 - 2015
- [j49]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Another Optimal Binary Representation of Mosaic Floorplans. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1223-1224 (2015) - [j48]Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki:
Anti-Slide. J. Inf. Process. 23(3): 252-257 (2015) - [c41]Toshihiro Akagi, Shin-Ichi Nakano:
On r-Gatherings on the Line. FAW 2015: 25-32 - [c40]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Enumeration, Counting, and Random Generation of Ladder Lotteries. FAW 2015: 294-303 - 2014
- [j47]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Efficient Enumeration of All Ladder Lotteries with k Bars. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1163-1170 (2014) - [j46]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544: 14-31 (2014) - 2013
- [j45]Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto:
Guest Editorial: Selected Papers from ISAAC 2011. Algorithmica 67(1): 1-2 (2013) - [j44]Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. Discret. Math. Algorithms Appl. 5(2) (2013) - [j43]Shin-Ichi Nakano, Katsuhisa Yamanaka:
A Compact Encoding of Rectangular Drawings with Edge Lengths. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1032-1035 (2013) - [j42]Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 23(2): 73-74 (2013) - [j41]Masashi Saito, Shin-Ichi Nakano:
Two Compact Codes for Rectangular Drawings with Degree Four Vertices. Inf. Media Technol. 8(4): 1005-1009 (2013) - [j40]Shin-Ichi Nakano:
Guest Editor's Foreword. J. Graph Algorithms Appl. 17(2): 57-58 (2013) - [j39]Masashi Saito, Shin-Ichi Nakano:
Two Compact Codes for Rectangular Drawings with Degree Four Vertices. J. Inf. Process. 21(4): 660-664 (2013) - [j38]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient algorithms for a simple network design problem. Networks 62(2): 95-104 (2013) - 2012
- [j37]Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Enumerating All Rooted Trees Including k Leaves. IEICE Trans. Inf. Syst. 95-D(3): 763-768 (2012) - [j36]Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient enumeration of ordered trees with k leaves. Theor. Comput. Sci. 442: 22-27 (2012) - [c39]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381 - [c38]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35 - [c37]Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. WALCOM 2012: 5-16 - [e4]Md. Saidur Rahman, Shin-Ichi Nakano:
WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7157, Springer 2012, ISBN 978-3-642-28075-7 [contents] - 2011
- [j35]Andry Setiawan, Shin-Ichi Nakano:
Listing All st-Orientations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(10): 1965-1970 (2011) - [j34]Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano:
Generating All Triangulations of Plane Graphs. J. Graph Algorithms Appl. 15(3): 457-482 (2011) - [c36]Kozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano:
A Compact Encoding of Unordered Binary Trees. TAMC 2011: 106-113 - [e3]Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe:
Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Lecture Notes in Computer Science 7074, Springer 2011, ISBN 978-3-642-25590-8 [contents] - 2010
- [j33]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A compact encoding of plane triangulations with efficient query supports. Inf. Process. Lett. 110(18-19): 803-809 (2010) - [j32]Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada:
Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. 411(16-18): 1714-1722 (2010)
2000 – 2009
- 2009
- [j31]Naoki Shimotsuma, Shin-Ichi Nakano:
A Simple Canonical Code for Fullerene Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(12): 3398-3400 (2009) - [j30]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24(3): 517-533 (2009) - [j29]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Listing All Plane Graphs. J. Graph Algorithms Appl. 13(1): 5-18 (2009) - [c35]Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM 2009: 141-150 - [c34]Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano:
Generating All Triangulations of Plane Graphs (Extended Abstract). WALCOM 2009: 151-164 - 2008
- [j28]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2284-2291 (2008) - [c33]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Plane Triangulations with Efficient Query Supports. WALCOM 2008: 120-131 - [c32]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Listing All Plane Graphs. WALCOM 2008: 210-221 - [e2]Shin-Ichi Nakano, Md. Saidur Rahman:
WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008. Lecture Notes in Computer Science 4921, Springer 2008, ISBN 978-3-540-77890-5 [contents] - 2007
- [j27]Shin-Ichi Nakano:
Special Section on Foundations of Computer Science. IEICE Trans. Inf. Syst. 90-D(2): 387 (2007) - [j26]Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, Shin-Ichi Nakano:
Constant Time Generation of Integer Partitions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 888-895 (2007) - [c31]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports. AAIM 2007: 68-81 - [c30]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127 - [c29]Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient Algorithms for Airline Problem. TAMC 2007: 428-439 - [c28]Akimitsu Ono, Shin-Ichi Nakano:
Constant Time Generation of Linear Extensions. WALCOM 2007: 151-161 - 2006
- [j25]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Coding Floorplans with Fewer Bits. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1181-1185 (2006) - [j24]Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, Shin-Ichi Nakano:
Constant Time Generation of Rectangular Drawings with Exactly n Faces. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(9): 2445-2450 (2006) - [j23]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Convex Grid Drawings of Four-connected Plane Graphs. Int. J. Found. Comput. Sci. 17(5): 1031-1060 (2006) - 2005
- [j22]Shin-ichiro Kawano, Shin-Ichi Nakano:
Constant Time Generation of Set Partitions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 930-934 (2005) - [j21]Shin-ichiro Kawano, Shin-Ichi Nakano:
Generating All Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1129-1135 (2005) - [c27]Akimitsu Ono, Shin-Ichi Nakano:
Constant Time Generation of Linear Extensions. FCT 2005: 445-453 - [c26]Shin-Ichi Nakano, Takeaki Uno:
Generating Colored Trees. WG 2005: 249-260 - 2004
- [j20]Shin-Ichi Nakano:
Efficient generation of triconnected plane triangulations. Comput. Geom. 27(2): 109-122 (2004) - [j19]Hiroyuki Tanaka, Shin-Ichi Nakano:
Efficient Generation of Plane Triangulations with Specified Maximum Degree. IEICE Trans. Inf. Syst. 87-D(2): 330-336 (2004) - [j18]Masahiro Takagi, Shin-Ichi Nakano:
Listing all rectangular drawings with certain properties. Syst. Comput. Jpn. 35(4): 1-8 (2004) - [c25]Shin-Ichi Nakano, Takeaki Uno:
Constant Time Generation of Trees with Specified Diameter. WG 2004: 33-45 - 2003
- [j17]Hiroyuki Tanaka, Zhangjian Li, Shin-Ichi Nakano:
Efficient Generation of Plane Triangulations with a Degree Constraint. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 829-834 (2003) - [j16]Zhangjian Li, Shin-Ichi Nakano:
Listing All Connected Plane Triangulations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(7): 1807-1812 (2003) - [c24]Yosuke Kikuchi, Hiroyuki Tanaka, Shin-Ichi Nakano, Yukio Shibata:
How to Obtain the Complete List of Caterpillars (Extended Abstract). COCOON 2003: 329-338 - [c23]Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano:
Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61 - [c22]Shin-Ichi Nakano, Takeaki Uno:
More Efficient Generation of Plane Triangulations. GD 2003: 273-282 - 2002
- [j15]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3): 121-138 (2002) - [j14]Shin-Ichi Nakano:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 921 (2002) - [j13]Shin-Ichi Nakano:
Enumerating Floorplans with n Rooms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(7): 1746-1750 (2002) - [j12]Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geom. Appl. 12(6): 511-528 (2002) - [j11]Shin-Ichi Nakano:
Efficient generation of plane trees. Inf. Process. Lett. 84(3): 167-172 (2002) - 2001
- [j10]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of 4-Connected Plane Graphs. Discret. Comput. Geom. 26(1): 73-87 (2001) - [c21]Zhangjian Li, Shin-Ichi Nakano:
Listing all connected plane triangulation. CCCG 2001: 121-124 - [c20]Shin-Ichi Nakano:
Efficient Generation of Triconnected Plane Triangulations. COCOON 2001: 131-141 - [c19]Zhangjian Li, Shin-Ichi Nakano:
Efficient Generation of Plane Triangulations without Repetitions. ICALP 2001: 433-443 - [c18]Shin-Ichi Nakano:
Enumerating Floorplans with n Rooms. ISAAC 2001: 107-115 - 2000
- [j9]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. J. Algorithms 37(2): 363-398 (2000) - [c17]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON 2000: 85-94 - [c16]Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes. GD 2000: 91-102 - [c15]Shin-Ichi Nakano, Makiko Yoshikawa:
A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). GD 2000: 296-307 - [c14]Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano:
Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC 2000: 254-265 - [c13]Sayaka Nagai, Shin-Ichi Nakano:
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. WG 2000: 290-301
1990 – 1999
- 1999
- [j8]Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki:
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. Int. J. Found. Comput. Sci. 10(2): 195-210 (1999) - [j7]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. J. Graph Algorithms Appl. 3(4): 31-62 (1999) - [c12]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of Four-Connected Plane Graphs. GD 1999: 145-154 - [c11]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. WG 1999: 250-261 - [e1]Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama:
Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings. Lecture Notes in Computer Science 1627, Springer 1999, ISBN 3-540-66200-6 [contents] - 1998
- [j6]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular grid drawings of plane graphs. Comput. Geom. 10(3): 203-220 (1998) - [j5]Marek Chrobak, Shin-Ichi Nakano:
Minimum-width grid drawings of plane graphs. Comput. Geom. 11(1): 29-54 (1998) - [c10]Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki:
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. WG 1998: 310-323 - 1997
- [j4]Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Inf. Process. Lett. 62(6): 315-322 (1997) - [c9]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. GD 1997: 99-110 - 1996
- [j3]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
Edge-Coloring Partial k-Trees. J. Algorithms 21(3): 598-617 (1996) - [c8]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Grid Drawings of Plane Graphs. COCOON 1996: 92-105 - [c7]Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. GD 1996: 334-344 - 1995
- [p1]Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki:
Edge-Coloring Algorithms. Computer Science Today 1995: 172-183 - 1994
- [c6]Marek Chrobak, Shin-Ichi Nakano:
Minimum-Width Grid Drawings of Plane Graphs. GD 1994: 104-110 - [c5]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT 1994: 359-369 - 1993
- [j2]Shin-Ichi Nakano, Takao Nishizeki:
Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. 4(2): 101-115 (1993) - [c4]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA 1993: 409-418 - [c3]Shin-Ichi Nakano, Takao Nishizeki:
Nearly uniform scheduling of file transfers. IPCO 1993: 425-431 - 1992
- [c2]Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki:
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529 - 1991
- [c1]Shin-Ichi Nakano, Takao Nishizeki:
Scheduling File Transfers under Port and Channel Constraints. ISA 1991: 43-51 - 1990
- [j1]Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito:
On the fg-coloring of graphs. Comb. 10(1): 67-80 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
