|
| Hiroshi NAGAMOCHI
| |
|
| |
|
| |
|
| |
|
| |
|
|
Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees
Morito OOMINE Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/03/01
Vol. E99-D
No. 3
pp. 615-623
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---Developments of the Theory of Algorithms and Computation---)
Category:
Keyword:
mechanisms, group strategy-proof, facility location games, trees, | | | Summary | Full Text:PDF | |
|
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
Masataka IKEDA Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3
pp. 503-511
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
pathwidth, exact algorithms, graphs, chemical graphs, | | | Summary | Full Text:PDF | |
|
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
Mingyu XIAO Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D
No. 3
pp. 408-418
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
Category:
Keyword:
edge dominating sets, exact algorithms, cubic graphs, | | | Summary | Full Text:PDF | |
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Worst Case Analysis for Pickup and Delivery Problems with Transfer
Yoshitaka NAKAO Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2008/09/01
Vol. E91-A
No. 9
pp. 2328-2334
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
pickup and delivery problem, transshipment, upper bound, | | | Summary | Full Text:PDF | |
| |
|
| |
|
| |
|
|
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex
Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D
No. 2
pp. 428-431
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Graph Algorithms
Keyword:
dynamic graph, edge-connectivity, extreme vertex set, graph algorithm, | | | Summary | Full Text:PDF | |
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree
Hiroshi NAGAMOCHI Koji MOCHIZUKI Toshihide IBARAKI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A
No. 5
pp. 1135-1143
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
vehicle-scheduling, tree, algorithm, location problem, | | | Summary | Full Text:PDF | |
| |
|
| |
|
| |
|
| |
|
|
Multiple Graphs Minimizing the Number of Minimum Cut-Sets
Zheng SUN Hiroshi NAGAMOCHI Kikunobu KUSUNOKI | Publication: IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/06/25
Vol. E73-E
No. 6
pp. 915-921
Type of Manuscript:
PAPER
Category: Graphs and Networks
Keyword:
| | | Summary | Full Text:PDF | |
|
|
