Search the dblp DataBase

Publications of Author

1. Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa
   Shortest Semijoin Schedule for a Local Area Distributed Database System. [Citation Graph (2, 0)][DBLP]
   IEEE Trans. Software Eng., 1987, v:13, n:5, pp:602-606 [Journal]
   
2. Shigeru Masuyama, Toshihide Ibaraki
   Chain Packing in Graphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1991, v:6, n:6, pp:826-839 [Journal]
   
3. Peng Cheng, Shigeru Masuyama
   A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:137-155 [Journal]
   
4. Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
   Edge-disjoint packings of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:50, n:2, pp:135-148 [Journal]
   
5. Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
   Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:16, pp:2402-2410 [Journal]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:4, pp:195-199 [Journal]
   
7. Shigeru Masuyama, Shozo Naito
   Deciding Whether Graph G has Page Number One is in NC. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:1, pp:7-10 [Journal]
   
8. Shin-ichi Nakayama, Shigeru Masuyama
   A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:323-327 [Journal]
   
9. Chishun Kanayama, Shigeru Masuyama
   Animation of tree sway. [Citation Graph (0, 0)][DBLP]
   Systems and Computers in Japan, 1998, v:29, n:1, pp:43-52 [Journal]
   
10. Hiroyuki Sakai, Shigeru Masuyama
    Knowledge acquisition about the deletion possibility of adnominal verb phrases. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 2006, v:37, n:2, pp:25-36 [Journal]
    
11. Shin-ichi Nakayama, Shigeru Masuyama
    A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:6, pp:216-221 [Journal]
    
12. 
    Extraction of Cause Information from Newspaper Articles Concerning Business Performance. [Citation Graph (, )][DBLP]
    
    
13. 
    Automatic Extraction of Basis Expressions That Indicate Economic Trends. [Citation Graph (, )][DBLP]
    
    
14. 
    Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns. [Citation Graph (, )][DBLP]
    
    
15. 
    Acceleration of Byzantine Fault Tolerance by Parallelizing Consensuses. [Citation Graph (, )][DBLP]
    
    
16. 
    Automatic plagiarism detection among term papers. [Citation Graph (, )][DBLP]
    
    
17. 
    On the tree packing problem. [Citation Graph (, )][DBLP]
    
    
18. 
    A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges. [Citation Graph (, )][DBLP]