Liang Zhao
Orcid: 0000-0003-0869-7896Affiliations:
- Kyoto University, Japan
According to our database1,
Liang Zhao
authored at least 30 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
CoRR, 2023
2022
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.
CoRR, 2022
Proceedings of the ICBBB 2022: 12th International Conference on Bioscience, Biochemistry and Bioinformatics, Tokyo, Japan, January 7, 2022
2021
CoRR, 2021
CoRR, 2021
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
Algorithms Mol. Biol., 2021
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.
Proceedings of the Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 2021
Proceedings of the Intelligent Computing Theories and Application, 2021
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021
2017
<i>γ</i><i>k</i>(<i>n</i>) = max {⌊<i>n</i>/(2<i>k</i>+1)⌋, 1} for Maximal Outerplanar Graphs with <i>n</i> mod (2<i>k</i>+1) ≤ 6.
J. Inf. Process., 2017
Proceedings of the Entertainment Computing - ICEC 2017, 2017
Proceedings of the IEEE Canada International Humanitarian Technology Conference, 2017
Proceedings of the 2017 International Conference on Culture and Computing, 2017
Proceedings of the 2017 International Conference on Culture and Computing, 2017
2013
An Adaptive Fairness and Throughput Control Approach for Resource Scheduling in Multiuser Wireless Networks.
IEICE Trans. Commun., 2013
A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2013
2010
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut.
J. Chem. Inf. Model., 2010
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.
Proceedings of the Computational Geometry, Graphs and Applications, 2010
2008
J. Chem. Inf. Model., 2008
2007
Proceedings of the Theory and Applications of Models of Computation, 2007
Linear-tree rule structure for firewall optimization.
Proceedings of the Sixth IASTED International Conference on Communications, 2007
2006
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
Discret. Appl. Math., 2006
2005
Math. Program., 2005
2004
Discret. Appl. Math., 2004
2003
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett., 2003
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math., 2003
2001
J. Comb. Optim., 2001
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
Proceedings of the STACS 2001, 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001