PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Masuyama, Shigeru"

Author of the publication

copydeleteadd this publication to your clipboard
Formulation of Mobile Agent Allocation and its Strong NP-Completeness.

, , , and . IEICE Transactions, 88-D (5): 1060-1063 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Masuyama, Shigeru
add a person with the name Masuyama, Shigeru
 

Other publications of authors with the same name

Yet Another Summarization System with Two Modules using Empirical Knowledge., , , and . NTCIR, National Institute of Informatics (NII), (2001)A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Cographs., and . IEICE Transactions, 99-D (10): 2574-2584 (2016)An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph., , and . IEICE Transactions, 94-A (6): 1381-1385 (2011)Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns., , and . PAKM, volume 5345 of Lecture Notes in Computer Science, page 111-122. Springer, (2008)Creating Japanese Political Corpus from Local Assembly Minutes of 47 prefectures., , , , , , , and . ALR@COLING, page 78-85. The COLING 2016 Organizing Committee, (2016)Enhancing older people's activity and participation with socially assistive robots: a multicentre quasi-experimental study using the ICF framework., , and . Advanced Robotics, 32 (22): 1207-1216 (2018)Shortest Semijoin Schedule for a Local Area Distributed Database System., , , and . IEEE Trans. Software Eng., 13 (5): 602-606 (1987)Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph., and . IEICE Transactions, 91-D (2): 178-186 (2008)Erratum and addendum to Ä linear time algorithm for finding all hinge vertices of a permutation graph" Information Processing Letters 59 (2) (1996) 103-107., , and . Inf. Process. Lett., 111 (18): 891-894 (2011)On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph., and . Inf. Process. Lett., 51 (4): 195-199 (1994)