| 2026 | DLT | Generation and Enumeration of Floorplans Determined by HV-Matrices. | Andrea Frosini, Shin-Ichi Nakano, Simone Rinaldi |
| 2024 | COCOON | Enumerating Floorplans with Any Set of Columns. | Yosuke Kikuchi, Shin-Ichi Nakano |
| 2024 | TAMC | A Gray Code of Ordered Trees. | Shin-Ichi Nakano |
| 2024 | WALCOM | (t, s)-Completely Independent Spanning Trees. | Shin-Ichi Nakano |
| 2023 | COCOON | Variants of Euclidean k-Center Clusterings. | Shin-Ichi Nakano |
| 2023 | WALCOM | Away from Each Other. | Tetsuya Araki, Shin-Ichi Nakano |
| 2022 | COCOON | Escape from the Room. | Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano |
| 2021 | COCOON | The Coverage Problem by Aligned Disks. | Shin-Ichi Nakano |
| 2020 | TAMC | Floorplans with Walls. | Katsuhisa Yamanaka, Shin-Ichi Nakano |
| 2019 | AAIM | One-Dimensional r-Gathering Under Uncertainty. | Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman |
| 2019 | COCOON | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2019 | WALCOM | r-Gatherings on a Star. | Shareef Ahmed, Shin-Ichi Nakano, Md. Saidur Rahman |
| 2018 | COCOA | Max-Min Dispersion on a Line. | Tetsuya Araki, Shin-Ichi Nakano |
| 2018 | COCOON | More Routes for Evacuation. | Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano |
| 2018 | FAW | 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 |
| 2018 | WALCOM | A Simple Algorithm for r-gatherings on the Line. | Shin-Ichi Nakano |
| 2017 | COCOA | Floorplans with Columns. | Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano |
| 2017 | WALCOM | 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, Takeaki Uno |
| 2016 | COCOON | Assigning Proximity Facilities for Gatherings. | Shin-Ichi Nakano |
| 2015 | FAW | On r-Gatherings on the Line. | Toshihiro Akagi, Shin-Ichi Nakano |
| 2015 | FAW | Enumeration, Counting, and Random Generation of Ladder Lotteries. | Katsuhisa Yamanaka, Shin-Ichi Nakano |
| 2012 | ISAAC | 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, Yushi Uno |
| 2012 | WALCOM | Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
| 2011 | TAMC | A Compact Encoding of Unordered Binary Trees. | Kozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano |
| 2009 | WALCOM | Generating All Triangulations of Plane Graphs (Extended Abstract). | Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano |
| 2009 | WALCOM | Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). | Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano |
| 2008 | WALCOM | A Compact Encoding of Plane Triangulations with Efficient Query Supports. | Katsuhisa Yamanaka, Shin-Ichi Nakano |
| 2008 | WALCOM | Listing All Plane Graphs. | Katsuhisa Yamanaka, Shin-Ichi Nakano |
| 2007 | AAIM | A Compact Encoding of Rectangular Drawings with Efficient Query Supports. | Katsuhisa Yamanaka, Shin-Ichi Nakano |
| 2007 | TAMC | A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
| 2007 | TAMC | Efficient Algorithms for Airline Problem. | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
| 2007 | WALCOM | Constant Time Generation of Linear Extensions. | Akimitsu Ono, Shin-Ichi Nakano |
| 2005 | FCT | Constant Time Generation of Linear Extensions. | Akimitsu Ono, Shin-Ichi Nakano |
| 2005 | WG | Generating Colored Trees. | Shin-Ichi Nakano, Takeaki Uno |
| 2004 | WG | Constant Time Generation of Trees with Specified Diameter. | Shin-Ichi Nakano, Takeaki Uno |
| 2003 | COCOON | How to Obtain the Complete List of Caterpillars (Extended Abstract). | Yosuke Kikuchi, Hiroyuki Tanaka, Shin-Ichi Nakano, Yukio Shibata |
| 2003 | DIS | Discovering Frequent Substructures in Large Unordered Trees. | Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano |
| 2003 | GD | More Efficient Generation of Plane Triangulations. | Shin-Ichi Nakano, Takeaki Uno |
| 2001 | COCOON | Efficient Generation of Triconnected Plane Triangulations. | Shin-Ichi Nakano |
| 2001 | ICALP | Efficient Generation of Plane Triangulations without Repetitions. | Zhangjian Li, Shin-Ichi Nakano |
| 2001 | ISAAC | Enumerating Floorplans with n Rooms. | Shin-Ichi Nakano |
| 2000 | COCOON | Rectangular Drawings of Plane Graphs Without Designated Corners. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 2000 | GD | Labeling Points with Rectangles of Various Shapes. | Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe |
| 2000 | GD | A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). | Shin-Ichi Nakano, Makiko Yoshikawa |
| 2000 | ISAAC | Convex Grid Drwaings of Four-Connected Plane Graphs. | Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano |
| 2000 | WG | A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. | Sayaka Nagai, Shin-Ichi Nakano |
| 1999 | GD | Grid Drawings of Four-Connected Plane Graphs. | Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki |
| 1999 | WG | Box-Rectangular Drawings of Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1998 | WG | A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. | Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki |
| 1997 | GD | A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1996 | COCOON | Rectangular Grid Drawings of Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1996 | GD | A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. | Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki |
| 1994 | GD | Minimum-Width Grid Drawings of Plane Graphs. | Marek Chrobak, Shin-Ichi Nakano |
| 1993 | ESA | A Linear Algorithm for Edge-Coloring Partial k-Trees. | Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki |
| 1993 | IPCO | Nearly uniform scheduling of file transfers. | Shin-Ichi Nakano, Takao Nishizeki |
| 1992 | LATIN | An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. | Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki |