|
|
JAIST Repository >
著者: "Nakano, Shin-Ichi"
8 著者名表示.
| 発行日 | タイトル |
著者 |
|---|
| 2007 | Efficient Algorithms for Airline Problem | Nakano, Shin-ichi; Uehara, Ryuhei; Uno, Takeaki |
| 2009 | A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs | Nakano, Shin-ichi; Uehara, Ryuhei; Uno, Takeaki |
| 13-Jan-2010 | Efficient Enumeration of All Ladder Lotteries and Its Application | Yamanaka, Katsuhisa; Nakano, Shin-ichi; Matsui, Yasuko; Uehara, Ryuhei; Nakada, Kento |
| 21-Jun-2013 | Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression | Uno, Takeaki; Uehara, Ryuhei; Nakano, Shin-ichi |
| 7-Aug-2014 | A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks | Ito, Takehiro; Nakano, Shin-ichi; Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi |
| Jan-2016 | A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | Ito, Takehiro; Nakano, Shin-ichi; Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi |
| 21-Mar-2018 | Exact Algorithms for the Max-Min Dispersion Problem | Akagi, Toshihiro; Araki, Tetsuya; Horiyama, Takashi; Nakano, Shin-Ichi; Okamoto, Yoshio; Otachi, Yota; Saitoh, Toshiki; Uehara, Ryuhei; Uno, Takeaki; Wasa, Kunihiro |
| Jan-2019 | Sequentially Swapping Colored Tokens on Graphs | Yamanaka, Katsuhisa; Demaine, Erik D.; Horiyama, Takashi; Kawamura, Akitoshi; Nakano, Shin-ichi; Okamoto, Yoshio; Saitoh, Toshiki; Suzuki, Akira; Uehara, Ryuhei; Uno, Takeaki |
|
