Liang Zhao

Publications

• An Inverse QSAR Method Based on Decision Tree and Integer Programming
• A note on approximating the survivable network design problem in hypergraphs
• Greedy splitting algorithms for approximating multiway partition problems
• A primal-dual approximation algorithm for the survivable network design problem in hypergraph
• On the bitmap-image based presenting
• Security-aware beacon based network monitoring
• Finding small dominating sets in large-scale networks
• Linear-tree rule structure for firewall optimization
• Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
• An efficient algorithm for generating colored outerplanar graphs
• A simple rendering system for web presentation
• Multisource receiver-driven layered multicast
• A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem
• A unified framework for approximating multiway partition problemsExtended Abstract
• Efficient approximate algorithms for the beacon placement and its dual problem (abstract)
• Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
• Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut
• An adaptive fairness and throughput control approach for resource scheduling in multiuser wireless networks
• Creation of Media Art Utilizing Fluid Dynamics
• γk(n) = max{⌊n/(2k + 1)⌋, 1} for maximal outerplanar graphs with n mod (2k + 1) ≤ 6
• Enumerating treelike chemical graphs with given path frequency
• A Study on Variable Control of Sound Vibration Form (SVF) for Media Art Creation
• On generalized greedy splitting algorithms for multiway partition problems
• A practical system for optimized assignment of shelters to evacuees
• Genesis: New media art created as a visualization of fluid dynamics
• A practical approach for finding small {independent, distance} dominating sets in large-scale graphs
• A privacy-aware exergame platform for multi-domain cognitive training
• Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
• Approximating the minimum k-way cut in a graph via minimum 3-way cuts
• An A* algorithm framework for the point-to-point time-dependent shortest path problem
• Majority Dominating and Democratic Number:A Proposal to Define the Democracy of a Social Network
• An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures
• An Inverse QSAR Method Based on Linear Regression and Integer Programming
• An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming
• A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming
• Correction to: An Allometric Scaling for the Number of Representative Nodes in Social Networks
• “Choose for No Choose”—Random-Selecting Option for the Trolley Problem in Autonomous Driving
• Optimal Assignment of Wide-Area Evacuation Centers for Kyoto City
• Axioms and Divisor Methods for a Generalized Apportionment Problem with Relative Equality
• A Spatial Connection Aware Complex Network Model for Real-World Social Networks
• De novo Drug Design against SARS-CoV-2 Protein Targets using SMILES-based Deep Reinforcement Learning
• Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes
• Pyramid as a Core Structure in Social Networks
• Attentive Cross-Domain Few-shot Learning and Domain Adaptation in HSI Classification
• A Method for Inferring Polymers Based on Linear Regression and Integer Programming
• A unified approach to inferring chemical compounds with the desired aqueous solubility