NAGAMOCHI Hiroshi

J-GLOBAL         Last updated: Jun 5, 2018 at 16:54
 
Avatar
Name
NAGAMOCHI Hiroshi
Affiliation
Kyoto University
Section
Graduate School of Informatics, Department of Applied Mathematics and Physis, Graduate School of Informatics Department of Applied Mathematics and Physics
Job title
Professor,Professor
Degree
Dr of Engineering(Kyoto University), Doctor(Kyoto University)

Research Areas

 
 

Education

 
 
 - 
1988
Department of Applied Mathematics and Physics, Graduate School, Division of Engineering, Kyoto University
 
 
 - 
1983
Department of Agricultural Engineering, Faculty of Agriculture, Kyoto University
 

Published Papers

 
Mohd Shahrizan Othman,Aleksandar Shurbevski,Hiroshi Nagamochi
IEICE Transactions   101-D(3) 611-612   2018   [Refereed]
Jinghui Li,Hiroshi Nagamochi,Array
IEEE/ACM Trans. Comput. Biology Bioinform.   15(2) 633-646   2018   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Theor. Comput. Sci.   725 79-98   2018   [Refereed]
Mingyu Xiao,Hiroshi Nagamochi
Inf. Comput.   255 126-146   2017   [Refereed]
Ken Iwaide,Hiroshi Nagamochi
IEICE Transactions   100-D(3) 414-421   2017   [Refereed]
Morito Oomine,Aleksandar Shurbevski,Hiroshi Nagamochi
J. Graph Algorithms Appl.   21(3) 247-263   2017   [Refereed]
Array,Hiroshi Nagamochi
Theor. Comput. Sci.   659 72-82   2017   [Refereed]
Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi
JIP   25 639-654   2017   [Refereed]
Mohd Shahrizan Othman,Aleksandar Shurbevski,Yoshiyuki Karuno,Hiroshi Nagamochi
JIP   25 655-666   2017   [Refereed]
M. Oomine,NAGAMOCHI Hiroshi
IEICE Transactions Inf. and Syst.   E99-D(3)    Mar 2016   [Refereed]
Ken Iwaide,NAGAMOCHI Hiroshi
J. Graph Algorithms Appl.   20(1) 23-58   2016   [Refereed]
Mingyu Xiao,NAGAMOCHI Hiroshi
Algorithmica   74(2) 713-741   2016   [Refereed]
Mingyu Xiao,NAGAMOCHI Hiroshi
Discrete Applied Mathematics   199 137-155   2016   [Refereed]
Morito Oomine,Hiroshi Nagamochi
IEICE Transactions   99-D(3) 615-623   2016   [Refereed]
M. Xiao,NAGAMOCHI Hiroshi
Theory of Computing Systems   58(2) 241-272   2016   [Refereed]
Fei He,Akiyoshi Hanai,Hiroshi Nagamochi,Tatsuya Akutsu
Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016) - Volume 3: BIOINFORMATICS, Rome, Italy, February 21-23, 2016.   258-265   2016   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers   321-334   2016   [Refereed]
Mingyu Xiao,Hiroshi Nagamochi
27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia   62:1-62:12   2016   [Refereed]
Masataka Ikeda,NAGAMOCHI Hiroshi
IEICE Transactions   E98.D(3) 503-511   2015   [Refereed]
Array,Hiroshi Nagamochi
Discrete Applied Mathematics   190-191 147-162   2015   [Refereed]
Mingyu Xiao,Hiroshi Nagamochi
J. Comb. Optim.   30(2) 214-241   2015   [Refereed]
Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi
Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers   228-240   2015   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers   406-421   2015   [Refereed]
Masaki Suzuki,NAGAMOCHI Hiroshi
J. Cheminformatics   6(1) 31   2014   [Refereed]
Toshihiro Shimizu Takuro Fukunaga,NAGAMOCHI Hiroshi
J. Discrete Algorithms   29(C) 8-20   2014   [Refereed]
Mingyu Xiao,NAGAMOCHI Hiroshi
Theor. Comput. Sci.   560(P2) 207-216   2014   [Refereed]
Mingyu Xiao,Hiroshi Nagamochi
CoRR   abs/1408.6196    2014   [Refereed]
Y. Zhao; M. Hayashida; J. Jindalertudomdee; H. Nagamochi; T. Akutsu
Journal of Bioinformatics and Computational Biology   11(6)    2013   [Refereed]
M. Xiao; H. Nagamochi
Theoretical Computer Science   508 2-15   2013   [Refereed]
M. Xiao; H. Nagamochi
IEICE Transactions on Information and Systems   96-D(3) 408-418   2013   [Refereed]
A. Shurbevski; H. Nagamochi; Y. Karuno
IEICE Transactions on Information and Systems   96-D(3) 450-456   2013   [Refereed]
M. Xiao; T. Fukunaga; H. Nagamochi
Theoretical Computer Science   469 105-118   2013   [Refereed]
M. Xiao; H. Nagamochi
Theoretical Computer Science   469 92-104   2013   [Refereed]
A. Shurbevski; Y. Karuno; H. Nagamochi
Journal of Advanced Mechanical Design, Systems and Manufacturing   6(5) 611-621   2012   [Refereed]
Y. Zhao; M. Hayashida; J.C. Nacher; H. Nagamochi; T. Akutsu
International Journal of Bioinformatics Research and Applications   8(3/4) 210-227   2012   [Refereed]
Y. Arahori; T. Imamichi; H. Nagamochi
Computers and Operations Research   39(12) 2991-3011   2012   [Refereed]
S.-H. Hong; H. Nagamochi
Theoretical Computer Science   445 36-51   2012   [Refereed]
T. Imada; H. Nagamochi
IEICE Transactions on Information and Systems   95-D(3) 712-721   2012   [Refereed]
M. Xiao; H. Nagamochi
Information Processing Letters   112(1-2) 5-9   2012   [Refereed]
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi:
Algorithmica   62(3-4) 787-806   2012   [Refereed]
Seok-Hee Hong, Hiroshi Nagamochi:
Algorithmica   62(3-4) 1122-1158   2012   [Refereed]
H. Aota; T. Fukunaga; H. Nagamochi
International Journal of Computational Geometry and Applications   21(6) 661-684   Dec 2011   [Refereed]
S.-H. Hong; H. Nagamochi
Algorithmica (New York)   61(4) 1022-1076   Dec 2011   [Refereed]
T. Imada; S. Ota; H. Nagamochi; T. Akutsu
Journal of Chemical Information and Modeling   51(11) 2788-2807   Nov 2011   [Refereed]
T. Akutsu; H. Nagamochi
IEICE Transactions on Information and Systems   E94D(10) 1846-1853   Oct 2011   [Refereed]
K. Matsumoto; S. Umetani; H. Nagamochi
Journal of Scheduling   14(3) 281-290   Jun 2011   [Refereed]
H. Nagamochi
Theoretical Computer Science   412(4-5) 383-390   Feb 2011   [Refereed]
B. Zhuang; H. Nagamochi
IEICE Transactions on Information and Systems   E94D(2) 211-219   Feb 2011   [Refereed]
B. Zhuang; H. Nagamochi
IEICE Transactions on Information and Systems   E94D(2) 200-210   Feb 2011   [Refereed]
E. Morsy; H. Nagamochi
Journal of Combinatorial Optimization   21(2) 254-267   Feb 2011   [Refereed]
T. Ohshima; P. Eumthurapojn; L. Zhao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7033 LNCS 154-163   2011   [Refereed]
S.-H. Hong; H. Nagamochi
Algorithmica (New York)   1-37   2011   [Refereed]
T. Imada; S. Ota; H. Nagamochi; T. Akutsu
Journal of Mathematical Chemistry   49(4) 910-970   2011   [Refereed]
M. Shimizu; H. Nagamochi; T. Akutsu
BMC bioinformatics   12(S-14) S3   2011   [Refereed]
S.-H. Hong; H. Nagamochi
Algorithmica (New York)   61(4) 777-778   2011   [Refereed]
S.-H. Hong; H. Nagamochi
International Journal of Computational Geometry and Applications   21(3) 251-252   2011   [Refereed]
T. Ibaraki; T. Imamichi; Y. Koga; H. Nagamochi; K. Nonobe; M. Yagiura
Mathematical Programming   127(2) 297-343   2011   [Refereed]
S. Imahori; Y. Karuno; H. Nagamochi; X. Wang
International Journal of Biometrics   3(3) 228-245   2011   [Refereed]
Y. Karuno; H. Nagamochi; A. Shurbevski
Journal of Advanced Computational Intelligence and Intelligent Informatics   15(8) 1103-1108   2011   [Refereed]
S. Karakawa; E. Morsy; H. Nagamochi
Journal of Graph Algorithms and Applications   15(3) 345-371   2011   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Algorithmica   61(4) 1022-1076   2011   [Refereed]
Bingbing Zhuang,Hiroshi Nagamochi
IEICE Transactions   94-D(2) 200-210   2011   [Refereed]
Bingbing Zhuang,Hiroshi Nagamochi
IEICE Transactions   94-D(2) 211-219   2011   [Refereed]
Tatsuya Akutsu,Hiroshi Nagamochi
IEICE Transactions   94-D(10) 1846-1853   2011   [Refereed]
Hirofumi Aota,Takuro Fukunaga,Hiroshi Nagamochi
Int. J. Comput. Geometry Appl.   21(6) 661-684   2011   [Refereed]
Tomoki Imada,Shunsuke Ota,Hiroshi Nagamochi,Tatsuya Akutsu
Journal of Chemical Information and Modeling   51(11) 2788-2807   2011   [Refereed]
Array,Hiroshi Nagamochi
J. Comb. Optim.   21(2) 254-267   2011   [Refereed]
Kazuki Matsumoto,Array,Hiroshi Nagamochi
J. Scheduling   14(3) 281-290   2011   [Refereed]
Hiroshi Nagamochi
Theor. Comput. Sci.   412(4-5) 383-390   2011   [Refereed]
T. Fukunaga; H. Nagamochi
Discrete Optimization   7(4) 246-255   Nov 2010   [Refereed]
S. Ota; E. Morsy; H. Nagamochi
Theoretical Computer Science   411(44-46) 3979-3993   Oct 2010   [Refereed]
S.-H. Hong; H. Nagamochi
Algorithmica (New York)   58(2) 478-497   Oct 2010   [Refereed]
S.-H. Hong; H. Nagamochi
Algorithmica (New York)   58(2) 433-460   Oct 2010   [Refereed]
Y. Ishida; Y. Kato; L. Zhao; H. Nagamochi; T. Akutsu
Journal of Chemical Information and Modeling   50(5) 934-946   May 2010   [Refereed]
E. Morsy; H. Nagamochi
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E93A(4) 778-786   Apr 2010   [Refereed]
T. Ishii; Y. Akiyama; H. Nagamochi
Algorithmica (New York)   56(4) 413-436   Apr 2010   [Refereed]
S.-H. Hong; H. Nagamochi
Computational Geometry: Theory and Applications   43(2) 191-206   Feb 2010   [Refereed]
H. Nagamochi
Algorithmica (New York)   56(1) 17-34   Jan 2010   [Refereed]
K. Okumoto; T. Fukunaga; H. Nagamochi
Algorithmica (New York)   1-20   2010   [Refereed]
M. Xiao; T. Fukunaga; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6213 LNCS 210-221   2010   [Refereed]
K. Haraguchi; S.-H. Hong; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6073 LNCS 169-183   2010   [Refereed]
Y. Karuno; H. Nagamochi; X. Wang
Journal of Advanced Mechanical Design, Systems and Manufacturing   4(3) 605-615   2010   [Refereed]
B. Zhuang; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6506 182-193   2010   [Refereed]
B. Zhuang; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6509 347-361   2010   [Refereed]
S.-H. Hong; H. Nagamochi
Journal of Discrete Algorithms   8(3) 282-295   2010   [Refereed]
E. Morsy; H. Nagamochi
Journal of Discrete Algorithms   8(3) 311-320   2010   [Refereed]
B. Zhuang; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6213 113-123   2010   [Refereed]
B. Zhuang; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6108 467-478   2010   [Refereed]
B. Zhuang; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   6078 49-60   2010   [Refereed]
Hiroshi Nagamochi
Algorithmica   56(1) 17-34   2010   [Refereed]
Toshimasa Ishii,Yoko Akiyama,Hiroshi Nagamochi
Algorithmica   56(4) 413-436   2010   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Algorithmica   58(2) 433-460   2010   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Algorithmica   58(2) 478-497   2010   [Refereed]
Seok-Hee Hong,Hiroshi Nagamochi
Comput. Geom.   43(2) 191-206   2010   [Refereed]
Array,Hiroshi Nagamochi
Discrete Optimization   7(4) 246-255   2010   [Refereed]
Ehab Morsy,Hiroshi Nagamochi
IEICE Transactions   93-A(4) 778-786   2010   [Refereed]
Yusuke Ishida,Yuki Kato,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu
Journal of Chemical Information and Modeling   50(5) 934-946   2010   [Refereed]
Shunsuke Ota,Array,Hiroshi Nagamochi
Theor. Comput. Sci.   411(44-46) 3979-3993   2010   [Refereed]
Tatsuya Ohshima,Pipaporn Eumthurapojn,Liang Zhao,Hiroshi Nagamochi
Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers   154-163   2010   [Refereed]
T. Imamichi; M. Yagiura; H. Nagamochi
Discrete Optimization   6(4) 345-361   Nov 2009   [Refereed]

Misc

 
Enumerating Naphthalene Isomers of Tree-like Chemical Graphs.
Fei He, Akiyoshi Hanai,NAGAMOCHI Hiroshi .Tatsuya Akutsu
BIOINFORMATICS   3 258-265   Feb 2016   [Refereed]
Morito Oomine, Aleksandar Shurbevski,NAGAMOCHI Hiroshi
Lecture Notes in Computer Science   9627 286-297   2016   [Refereed]
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
N. Md Yunos, A. Shurbevski,NAGAMOCHI Hiroshi
The 18th Japan Conference on Discrete and Computational Geometry and Graphs   102-103   Sep 2015   [Refereed]
A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs
N. Md Yunos, A. Shurbevski,NAGAMOCHI Hiroshi
The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management   45-58   Aug 2015   [Refereed]
A Method for Generating Colorings over Graph Automorphism
Fei He,NAGAMOCHI Hiroshi
he 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management   70-81   Aug 2015   [Refereed]
Seok-Hee Hong,NAGAMOCHI Hiroshi
41st International Workshop on Graph-Theoretic Concepts in Computer Science      Jun 2015   [Refereed]
A. Shurbevski; H. Nagamochi; Y. Karuno
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   8344 LNCS 56-67   2014   [Refereed]
Seok-Hee Hong, ,NAGAMOCHI Hiroshi
COCOON 2014:   477-488   2014   [Refereed]
M. Xiao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7876 LNCS 96-107   2013   [Refereed]
M. Xiao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   8283 LNCS 328-338   2013   [Refereed]
M. Xiao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   8287 LNCS 153-164   2013   [Refereed]
M. Xiao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7924 LNCS 72-83   2013   [Refereed]
H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7287 LNCS 584-593   2012   [Refereed]
Linear Layouts in Submodular Systems
NAGAMOCHI Hiroshi
ISAAC 2012:   475-484   2012   [Refereed]
M. Xiao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7287 LNCS 360-372   2012   [Refereed]
M. Xiao; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7434 LNCS 74-85   2012   [Refereed]
K. Ibara; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7402 LNCS 301-311   2012   [Refereed]
Deterministic qq(nm) time edge-splitting in undirected graphs
Hiroshi Nagamochi; Toshihide Ibaraki
Conference Proceedings of the Annual ACM Symposium on Theory of Computing   64-73   1996   [Refereed]
Complexity of the single vehicle scheduling problem on graphs, "jointly worked "
永持 仁
Proceedings of the International Workshop Intelligent Scheduling of Robots and Flexible Manufacturing Systems,/ , 89-104      1995   [Refereed]
Combinatorial optimization games
Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms   720-729   1997   [Refereed]
Computing edge-connectivity augmentation function in O(nm) time
Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms   649-658   1997   [Refereed]
Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked "
永持 仁
Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms,/ , 280-289      1998   [Refereed]
A fast algorithm for computing minimum 3-way and 4-way cuts
Nagamochi, H; Ibaraki, T; Cornuejols, G; Burkard, RE; Woeginger, GJ
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION   1610 377-390   1999   [Refereed]
Augmenting a submodular and posi-modular set function by a multigraph, "jointly worked "
永持 仁
Proceedings of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,/ , 273-279      1999   [Refereed]
Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts
Hiroshi Nagamochi,Shigeki Katayama,T. Ibaraki
5th Annual International Conference on Computing and Combinatorics (COCOON'99).      1999   [Refereed]
Ishii, T; Nagamochi, H; Halldorsson, MM
ALGORITHM THEORY - SWAT 2000   1851 286-299   2000   [Refereed]
Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph
T. Ishii, Hiroshi Nagamochi,
11th Annual International Symposium on Algorithms and Computation, ISAAC'00, pp. 326-337.      2000   [Refereed]
Y. Karuno; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2223 36-47   2001   [Refereed]
H. Nagamochi; T. Ishii
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2223 124-135   2001   [Refereed]
L. Zhao; H. Nagamochi; T. Ibaraki
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2223 682-694   2001   [Refereed]
A primal-dual approximation algorithm for the survival network design problem in hypergraphs
Liang Zhao,Hiroshi Nagamochi,T. Ibaraki
18th International Symposium on Theoretical Aspects of Computer Science (STACS2001),pp. 478--489      2001   [Refereed]
A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times
Y. Karuno, Hiroshi Nagamochi
9th Annual European Symposium on Algorithms, BRICS, pp. 218-229.      2001   [Refereed]
H. Ito; H. Nagamochi; Y. Sugiyama; M. Fujita
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2518 441-452   2002   [Refereed]
Polynomial time 2-approximation algorithms for the minmax subtree cover problem
H. Nagamochi; K. Okada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2906 138-147   2003   [Refereed]
An approximation algorithm for dissecting a rectangle into rectangles with specified areas
H. Nagamochi; Y. Abe
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2906 280-289   2003   [Refereed]
A better approximation for the two-machine flowshop scheduling problem with time lags
Y. Karuno; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2906 309-318   2003   [Refereed]
Augmenting forests to meet odd diameter requirements
T. Ishii; S. Yamamoto; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   2906 434-443   2003   [Refereed]
T. Ishii; Y. Akiyama; H. Nagamochi
Electronic Notes in Theoretical Computer Science   78 243-266   2003   [Refereed]
A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked "
永持 仁
Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 210-222      2003   [Refereed]
A simple recognition of maximal planar graphs, "jointly worked "
永持 仁
Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188      2003   [Refereed]
Can a hypergraph cover every convex polygon?, "jointly worked "
永持 仁
the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302      2003   [Refereed]
Computing extreme sets in graphs and its applications
永持 仁
the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357      2003   [Refereed]
Source location problem with local 3-vertex-connectivity requirements, "jointly worked "
永持 仁
the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 368-377      2003   [Refereed]
Fast algorithms for counting bilayer crossings
Hiroshi Nagamochi, N. Yamada
7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209.      2003   [Refereed]
Approximating the minmax subtree cover problem in a cactus
H. Nagamochi; T. Kawada
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   3341 705-716   2004   [Refereed]
Approximation algorithms for the b-edge dominating set problem and its related problems
T. Fukunaga; H. Nagamochi
Lecture Notes in Computer Science   3595 747-756   2005   [Refereed]
T. Ishii; K. Iwata; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   3827 176-185   2005   [Refereed]
Minimum cost source location problem with local 3-vertex-connectivity requirements,
T. Ishii, H. Fujita, Hiroshi Nagamochi,
Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, pp.97-105.      2005   [Refereed]
Bisecting a four-connected graph with three resource sets,
T. Ishii, K. Iwata, Hiroshi Nagamochi,
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,,pp. 107-113.      2005   [Refereed]
Compactness of classifiers by iterative compositions of features
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 92-98.      2005   [Refereed]
Edge packing problem with edge capacity constraints
T. Fukunaga, Hiroshi Nagamochi,
4th Janese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 69-75. ,      2005   [Refereed]
A deterministic algorithm for finding all minimum k-way cuts,
Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi,
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 224-233.,      2005   [Refereed]
Branch-and-bound algorithms for rectangular strip packing and perfect packing problems,
T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi
ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting,      2005   [Refereed]
Exact algorithms for the 2-dimensional strip packing problem with rotations,
M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi,
The IFORS Triennial 2005 Conference      2005   [Refereed]
The relation between option pricing and optimization problems
M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi
The IFORS Triennial 2005 Conference,      2005   [Refereed]
Heuristics for the Minmax Subtree Cover in Graphs
Hiroshi Nagamochi
The IFORS Triennial 2005 Conference,      2005   [Refereed]
Minimizing capacitated tree covers of graphs
Y. Karuno, Hiroshi Nagamochi
Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005)      2005   [Refereed]
Experimental studies on representation complexity and error rates of iteratively composed features,
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki
Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005))      2005   [Refereed]
K. Hirata; T. Matsuda; H. Nagamochi; T. Takine
GLOBECOM - IEEE Global Telecommunications Conference      2006   [Refereed]
Convex drawings with non-convex boundary,
S.-H. Hong, Hiroshi Nagamochi
32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006)      2006   [Refereed]
Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,
T. Fukunaga, Hiroshi Nagamoch
Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06),, pp. 25-32.      2006   [Refereed]
Convex drawings of hierarchical plane graphs
S.-H. Hong, Hiroshi Nagamochi
17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006)      2006   [Refereed]
Minimum transversals in posi-modular systems
M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige
ESA 2006, 14th Annual European Symposium on Algorithms      2006   [Refereed]
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine
IEEE GLOBECOM 2006 Advanced Technologies and Protocols for Optical Networks      2006   [Refereed]
5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)
Imamichi Takashi;Nagamochi Hiroshi;Yagiura Mutsunori
Proceedings of International Symposium on Scheduling   2006 132-137   Jul 2006   [Refereed]
6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
Ibaraki Toshihide;Ishikawa Akihiro;Nagamochi Hiroshi;Nonobe Koji;Yagiura Mutsunori
Proceedings of International Symposium on Scheduling   2006 160-165   Jul 2006   [Refereed]
2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication)
Nakao Yoshitaka;Nagamochi Hiroshi
Proceedings of International Symposium on Scheduling   2006 42-47   Jul 2006   [Refereed]
1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization)
Morsy Ehab;Nagamochi Hiroshi
Proceedings of International Symposium on Scheduling   2006 12-17   Jul 2006   [Refereed]
A novel clustering method for analysis of biological networks using maximal components of graphs
M. Hayashida; T. Akutsu; H. Nagamochi
Series on Advances in Bioinformatics and Computational Biology   5 257-266   2007   [Refereed]
Orthogonal drawings for plane graphs with specified face areas
A. Kawaguchi; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   4484 LNCS 584-594   2007   [Refereed]
Linear-tree rule structure for firewall optimization
L. Zhao; A. Shimae; H. Nagamochi
Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007   67-72   2007   [Refereed]
J. Uchida; Y. Karuno; H. Nagamochi
Proceedings of the SICE Annual Conference   2633-2638   2007   [Refereed]
Extension of ICF classifiers to real world data sets
K. Haraguchi; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   4570 LNAI 776-785   2007   [Refereed]
H. Nagamochi
Proceedings - Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure, ICKS 2007   119-128   2007   [Refereed]
Approximating capacitated tree-routings in networks,
E. Morsy, Hiroshi Nagamochi
The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07)      2007   [Refereed]
An efficient enumeration of colored outerplanar graphs
J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu
The 4th Annual Conference on Theory and Applications of Models of Computation(TAMC07)      2007   [Refereed]
A linear time algorithm for symmetric convex drawings of triconnected planar graphs,
S.-H. Hong, Hiroshi Nagamochi
The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007)      2007   [Refereed]
The set connector problems in graphs
T. Fukunaga, Hiroshi Nagamochi
The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007,      2007   [Refereed]
Packing sets of circles with shape-memory,
T. Imamichi, Hiroshi Nagamochi,
INFORMS International Puerto Rico 2007      2007   [Refereed]
Fully convex drawings of clustered planar graphs
S.-H. Hong, Hiroshi Nagamochi,
2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 32-39.      2007   [Refereed]
An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems,
T. Imamichi, Hiroshi Nagamochi
2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 72-79.      2007   [Refereed]
Enumerating tree-like chemical structures from feature vector
H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun,
2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 48-55      2007   [Refereed]
A multi-sphere scheme for 2D and 3D packing problems
T. Imamichi, Hiroshi Nagamochi
Stochastic local search (SLS) algorithms      2007   [Refereed]
A path relinking approach for the multi-resource generalized assignment problem
M. Yagiura, A. Komiya, K. Kojima, K. Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, F. Glover,
Stochastic local search (SLS) algorithms      2007   [Refereed]
Star-shaped drawings of planar graphs
S.-H. Hong, Hiroshi Nagamochi,
18th International Workshop on Combinatorial Algorithms,      2007   [Refereed]
Minimum degree orderings,
Hiroshi Nagamochi,
The 18th International Symposium on Algorithms and Computation (ISAAC 2007)      2007   [Refereed]
Rent-or-buy scheduling and cost coloring problems
T. Fukunaga, M. Halldorsson, Hiroshi Nagamochi,
Foundations of Software Technology and Theoretical Computer Science,FSTTCS 2007,      2007   [Refereed]
Robust cost colorings
T. Fukunaga; M.M. Halldórsson; H. Nagamochi
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms   1204-1212   2008   [Refereed]
M. Sasaki; L. Zhao; H. Nagamochi
2008 11th IEEE Singapore International Conference on Communication Systems, ICCS 2008   527-531   2008   [Refereed]
T. Imamichi; H. Nagamochi
Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008   125-130   2008   [Refereed]
Overlap removal in label layouts by a multi-sphere scheme,
Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi
the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008)      2008   [Refereed]
Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion
K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi,
the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008)      2008   [Refereed]
Approximating the generalized capacitated tree-routing
E. Morsy, Hiroshi Nagamochi
The 14th Annual International Computing and Combinatorics Conference (COCOON 2008)      2008   [Refereed]
A* algorithm for the time-dependent shortest path problem
L. Zhao, T. Ohshima, Hiroshi Nagamochi
The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08)pp. 36-43.      2008   [Refereed]
A fast collision detection algorithm for a multi-sphere scheme
T. Imamichi, Hiroshi Nagamochi
The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp. 173-180.      2008   [Refereed]
Improved algorithm for enumerating tree-likee chemical graphs,
Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu
The 19th International Conference on Genome Informatics (GIW2008)      2008   [Refereed]
Efficient algorithms for combinatorial food packing problems
Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG
Proc. of the 11th International Conference on Humans and Computers (HC'2008), pp. 317-322      2008   [Refereed]
K. Haraguchi; S.-H. Hong; H. Nagamochi
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   5792 LNCS 46-60   2009   [Refereed]
T. Imada; S. Ota; H. Nagamochi; T. Akutsu
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   5878 LNCS 14-23   2009   [Refereed]
J. Wang; J. Gim; M. Sasaki; L. Zhao; H. Nagamochi
Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009      2009   [Refereed]

Books etc

 
Algorithmic Aspects of Graph Connectivities
Hiroshi Nagamochi, Toshihide Ibaraki
Encyclopedia of Mathematics and Its Applications, Cambridge University Press   2008   

Research Grants & Projects

 
Development of Efficient Algorithms for Network Problems
Project Year: 1988   
Algorithms for Discrete optimization