default search action
Liang Zhao 0013
Person information
- affiliation: Kyoto University, Japan
Other persons with the same name
- Liang Zhao — disambiguation page
- Liang Zhao 0001 — University of São Paulo, Institute of Mathematics and Computer Science, SP, Brazil (and 1 more)
- Liang Zhao 0002 — Emory University, Atlanta, GA, USA (and 2 more)
- Liang Zhao 0003 — University of Technology Sydney, Centre for Autonomous Systems, Faculty of Engineering and Information Technology, NSW, Australia (and 2 more)
- Liang Zhao 0004 — Shenyang Aerospace University, School of Computer Science, China (and 1 more)
- Liang Zhao 0005 — Dalian University of Technology, School of Software Technology, China
- Liang Zhao 0006 — Baidu Research, Institute of Deep Learning, Sunnyvale, CA, USA
- Liang Zhao 0007 — Harbin Institute of Technology, Department of Computer Science and Technology, China
- Liang Zhao 0008 — Huazhong University of Science and Technology, School of Automation, Wuhan, China
- Liang Zhao 0009 — National ICT Australia, Sydney, NSW, Australia (and 1 more)
- Liang Zhao 0010 — Yangtze Normal University, School of Civil and Architectural Engineering, Chongqing, China (and 1 more)
- Liang Zhao 0011 — Beijing Normal University, Faculty of Geographical Science, China
- Liang Zhao 0012 — Guangxi University of Finance and Economics, College of Information and Statistics, Nanning, China
- Liang Zhao 0014 — Central China Normal University, Wuhan, China
- Liang Zhao 0015 — Dalian University of Technology, Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education, Dalian, China
- Liang Zhao 0016 — Central China Normal University, CCNU, National Engineering Research Center for Educational Big Data, NERC-EBD, Wuhan, China
- Liang Zhao 0017 — Fudan University, School of Basic Medical Sciences, Shanghai, China
- Liang Zhao 0018 — SenseTime Research, Shanghai, China
- Liang Zhao 0019 — Nanjing University, China
- Liang Zhao 0020 — Sichuan University, School of Cyber Science and Engineering, Chengdu, China
- Liang Zhao 0021 — Xidian University, Xi'an, Shaanxi, China
- Liang Zhao 0022 — Macao Polytechnic Institute, Macau, China (and 2 more)
- Liang Zhao 0023 — Xi'an Jiaotong University, Institute of Social Psychology, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu:
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference. CoRR abs/2408.05136 (2024) - 2023
- [c19]Wenruo Lyu, Liang Zhao:
Pyramid as a Core Structure in Social Networks. COMPLEX NETWORKS (2) 2023: 82-94 - [c18]Wenruo Lyu, Liang Zhao:
A Spatial Connection Aware Complex Network Model for Real-World Social Networks. ICIT 2023: 155-160 - [c17]Xiuyuan Hu, Yanghepu Li, Guoqing Liu, Yang Zhao, Hao Zhang, Liang Zhao:
De novo Drug Design against SARS-CoV-2 Protein Targets using SMILES-based Deep Reinforcement Learning. ICIT 2023: 161-166 - [c16]Rojan Basnet, Rimsa Goperma, Liang Zhao:
Attentive Cross-Domain Few-shot Learning and Domain Adaptation in HSI Classification. TENCON 2023: 220-225 - [i6]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
- [j12]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) - [c15]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: 21-28 - [i5]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
- [j11]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) - [c14]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 - [c13]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 - [c12]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 - [i4]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) - [i3]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) - [i2]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
- [i1]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)
2010 – 2019
- 2017
- [j10]Liang Zhao:
γk(n) = max {⌊n/(2k+1)⌋, 1} for Maximal Outerplanar Graphs with n mod (2k+1) ≤ 6. J. Inf. Process. 25: 621-626 (2017) - [c11]Naoko Tosa, Ryohei Nakatsu, Yunian Pang, Liang Zhao:
Creation of Media Art Utilizing Fluid Dynamics. Culture Computing 2017: 129-135 - [c10]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: 136-142 - [c9]Liang Zhao:
A practical system for optimized assignment of shelters to evacuees. IHTC 2017: 42-45 - [c8]Naoko Tosa, Yunian Pang, Liang Zhao, Ryohei Nakatsu:
Genesis: New Media Art Created as a Visualization of Fluid Dynamics. ICEC 2017: 3-13 - 2013
- [j9]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. 96-B(2): 561-568 (2013) - [c7]Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner:
A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs. ICA3PP (2) 2013: 157-164 - 2010
- [j8]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): 934-946 (2010) - [c6]Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi:
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. CGGA 2010: 154-163
2000 – 2009
- 2008
- [j7]Hiroki Fujiwara, Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Enumerating Treelike Chemical Graphs with Given Path Frequency. J. Chem. Inf. Model. 48(7): 1345-1357 (2008) - 2007
- [c5]Liang Zhao, A. Shimae, Hiroshi Nagamochi:
Linear-tree rule structure for firewall optimization. Communications, Internet, and Information Technology 2007: 67-72 - [c4]Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Efficient Algorithm for Generating Colored Outerplanar Graphs. TAMC 2007: 573-583 - 2006
- [j6]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): 2402-2410 (2006) - 2005
- [j5]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102(1): 167-183 (2005) - 2004
- [j4]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
On generalized greedy splitting algorithms for multiway partition problems. Discret. Appl. Math. 143(1-3): 130-143 (2004) - 2003
- [j3]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): 275-289 (2003) - [j2]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): 63-70 (2003) - 2001
- [j1]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): 397-410 (2001) - [c3]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A Unified Framework for Approximating Multiway Partition Problems. ISAAC 2001: 682-694 - [c2]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS 2001: 478-489
1990 – 1999
- 1999
- [c1]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ISAAC 1999: 373-382
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint