Liang Zhao

45 papers A 1B 2C 3Journal 25Unranked 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
A unified approach to inferring chemical compounds with the desired aqueous solubility.
J. Cheminformatics
Muniba Batool, Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2025 J jnl
Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2025 J jnl
Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference.
J. Cheminformatics
Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2025 J jnl
Towards Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming.
CoRR
Jianshen Zhu, Mao Takekida, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2024 J jnl
A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility.
CoRR
Muniba Batool, Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 — conf
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference.
BIBM
Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference.
CoRR
Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2023 — conf
A Spatial Connection Aware Complex Network Model for Real-World Social Networks.
ICIT
Wenruo Lyu, Liang Zhao
2023 C conf
Attentive Cross-Domain Few-shot Learning and Domain Adaptation in HSI Classification.
TENCON
Rojan Basnet, Rimsa Goperma, Liang Zhao
2023 — conf
De novo Drug Design against SARS-CoV-2 Protein Targets using SMILES-based Deep Reinforcement Learning.
ICIT
Xiuyuan Hu, Yanghepu Li, Guoqing Liu, Yang Zhao, Hao Zhang, Liang Zhao
2023 J jnl
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2023 — conf
Pyramid as a Core Structure in Social Networks.
COMPLEX NETWORKS (2)
Wenruo Lyu, Liang Zhao
2022 — conf
A Method for Molecular Design Based on Linear Regression and Integer Programming.
ICBBB
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
CoRR
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
Algorithms Mol. Biol.
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.
IEA/AIE (1)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
An Inverse QSAR Method Based on Decision Tree and Integer Programming.
ICIC (2)
Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
An Inverse QSAR Method Based on Linear Regression and Integer Programming.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
BIBM
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
CoRR
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming.
CoRR
Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2017 — conf
A Study on Variable Control of Sound Vibration Form (SVF) for Media Art Creation.
Culture Computing
Yunian Pang, Liang Zhao, Ryohei Nakatsu, Naoko Tosa
2017 — conf
A practical system for optimized assignment of shelters to evacuees.
IHTC
Liang Zhao
2017 — conf
Creation of Media Art Utilizing Fluid Dynamics.
Culture Computing
Naoko Tosa, Ryohei Nakatsu, Yunian Pang, Liang Zhao
2017 C conf
Genesis: New Media Art Created as a Visualization of Fluid Dynamics.
ICEC
Naoko Tosa, Yunian Pang, Liang Zhao, Ryohei Nakatsu
2013 — conf
A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs.
ICA3PP (2)
Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner
2013 J jnl
An Adaptive Fairness and Throughput Control Approach for Resource Scheduling in Multiuser Wireless Networks.
IEICE Trans. Commun.
Lin Shan, Sonia Aïssa, Hidekazu Murata, Susumu Yoshida, Liang Zhao
2010 — conf
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.
CGGA
Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi
2010 J jnl
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut.
J. Chem. Inf. Model.
Yusuke Ishida, Yuki Kato, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2008 J jnl
Enumerating Treelike Chemical Graphs with Given Path Frequency.
J. Chem. Inf. Model.
Hiroki Fujiwara, Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2007 C conf
An Efficient Algorithm for Generating Colored Outerplanar Graphs.
TAMC
Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2007 — conf
Linear-tree rule structure for firewall optimization.
Communications, Internet, and Information Technology
Liang Zhao, A. Shimae, Hiroshi Nagamochi
2006 J jnl
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
Discret. Appl. Math.
Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
2005 J jnl
Greedy splitting algorithms for approximating multiway partition problems.
Math. Program.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2004 J jnl
On generalized greedy splitting algorithms for multiway partition problems.
Discret. Appl. Math.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 J jnl
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 J jnl
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 A conf
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
STACS
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 B conf
A Unified Framework for Approximating Multiway Partition Problems.
ISAAC
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 J jnl
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
J. Comb. Optim.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
1999 B conf
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
ISAAC
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki