A Unified Framework for Approximating Multiway Partition Problems. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (ISAAC, 2001)

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (STACS, 2001)

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (J. Comb. Optim., 2001)

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 2003)

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Inf. Process. Lett., 2003)

On generalized greedy splitting algorithms for multiway partition problems. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Discret. Appl. Math., 2004)

Greedy splitting algorithms for approximating multiway partition problems. - Liang Zhao 013; Hiroshi Nagamochi; Toshihide Ibaraki (Math. Program., 2005)

Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. - Keizo Miyata; Shigeru Masuyama; Shin-ichi Nakayama; Liang Zhao 013 (Discret. Appl. Math., 2006)

Linear-tree rule structure for firewall optimization. - Liang Zhao 013; A. Shimae; Hiroshi Nagamochi (Communications, Internet, and Information Technology, 2007)

An Efficient Algorithm for Generating Colored Outerplanar Graphs. - Jiexun Wang; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (TAMC, 2007)

Enumerating Treelike Chemical Graphs with Given Path Frequency. - Hiroki Fujiwara; Jiexun Wang; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (J. Chem. Inf. Model., 2008)

An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. - Tatsuya Ohshima; Pipaporn Eumthurapojn; Liang Zhao 013; Hiroshi Nagamochi (CGGA, 2010)

Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut. - Yusuke Ishida; Yuki Kato; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (J. Chem. Inf. Model., 2010)

A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs. - Liang Zhao 013; Hiroshi Kadowaki; Dorothea Wagner (ICA3PP (2), 2013)

An Adaptive Fairness and Throughput Control Approach for Resource Scheduling in Multiuser Wireless Networks. - Lin Shan; Sonia Aïssa; Hidekazu Murata; Susumu Yoshida; Liang Zhao 013 (IEICE Trans. Commun., 2013)

A Study on Variable Control of Sound Vibration Form (SVF) for Media Art Creation. - Yunian Pang; Liang Zhao 013; Ryohei Nakatsu; Naoko Tosa (Culture Computing, 2017)

Creation of Media Art Utilizing Fluid Dynamics. - Naoko Tosa; Ryohei Nakatsu; Yunian Pang; Liang Zhao 013 (Culture Computing, 2017)

A practical system for optimized assignment of shelters to evacuees. - Liang Zhao 013 (IHTC, 2017)

Genesis: New Media Art Created as a Visualization of Fluid Dynamics. - Naoko Tosa; Yunian Pang; Liang Zhao 013; Ryohei Nakatsu (ICEC, 2017)

γk(n) = max {⌊n/(2k+1)⌋, 1} for Maximal Outerplanar Graphs with n mod (2k+1) ≤ 6. - Liang Zhao 013 (J. Inf. Process., 2017)

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. - Naveed Ahmed Azam; Jianshen Zhu; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (BIBM, 2021)

An Inverse QSAR Method Based on Decision Tree and Integer Programming. - Kouki Tanaka; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (ICIC (2), 2021)

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEA/AIE (1), 2021)

A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. - Naveed Ahmed Azam; Jianshen Zhu; Yanming Sun; Yu Shi; Aleksandar Shurbevski; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (Algorithms Mol. Biol., 2021)

An Inverse QSAR Method Based on Linear Regression and Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2021)

A Method for Molecular Design Based on Linear Regression and Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (ICBBB, 2022)

Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. - Jianshen Zhu; Naveed Ahmed Azam; Shengjuan Cao; Ryota Ido; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2022)

A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Fan Zhang; Aleksandar Shurbevski; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Pyramid as a Core Structure in Social Networks. - Wenruo Lyu; Liang Zhao 013 (COMPLEX NETWORKS (2), 2023)

De novo Drug Design against SARS-CoV-2 Protein Targets using SMILES-based Deep Reinforcement Learning. - Xiuyuan Hu; Yanghepu Li; Guoqing Liu; Yang Zhao 016; Hao Zhang 005; Liang Zhao 013 (ICIT, 2023)

A Spatial Connection Aware Complex Network Model for Real-World Social Networks. - Wenruo Lyu; Liang Zhao 013 (ICIT, 2023)

Attentive Cross-Domain Few-shot Learning and Domain Adaptation in HSI Classification. - Rojan Basnet; Rimsa Goperma; Liang Zhao 013 (TENCON, 2023)

Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference. - Bowen Song; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (BIBM, 2024)

A Method for Inferring Polymers Based on Linear Regression and Integer Programming. - Ryota Ido; Shengjuan Cao; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)

Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)

Towards Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming. - Jianshen Zhu; Mao Takekida; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (CoRR, 2025)

Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (CoRR, 2025)

A unified approach to inferring chemical compounds with the desired aqueous solubility. - Muniba Batool; Naveed Ahmed Azam; Jianshen Zhu; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (J. Cheminformatics, 2025)

Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference. - Bowen Song; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (J. Cheminformatics, 2025)