| 2008 |
|---|
| 23 | EE | Hiroki Sakaji,
Hiroyuki Sakai,
Shigeru Masuyama:
Automatic Extraction of Basis Expressions That Indicate Economic Trends.
PAKDD 2008: 977-984 |
| 22 | EE | Hiroki Sakaji,
Satoshi Sekine,
Shigeru Masuyama:
Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns.
PAKM 2008: 111-122 |
| 21 | EE | Hirotoshi Honma,
Shigeru Masuyama:
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph.
IEICE Transactions 91-A(1): 383-391 (2008) |
| 20 | EE | Hirotoshi Honma,
Shigeru Masuyama:
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs.
IEICE Transactions 91-A(9): 2296-2300 (2008) |
| 19 | EE | Peng Cheng,
Shigeru Masuyama:
Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn.
IEICE Transactions 91-A(9): 2314-2321 (2008) |
| 18 | EE | Peng Cheng,
Shigeru Masuyama:
Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph.
IEICE Transactions 91-D(2): 178-186 (2008) |
| 17 | EE | Hiroyuki Sakai,
Shigeru Masuyama:
Cause Information Extraction from Financial Articles Concerning Business Performance.
IEICE Transactions 91-D(4): 959-968 (2008) |
| 16 | EE | Masanobu Tsuruta,
Hiroyuki Sakai,
Shigeru Masuyama:
An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites.
IEICE Transactions 91-D(4): 986-989 (2008) |
| 2007 |
|---|
| 15 | EE | Hiroyuki Sakai,
Shigeru Masuyama:
Extraction of Cause Information from Newspaper Articles Concerning Business Performance.
AIAI 2007: 205-212 |
| 14 | EE | Shin-ichi Nakayama,
Shigeru Masuyama:
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs.
Inf. Process. Lett. 103(6): 216-221 (2007) |
| 2006 |
|---|
| 13 | EE | Keizo Miyata,
Shigeru Masuyama,
Shin-ichi Nakayama,
Liang Zhao:
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
Discrete Applied Mathematics 154(16): 2402-2410 (2006) |
| 12 | EE | Shin-ichi Nakayama,
Shigeru Masuyama:
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs.
IEICE Transactions 89-D(8): 2357-2363 (2006) |
| 11 | EE | Hiroyuki Sakai,
Shigeru Masuyama:
Knowledge acquisition about the deletion possibility of adnominal verb phrases.
Systems and Computers in Japan 37(2): 25-36 (2006) |
| 2005 |
|---|
| 10 | EE | Atsushi Sasaki,
Tadashi Araragi,
Shigeru Masuyama,
Keizo Miyata:
Formulation of Mobile Agent Allocation and its Strong NP-Completeness.
IEICE Transactions 88-D(5): 1060-1063 (2005) |
| 1998 |
|---|
| 9 | EE | Chishun Kanayama,
Shigeru Masuyama:
Animation of tree sway.
Systems and Computers in Japan 29(1): 43-52 (1998) |
| 1997 |
|---|
| 8 | EE | Shin-ichi Nakayama,
Shigeru Masuyama:
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs.
Inf. Process. Lett. 62(6): 323-327 (1997) |
| 1995 |
|---|
| 7 | EE | Peng Cheng,
Shigeru Masuyama:
A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs.
Discrete Applied Mathematics 56(2-3): 137-155 (1995) |
| 1994 |
|---|
| 6 | | Derek G. Corneil,
Shigeru Masuyama,
S. Louis Hakimi:
Edge-disjoint packings of graphs.
Discrete Applied Mathematics 50(2): 135-148 (1994) |
| 5 | | Peng Chen,
Shigeru Masuyama:
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph.
Inf. Process. Lett. 51(4): 195-199 (1994) |
| 1992 |
|---|
| 4 | EE | Shigeru Masuyama:
On the tree packing problem.
Discrete Applied Mathematics 35(2): 163-166 (1992) |
| 3 | | Shigeru Masuyama,
Shozo Naito:
Deciding Whether Graph G has Page Number One is in NC.
Inf. Process. Lett. 44(1): 7-10 (1992) |
| 1991 |
|---|
| 2 | | Shigeru Masuyama,
Toshihide Ibaraki:
Chain Packing in Graphs.
Algorithmica 6(6): 826-839 (1991) |
| 1987 |
|---|
| 1 | | Shigeru Masuyama,
Toshihide Ibaraki,
Shojiro Nishio,
Toshiharu Hasegawa:
Shortest Semijoin Schedule for a Local Area Distributed Database System.
IEEE Trans. Software Eng. 13(5): 602-606 (1987) |
