Liang Zhao

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 17

Top Topics

Integer Programming

Artificial Neural Networks

Resource Scheduling

Top Venues

Culture Computing

Publications

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)
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, 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)
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)
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, 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)
Liang Zhao
+1) ≤ 6. J. Inf. Process. 25 (2017)
Naoko Tosa, Yunian Pang, Liang Zhao, Ryohei Nakatsu
Genesis: New Media Art Created as a Visualization of Fluid Dynamics. ICEC (2017)
Liang Zhao
A practical system for optimized assignment of shelters to evacuees. IHTC (2017)
Naoko Tosa, Ryohei Nakatsu, Yunian Pang, Liang Zhao
Creation of Media Art Utilizing Fluid Dynamics. Culture Computing (2017)
Yunian Pang, Liang Zhao, Ryohei Nakatsu, Naoko Tosa
A Study on Variable Control of Sound Vibration Form (SVF) for Media Art Creation. Culture Computing (2017)
Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner
A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs. ICA3PP (2) (2013)
Lin Shan, Sonia Aïssa, Hidekazu Murata, Susumu Yoshida, Liang Zhao
An Adaptive Fairness and Throughput Control Approach for Resource Scheduling in Multiuser Wireless Networks. IEICE Trans. Commun. (2) (2013)
Yusuke Ishida, Yuki Kato, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut. J. Chem. Inf. Model. 50 (5) (2010)
Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. CGGA (2010)
Hiroki Fujiwara, Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
Enumerating Treelike Chemical Graphs with Given Path Frequency. J. Chem. Inf. Model. 48 (7) (2008)
Liang Zhao, A. Shimae, Hiroshi Nagamochi
Linear-tree rule structure for firewall optimization. Communications, Internet, and Information Technology (2007)
Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
An Efficient Algorithm for Generating Colored Outerplanar Graphs. TAMC (2007)
Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. Discret. Appl. Math. 154 (16) (2006)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102 (1) (2005)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
On generalized greedy splitting algorithms for multiway partition problems. Discret. Appl. Math. 143 (1-3) (2004)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discret. Appl. Math. 126 (2-3) (2003)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. Inf. Process. Lett. 86 (2) (2003)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS (2001)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
A Unified Framework for Approximating Multiway Partition Problems. ISAAC (2001)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5 (4) (2001)
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ISAAC (1999)