Hiroshi Nagamochi

ORCID

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 69

Top Venues

CoRR

Theor. Comput. Sci.

IEICE Trans. Inf. Syst.

Discret. Appl. Math.

Publications

Kazuya Haraguchi, Hiroshi Nagamochi
Polynomial-delay enumeration algorithms in set systems. Theor. Comput. Sci. 963 (2023)
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 (2023)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
On the enumeration of minimal non-pairwise compatibility graphs. J. Comb. Optim. 44 (4) (2022)
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 (2022)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
A Method for Molecular Design Based on Linear Regression and Integer Programming. ICBBB (2022)
Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu
Adjustive Linear Regression and Its Application to the Inverse QSAR. BIOINFORMATICS (2022)
Kazuya Haraguchi, Hiroshi Nagamochi
Enumeration of Support-Closed Subsets in Confluent Systems. Algorithmica 84 (5) (2022)
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) (2022)
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) (2022)
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) (2021)
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)
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)
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)
Seok-Hee Hong, Hiroshi Nagamochi
Re-embedding a 1-plane graph for a straight-line drawing in linear time. Theor. Comput. Sci. 892 (2021)
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 (2021)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret. Appl. Math. 303 (2021)
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 (2021)
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 (2021)
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)
Seok-Hee Hong, Hiroshi Nagamochi
Path-Monotonic Upward Drawings of Graphs. COCOON (2020)
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 (2020)
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 (2020)
Kazuya Haraguchi, Hiroshi Nagamochi
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. CoRR (2020)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. COCOON (2020)
Kazuya Haraguchi, Hiroshi Nagamochi
Polynomial-delay Enumeration Algorithms in Set Systems. CoRR (2020)
Mingyu Xiao, Hiroshi Nagamochi
Bounded-Degree Cut is Fixed-Parameter Tractable. CoRR (2020)
Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming. ICBBB (2020)
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. Entropy 22 (11) (2020)
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi
Group Strategy-proof Mechanisms for Shuttle Facility Games. J. Inf. Process. 28 (2020)
Tatsuya Akutsu, Hiroshi Nagamochi
A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming. CoRR (2020)
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)
Mingyu Xiao, Hiroshi Nagamochi
Characterizing Star-PCGs. Algorithmica 82 (10) (2020)
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) (2020)
Mingyu Xiao, Hiroshi Nagamochi
Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153 (2020)
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) (2020)
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 (2020)
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) (2019)
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) (2019)
Kazuya Haraguchi, Hiroshi Nagamochi
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. ISAAC (2019)
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
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. (9) (2019)
Seok-Hee Hong, Hiroshi Nagamochi
A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255 (2019)
Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu
Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (2) (2018)
Yuui Tamura, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu
Enumerating Chemical Mono-Block 3-Augmented Trees with Two Junctions. ICBBB (2018)
Mingyu Xiao, Hiroshi Nagamochi
Characterizing Star-PCGs. COCOON (2018)
Seok-Hee Hong, Hiroshi Nagamochi
Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725 (2018)
Mohd Shahrizan Othman, Aleksandar Shurbevski, Hiroshi Nagamochi
Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. IEICE Trans. Inf. Syst. (3) (2018)
Mingyu Xiao, Hiroshi Nagamochi
Some Reduction Operations to Pairwise Compatibility Graphs. CoRR (2018)
Mingyu Xiao, Hiroshi Nagamochi
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. ICALP (2018)
Hiroaki Suto, Aleksandar Shurbevski, Hiroshi Nagamochi
The Stable Roommates Problem with Unranked Entries. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Mingyu Xiao, Hiroshi Nagamochi
Characterizing Star-PCGs. CoRR (2018)
Ken Iwaide, Hiroshi Nagamochi
An Exact Algorithm for Lowest Edge Dominating Set. IEICE Trans. Inf. Syst. (3) (2017)
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. J. Inf. Process. 25 (2017)
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. J. Graph Algorithms Appl. 21 (3) (2017)
Mingyu Xiao, Hiroshi Nagamochi
Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659 (2017)
Mingyu Xiao, Hiroshi Nagamochi
Exact algorithms for maximum independent set. Inf. Comput. 255 (2017)
Mingyu Xiao, Hiroshi Nagamochi
A refined algorithm for maximum independent set in degree-4 graphs. J. Comb. Optim. 34 (3) (2017)
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 (2017)
Mingyu Xiao, Hiroshi Nagamochi
An exact algorithm for maximum independent set in degree-5 graphs. Discret. Appl. Math. 199 (2016)
Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. WALCOM (2016)
Mingyu Xiao, Hiroshi Nagamochi
A Linear-time Algorithm for Integral Multiterminal Flows in Trees. CoRR (2016)
Fei He, Akiyoshi Hanai, Hiroshi Nagamochi, Tatsuya Akutsu
Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. BIOINFORMATICS (2016)
Morito Oomine, Hiroshi Nagamochi
Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees. IEICE Trans. Inf. Syst. (3) (2016)
Mingyu Xiao, Hiroshi Nagamochi
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. Algorithmica 74 (2) (2016)
Seok-Hee Hong, Hiroshi Nagamochi
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. Graph Drawing (2016)
Mingyu Xiao, Hiroshi Nagamochi
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. ISAAC (2016)
Mingyu Xiao, Hiroshi Nagamochi
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory Comput. Syst. 58 (2) (2016)
Ken Iwaide, Hiroshi Nagamochi
An Improved Algorithm for Parameterized Edge Dominating Set Problem. J. Graph Algorithms Appl. 20 (1) (2016)
Seok-Hee Hong, Hiroshi Nagamochi
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time. CoRR (2016)
Seok-Hee Hong, Hiroshi Nagamochi
Testing Full Outer-2-planarity in Linear Time. WG (2015)
Norhazwani Md Yunos, Aleksandar Shurbevski, Hiroshi Nagamochi
A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. JCDCGG (2015)
Mingyu Xiao, Hiroshi Nagamochi
Exact algorithms for dominating induced matching based on graph partition. Discret. Appl. Math. (2015)
Masataka Ikeda, Hiroshi Nagamochi
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs. IEICE Trans. Inf. Syst. (3) (2015)
Mingyu Xiao, Hiroshi Nagamochi
An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim. 30 (2) (2015)
Ken Iwaide, Hiroshi Nagamochi
An Improved Algorithm for Parameterized Edge Dominating Set Problem. WALCOM (2015)
Mingyu Xiao, Hiroshi Nagamochi
A refined exact algorithm for Edge Dominating Set. Theor. Comput. Sci. 560 (2014)
Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu
Efficient enumeration of monocyclic chemical graphs with given path frequencies. J. Cheminformatics 6 (1) (2014)
Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi
Unranking of small combinations from large sets. J. Discrete Algorithms 29 (2014)
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
Approximating the Bipartite TSP and Its Biased Generalization. WALCOM (2014)
Mingyu Xiao, Hiroshi Nagamochi
Exact Algorithms for Dominating Induced Matching Based on Graph Partition. CoRR (2014)
Mingyu Xiao, Hiroshi Nagamochi
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. ISAAC (2014)
Seok-Hee Hong, Hiroshi Nagamochi
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. COCOON (2014)
Mingyu Xiao, Hiroshi Nagamochi
Exact Algorithms for Maximum Independent Set. ISAAC (2013)
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
FPTASs for trimming weighted trees. Theor. Comput. Sci. 469 (2013)
Mingyu Xiao, Hiroshi Nagamochi
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. FAW-AAIM (2013)
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)
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems. IEICE Trans. Inf. Syst. (3) (2013)
Mingyu Xiao, Hiroshi Nagamochi
An Improved Exact Algorithm for Undirected Feedback Vertex Set. COCOA (2013)
Mingyu Xiao, Hiroshi Nagamochi
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469 (2013)
Mingyu Xiao, Hiroshi Nagamochi
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. TAMC (2013)
Mingyu Xiao, Hiroshi Nagamochi
Parameterized edge dominating set in graphs with degree bounded by 3. Theor. Comput. Sci. 508 (2013)
Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi
Optimization Techniques for Robot Path Planning. ICT Innovations (2013)
Mingyu Xiao, Hiroshi Nagamochi
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. IEICE Trans. Inf. Syst. (3) (2013)
Mingyu Xiao, Hiroshi Nagamochi
Exact Algorithms for Maximum Independent Set. CoRR (2013)
Hiroshi Nagamochi
Submodular Minimization via Pathwidth. TAMC (2012)
Tomoki Imada, Hiroshi Nagamochi
Indexing All Rooted Subgraphs of a Rooted Graph. IEICE Trans. Inf. Syst. (3) (2012)
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) (2012)
Hiroshi Nagamochi
Linear Layouts in Submodular Systems. ISAAC (2012)
Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi
An exact strip packing algorithm based on canonical forms. Comput. Oper. Res. 39 (12) (2012)
Mingyu Xiao, Hiroshi Nagamochi
A Refined Exact Algorithm for Edge Dominating Set. TAMC (2012)

Hiroshi Nagamochi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hiroshi Nagamochi