Hirotoshi HONMA


A Method for Extraction of Future Reference Sentences Based on Semantic Role Labeling
Yoko NAKAJIMA Michal PTASZYNSKI Hirotoshi HONMA Fumito MASUI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/02/01
Vol. E99-D  No. 2  pp. 514-524
Type of Manuscript:  PAPER
Category: Natural Language Processing
Keyword: 
natural language processingfuture reference expressionsfuture predictioninformation extraction
 Summary | Full Text:PDF(610.8KB)

Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph
Hirotoshi HONMA Yoko NAKAJIMA Yuta IGARASHI Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6  pp. 1161-1167
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithmsintersection graphsmaximum detour hinge vertex problempermutation graph
 Summary | Full Text:PDF(589.8KB)

Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs
Hirotoshi HONMA Yoko NAKAJIMA Yuta IGARASHI Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A  No. 6  pp. 1365-1369
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithmsmaximum detour hinge vertex problemintersection graphsinterval graphs
 Summary | Full Text:PDF(232KB)

A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs
Hirotoshi HONMA Yoko NAKAJIMA Haruka AOSHIMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/06/01
Vol. E96-A  No. 6  pp. 1051-1058
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithmsintersection graphscircular trapezoid graphsspanning tree problem
 Summary | Full Text:PDF(1MB)

Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs
Hirotoshi HONMA Kodai ABE Yoko NAKAJIMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D  No. 3  pp. 419-425
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
Category: 
Keyword: 
design and analysis of algorithmsarticulation verticeshinge verticescircular permutation graphs
 Summary | Full Text:PDF(468.2KB)

An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph
Hirotoshi HONMA Yutaro KITAMURA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2011/06/01
Vol. E94-A  No. 6  pp. 1381-1385
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design and analysis of algorithmsfeedback vertex settrapezoid graphsNP-hard
 Summary | Full Text:PDF(168.3KB)

An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs
Hirotoshi HONMA Saki HONMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2  pp. 141-148
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
parallel algorithmsgraph algorithmscircular permutation graphsspanning tree
 Summary | Full Text:PDF(615.5KB)

An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
Hirotoshi HONMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/09/01
Vol. E91-A  No. 9  pp. 2296-2300
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
parallel algorithmstrapezoid graphsspanning forestspanning tree
 Summary | Full Text:PDF(300.4KB)

An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
Hirotoshi HONMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/01/01
Vol. E91-A  No. 1  pp. 383-391
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
parallel algorithmscircular-arc graphshinge verticesnetwork reliability
 Summary | Full Text:PDF(390.2KB)

A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph
Hirotoshi HONMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A  No. 5  pp. 1031-1040
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
parallel algorithmtrapezoid graphshinge verticesnetwork reliability
 Summary | Full Text:PDF(688KB)

A Parallel Algorithm for Finding All Hinge Vertices of an Interval Graph
Hirotoshi HONMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/03/01
Vol. E84-D  No. 3  pp. 419-423
Type of Manuscript:  LETTER
Category: Algorithms
Keyword: 
parallel algorithminterval graphshinge verticesshortest paths
 Summary | Full Text:PDF(211KB)