| 2007 |
| 18 | EE | Hiroki Arimura,
Takeaki Uno,
Shinichi Shimozono:
Time and Space Efficient Discovery of Maximal Geometric Graphs.
Discovery Science 2007: 42-55 |
| 2004 |
| 17 | EE | Tomoaki Suga,
Shinichi Shimozono:
Approximate Point Set Pattern Matching on Sequences and Planes.
CPM 2004: 89-101 |
| 16 | EE | Hiroshi Sakamoto,
Takuya Kida,
Shinichi Shimozono:
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression.
SPIRE 2004: 218-229 |
| 2001 |
| 15 | EE | Katsuaki Taniguchi,
Hiroshi Sakamoto,
Hiroki Arimura,
Shinichi Shimozono,
Setsuo Arikawa:
Mining Semi-structured Data by Path Expressions.
Discovery Science 2001: 378-388 |
| 14 | EE | Hideaki Hori,
Shinichi Shimozono,
Masayuki Takeda,
Ayumi Shinohara:
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
ISAAC 2001: 719-730 |
| 2000 |
| 13 | | Noriko Sugimoto,
Takashi Toyoshima,
Shinichi Shimozono,
Kouichi Hirata:
Constructive Learning of Context-Free Languages with a Subpansive Tree.
ICGI 2000: 270-283 |
| 12 | EE | Norihiro Kubo,
Shinichi Shimozono,
Katsuhiro Muramoto:
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane.
ISAAC 2000: 216-227 |
| 11 | | Hiroki Arimura,
Jun-ichiro Abe,
Hiroshi Sakamoto,
Setsuo Arikawa,
Ryoichi Fujino,
Shinichi Shimozono:
Text Data Mining: Discovery of Important Keywords in the Cyberspace.
Kyoto International Conference on Digital Libraries 2000: 121-126 |
| 10 | EE | Tatsuya Akutsu,
Hiroki Arimura,
Shinichi Shimozono:
On approximation algorithms for local multiple alignment.
RECOMB 2000: 1-7 |
| 9 | | Shinichi Shimozono,
Hiroki Arimura,
Setsuo Arikawa:
Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases.
New Generation Comput. 18(1): 49-60 (2000) |
| 1999 |
| 8 | EE | Shinichi Shimozono:
Alphabet Indexing for Approximating Features of Symbols.
Theor. Comput. Sci. 210(2): 245-260 (1999) |
| 1998 |
| 7 | EE | Hiroki Arimura,
Atsushi Wataki,
Ryoichi Fujino,
Shinichi Shimozono,
Setsuo Arikawa:
An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases.
Discovery Science 1998: 393-394 |
| 6 | EE | Hiroki Arimura,
Shinichi Shimozono:
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words.
ISAAC 1998: 39-48 |
| 5 | EE | Shinichi Shimozono,
Kouichi Hirata,
Ayumi Shinohara:
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.
Inf. Process. Lett. 66(4): 165-170 (1998) |
| 1997 |
| 4 | EE | Shinichi Shimozono:
Finding Optimal Subgraphs by Local Search.
Theor. Comput. Sci. 172(1-2): 265-271 (1997) |
| 1996 |
| 3 | | Kouichi Hirata,
Shinichi Shimozono,
Ayumi Shinohara:
On the Hardness of Approximating the Minimum Consistent OBDD Problem.
SWAT 1996: 112-123 |
| 1995 |
| 2 | | Shinichi Shimozono:
An Approximation Algorithm for Alphabet Indexing Problem.
ISAAC 1995: 2-11 |
| 1 | | Takayoshi Shoudai,
Michael Lappe,
Satoru Miyano,
Ayumi Shinohara,
Takeo Okazaki,
Setsuo Arikawa,
Tomoyuki Uchida,
Shinichi Shimozono,
Takeshi Shinohara,
Satoru Kuhara:
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
ISMB 1995: 359-358 |