Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Nagamochi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i19]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. CoRR abs/2305.00801 (2023)- 2022
- [j176]Kazuya Haraguchi
, Hiroshi Nagamochi:
Enumeration of Support-Closed Subsets in Confluent Systems. Algorithmica 84(5): 1279-1315 (2022) - [j175]Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming. Appl. Intell. 52(15): 17058-17072 (2022) - [j174]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the enumeration of minimal non-pairwise compatibility graphs. J. Comb. Optim. 44(4): 2871-2892 (2022) - [j173]Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3233-3245 (2022) - [c116]Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu:
Adjustive Linear Regression and Its Application to the Inverse QSAR. BIOINFORMATICS 2022: 144-151 - [i18]Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. CoRR abs/2209.13527 (2022) - 2021
- [j172]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. Algorithms Mol. Biol. 16(1): 18 (2021) - [j171]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret. Appl. Math. 303: 171-185 (2021) - [j170]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-plane graph for a straight-line drawing in linear time. Theor. Comput. Sci. 892: 132-154 (2021) - [c115]Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. BIBM 2021: 360-363 - [c114]Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Inverse QSAR Method Based on Decision Tree and Integer Programming. ICIC (2) 2021: 628-644 - [c113]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. IEA/AIE (1) 2021: 197-209 - [i17]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Inverse QSAR Method Based on Linear Regression and Integer Programming. CoRR abs/2107.02381 (2021) - [i16]Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. CoRR abs/2108.10266 (2021) - [i15]Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for Inferring Polymers Based on Linear Regression and Integer Programming. CoRR abs/2109.02628 (2021) - 2020
- [j169]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. Algorithmica 82(10): 3066-3090 (2020) - [j168]Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. Algorithms 13(5): 124 (2020) - [j167]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Entropy 22(9): 923 (2020) - [j166]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. Entropy 22(11): 1295 (2020) - [j165]Mingyu Xiao, Hiroshi Nagamochi:
Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153 (2020) - [j164]Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi:
Group Strategy-proof Mechanisms for Shuttle Facility Games. J. Inf. Process. 28: 976-986 (2020) - [c112]Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. BIOINFORMATICS 2020: 101-108 - [c111]Seok-Hee Hong, Hiroshi Nagamochi:
Path-Monotonic Upward Drawings of Graphs. COCOON 2020: 110-122 - [c110]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. COCOON 2020: 372-383 - [c109]Fan Zhang, Jianshen Zhu, Rachaya Chiewvanichakorn, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees. IEA/AIE 2020: 433-444 - [i14]Kazuya Haraguchi, Hiroshi Nagamochi:
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. CoRR abs/2004.01904 (2020) - [i13]Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. CoRR abs/2004.06367 (2020) - [i12]Kazuya Haraguchi, Hiroshi Nagamochi:
Polynomial-delay Enumeration Algorithms in Set Systems. CoRR abs/2004.07823 (2020) - [i11]Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. CoRR abs/2004.08381 (2020) - [i10]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming. CoRR abs/2009.09646 (2020) - [i9]Tatsuya Akutsu, Hiroshi Nagamochi:
A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming. CoRR abs/2010.09203 (2020) - [i8]Mingyu Xiao, Hiroshi Nagamochi:
Bounded-Degree Cut is Fixed-Parameter Tractable. CoRR abs/2012.14174 (2020)
2010 – 2019
- 2019
- [j163]Seok-Hee Hong, Hiroshi Nagamochi:
A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255: 234-257 (2019) - [j162]Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades:
Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 994-1001 (2019) - [j161]Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi:
λ-Group Strategy-Proof Mechanisms for the Obnoxious Facility Game in Star Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1179-1186 (2019) - [j160]Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi:
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. J. Graph Algorithms Appl. 23(2): 434-458 (2019) - [j159]Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 77-90 (2019) - [c108]Kazuya Haraguchi, Hiroshi Nagamochi:
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. ISAAC 2019: 3:1-3:15 - 2018
- [j158]Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi:
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. IEICE Trans. Inf. Syst. 101-D(3): 611-612 (2018) - [j157]Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi:
The Stable Roommates Problem with Unranked Entries. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1412-1419 (2018) - [j156]Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 633-646 (2018) - [j155]Seok-Hee Hong, Hiroshi Nagamochi:
Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725: 79-98 (2018) - [c107]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. COCOON 2018: 504-515 - [c106]Mingyu Xiao, Hiroshi Nagamochi:
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. ICALP 2018: 112:1-112:6 - [p1]Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi:
Practical Algorithms for Two-Dimensional Packing of Rectangles. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 571-583 - [i7]Mingyu Xiao, Hiroshi Nagamochi:
Some Reduction Operations to Pairwise Compatibility Graphs. CoRR abs/1804.02887 (2018) - [i6]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. CoRR abs/1804.02895 (2018) - 2017
- [j154]Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for maximum independent set. Inf. Comput. 255: 126-146 (2017) - [j153]Ken Iwaide, Hiroshi Nagamochi:
An Exact Algorithm for Lowest Edge Dominating Set. IEICE Trans. Inf. Syst. 100-D(3): 414-421 (2017) - [j152]Mingyu Xiao, Hiroshi Nagamochi:
A refined algorithm for maximum independent set in degree-4 graphs. J. Comb. Optim. 34(3): 830-873 (2017) - [j151]Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. J. Graph Algorithms Appl. 21(3): 247-263 (2017) - [j150]Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi:
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. J. Inf. Process. 25: 639-654 (2017) - [j149]Mohd Shahrizan Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi:
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. J. Inf. Process. 25: 655-666 (2017) - [j148]Mingyu Xiao, Hiroshi Nagamochi:
Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659: 72-82 (2017) - 2016
- [j147]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. Algorithmica 74(2): 713-741 (2016) - [j146]Mingyu Xiao, Hiroshi Nagamochi:
An exact algorithm for maximum independent set in degree-5 graphs. Discret. Appl. Math. 199: 137-155 (2016) - [j145]Morito Oomine, Hiroshi Nagamochi:
Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees. IEICE Trans. Inf. Syst. 99-D(3): 615-623 (2016) - [j144]Ken Iwaide, Hiroshi Nagamochi:
An Improved Algorithm for Parameterized Edge Dominating Set Problem. J. Graph Algorithms Appl. 20(1): 23-58 (2016) - [j143]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory Comput. Syst. 58(2): 241-272 (2016) - [c105]Fei He, Akiyoshi Hanai, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. BIOINFORMATICS 2016: 258-265 - [c104]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. GD 2016: 321-334 - [c103]Mingyu Xiao, Hiroshi Nagamochi:
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. ISAAC 2016: 62:1-62:12 - [c102]Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. WALCOM 2016: 286-297 - [i5]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time. CoRR abs/1608.07662 (2016) - [i4]Mingyu Xiao, Hiroshi Nagamochi:
A Linear-time Algorithm for Integral Multiterminal Flows in Trees. CoRR abs/1611.08803 (2016) - 2015
- [j142]Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for dominating induced matching based on graph partition. Discret. Appl. Math. 190-191: 147-162 (2015) - [j141]Masataka Ikeda, Hiroshi Nagamochi:
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs. IEICE Trans. Inf. Syst. 98-D(3): 503-511 (2015) - [j140]Mingyu Xiao, Hiroshi Nagamochi:
An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim. 30(2): 214-241 (2015) - [c101]Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi:
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. JCDCGG 2015: 228-240 - [c100]Ken Iwaide, Hiroshi Nagamochi:
An Improved Algorithm for Parameterized Edge Dominating Set Problem. WALCOM 2015: 234-245 - [c99]Seok-Hee Hong, Hiroshi Nagamochi:
Testing Full Outer-2-planarity in Linear Time. WG 2015: 406-421 - 2014
- [j139]Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu:
Efficient enumeration of monocyclic chemical graphs with given path frequencies. J. Cheminformatics 6(1): 31 (2014) - [j138]Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi:
Unranking of small combinations from large sets. J. Discrete Algorithms 29: 8-20 (2014) - [j137]Mingyu Xiao, Hiroshi Nagamochi:
A refined exact algorithm for Edge Dominating Set. Theor. Comput. Sci. 560: 207-216 (2014) - [c98]Seok-Hee Hong, Hiroshi Nagamochi:
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. COCOON 2014: 477-488 - [c97]Mingyu Xiao, Hiroshi Nagamochi:
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. ISAAC 2014: 429-440 - [c96]Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno:
Approximating the Bipartite TSP and Its Biased Generalization. WALCOM 2014: 56-67 - [i3]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Dominating Induced Matching Based on Graph Partition. CoRR abs/1408.6196 (2014) - 2013
- [j136]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. IEICE Trans. Inf. Syst. 96-D(3): 408-418 (2013) - [j135]Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno:
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. IEICE Trans. Inf. Syst. 96-D(3): 450-456 (2013) - [j134]Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu:
Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds. J. Bioinform. Comput. Biol. 11(6) (2013) - [j133]Mingyu Xiao, Hiroshi Nagamochi:
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469: 92-104 (2013) - [j132]Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTASs for trimming weighted trees. Theor. Comput. Sci. 469: 105-118 (2013) - [j131]Mingyu Xiao, Hiroshi Nagamochi:
Parameterized edge dominating set in graphs with degree bounded by 3. Theor. Comput. Sci. 508: 2-15 (2013) - [c95]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. FAW-AAIM 2013: 72-83 - [c94]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for Undirected Feedback Vertex Set. COCOA 2013: 153-164 - [c93]Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi:
Optimization Techniques for Robot Path Planning. ICT Innovations 2013: 111-120 - [c92]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. ISAAC 2013: 328-338 - [c91]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. TAMC 2013: 96-107 - [i2]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. CoRR abs/1312.6260 (2013) - 2012
- [j130]Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi:
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Algorithmica 62(3-4): 787-806 (2012) - [j129]Seok-Hee Hong, Hiroshi Nagamochi:
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Algorithmica 62(3-4): 1122-1158 (2012) - [j128]Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi:
An exact strip packing algorithm based on canonical forms. Comput. Oper. Res. 39(12): 2991-3011 (2012) - [j127]Tomoki Imada, Hiroshi Nagamochi:
Indexing All Rooted Subgraphs of a Rooted Graph. IEICE Trans. Inf. Syst. 95-D(3): 712-721 (2012) - [j126]Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya Akutsu:
Protein complex prediction via improved verification methods using constrained domain-domain matching. Int. J. Bioinform. Res. Appl. 8(3/4): 210-227 (2012) - [j125]Mingyu Xiao, Hiroshi Nagamochi:
An FPT algorithm for edge subset feedback edge set. Inf. Process. Lett. 112(1-2): 5-9 (2012) - [j124]Seok-Hee Hong, Hiroshi Nagamochi:
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Theor. Comput. Sci. 445: 36-51 (2012) - [c90]Cong Zhang, Hiroshi Nagamochi:
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. CATS 2012: 13-20 - [c89]Ken Ibara, Hiroshi Nagamochi:
Characterizing Mechanisms in Obnoxious Facility Game. COCOA 2012: 301-311 - [c88]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Degree-4 Graphs. COCOON 2012: 74-85 - [c87]Hiroshi Nagamochi:
Linear Layouts in Submodular Systems. ISAAC 2012: 475-484 - [c86]Mingyu Xiao, Hiroshi Nagamochi:
A Refined Exact Algorithm for Edge Dominating Set. TAMC 2012: 360-372 - [c85]Hiroshi Nagamochi:
Submodular Minimization via Pathwidth. TAMC 2012: 584-593 - [i1]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. CoRR abs/1212.6831 (2012) - 2011
- [j123]Seok-Hee Hong, Hiroshi Nagamochi:
Editorial: ISAAC 2008 Special Issue. Algorithmica 61(4): 777-778 (2011) - [j122]Seok-Hee Hong, Hiroshi Nagamochi:
Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica 61(4): 1022-1076 (2011) - [j121]Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC Bioinform. 12(S-14): S3 (2011) - [j120]Bingbing Zhuang, Hiroshi Nagamochi:
Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. IEICE Trans. Inf. Syst. 94-D(2): 200-210 (2011) - [j119]Bingbing Zhuang, Hiroshi Nagamochi:
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. IEICE Trans. Inf. Syst. 94-D(2): 211-219 (2011) - [j118]Tatsuya Akutsu, Hiroshi Nagamochi:
Kernel Methods for Chemical Compounds: From Classification to Design. IEICE Trans. Inf. Syst. 94-D(10): 1846-1853 (2011) - [j117]Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang:
Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems. Int. J. Biom. 3(3): 228-245 (2011) - [j116]Seok-Hee Hong, Hiroshi Nagamochi:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 21(3): 251-252 (2011) - [j115]Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi:
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Int. J. Comput. Geom. Appl. 21(6): 661-684 (2011) - [j114]Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski:
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. J. Adv. Comput. Intell. Intell. Informatics 15(8): 1103-1108 (2011) - [j113]Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu:
Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming. J. Chem. Inf. Model. 51(11): 2788-2807 (2011) - [j112]Ehab Morsy, Hiroshi Nagamochi:
Approximating capacitated tree-routings in networks. J. Comb. Optim. 21(2): 254-267 (2011) - [j111]Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. 15(3): 345-371 (2011) - [j110]