The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shin-Ichi Nakano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zhangjian Li, Shin-Ichi Nakano
    Listing all connected plane triangulation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:121-124 [Conf]
  2. Yosuke Kikuchi, Hiroyuki Tanaka, Shin-Ichi Nakano, Yukio Shibata
    How to Obtain the Complete List of Caterpillars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:329-338 [Conf]
  3. Shin-Ichi Nakano
    Efficient Generation of Triconnected Plane Triangulations. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:131-141 [Conf]
  4. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular Drawings of Plane Graphs Without Designated Corners. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:85-94 [Conf]
  5. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular Grid Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:92-105 [Conf]
  6. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano
    Discovering Frequent Substructures in Large Unordered Trees. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:47-61 [Conf]
  7. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:409-418 [Conf]
  8. Akimitsu Ono, Shin-Ichi Nakano
    Constant Time Generation of Linear Extensions. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:445-453 [Conf]
  9. Marek Chrobak, Shin-Ichi Nakano
    Minimum-Width Grid Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:104-110 [Conf]
  10. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
    Grid Drawings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:145-154 [Conf]
  11. Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
    Labeling Points with Rectangles of Various Shapes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:91-102 [Conf]
  12. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
    A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:334-344 [Conf]
  13. Shin-Ichi Nakano, Takeaki Uno
    More Efficient Generation of Plane Triangulations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:273-282 [Conf]
  14. Shin-Ichi Nakano, Makiko Yoshikawa
    A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:296-307 [Conf]
  15. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:99-110 [Conf]
  16. Zhangjian Li, Shin-Ichi Nakano
    Efficient Generation of Plane Triangulations without Repetitions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:433-443 [Conf]
  17. Shin-Ichi Nakano, Takao Nishizeki
    Nearly uniform scheduling of file transfers. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:425-431 [Conf]
  18. Shin-Ichi Nakano, Takao Nishizeki
    Scheduling File Transfers under Port and Channel Constraints. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:43-51 [Conf]
  19. Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano
    Convex Grid Drwaings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:254-265 [Conf]
  20. Shin-Ichi Nakano
    Enumerating Floorplans with n Rooms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:107-115 [Conf]
  21. Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
    An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:516-529 [Conf]
  22. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    A Parallel Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:359-369 [Conf]
  23. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
    A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:310-323 [Conf]
  24. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:250-261 [Conf]
  25. Sayaka Nagai, Shin-Ichi Nakano
    A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:290-301 [Conf]
  26. Shin-Ichi Nakano, Takeaki Uno
    Constant Time Generation of Trees with Specified Diameter. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:33-45 [Conf]
  27. Shin-Ichi Nakano, Takeaki Uno
    Generating Colored Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:249-260 [Conf]
  28. Akimitsu Ono, Shin-Ichi Nakano
    Constant Time Generation of Linear Extensions. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:151-161 [Conf]
  29. Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito
    On the fg-coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:67-80 [Journal]
  30. Marek Chrobak, Shin-Ichi Nakano
    Minimum-width grid drawings of plane graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:1, pp:29-54 [Journal]
  31. Shin-Ichi Nakano
    Efficient generation of triconnected plane triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:2, pp:109-122 [Journal]
  32. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular drawings of plane graphs without designated corners. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:121-138 [Journal]
  33. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular grid drawings of plane graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:203-220 [Journal]
  34. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
    Grid Drawings of 4-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:73-87 [Journal]
  35. Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
    Labeling Points with Rectangles of Various Shapes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:511-528 [Journal]
  36. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
    A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:195-210 [Journal]
  37. Shin-Ichi Nakano, Takao Nishizeki
    Scheduling File Transfers Under Port and Channe; Constraints. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:101-115 [Journal]
  38. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
    Convex Grid Drawings of Four-connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1031-1060 [Journal]
  39. Shin-Ichi Nakano
    Efficient generation of plane trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:167-172 [Journal]
  40. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
    A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:315-322 [Journal]
  41. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:363-398 [Journal]
  42. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:598-617 [Journal]
  43. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:31-62 [Journal]
  44. Masahiro Takagi, Shin-Ichi Nakano
    Listing all rectangular drawings with certain properties. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 2004, v:35, n:4, pp:1-8 [Journal]
  45. Katsuhisa Yamanaka, Shin-Ichi Nakano
    A Compact Encoding of Rectangular Drawings with Efficient Query Supports. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:68-81 [Conf]
  46. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:115-127 [Conf]
  47. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    Efficient Algorithms for Airline Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:428-439 [Conf]

  48. Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). [Citation Graph (, )][DBLP]


  49. Generating All Triangulations of Plane Graphs (Extended Abstract). [Citation Graph (, )][DBLP]


  50. A Compact Encoding of Plane Triangulations with Efficient Query Supports. [Citation Graph (, )][DBLP]


  51. Listing All Plane Graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002