Liang Zhao

Proceedings of the IEEE Region 10 Conference, 2023

A Spatial Connection Aware Complex Network Model for Real-World Social Networks.

[BibT_eX]

[DOI]

Wenruo Lyu

Proceedings of the 2023 11th International Conference on Information Technology: IoT and Smart City, 2023

De novo Drug Design against SARS-CoV-2 Protein Targets using SMILES-based Deep Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 2023 11th International Conference on Information Technology: IoT and Smart City, 2023

Pyramid as a Core Structure in Social Networks.

[BibT_eX]

[DOI]

Wenruo Lyu

Proceedings of the Complex Networks & Their Applications XII, 2023

2022

A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.

[BibT_eX]

[DOI]

Jianshen Zhu

Naveed Ahmed Azam

Fan Zhang

Aleksandar Shurbevski

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.

[BibT_eX]

[DOI]

CoRR, 2022

A Method for Molecular Design Based on Linear Regression and Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the ICBBB 2022: 12th International Conference on Bioscience, Biochemistry and Bioinformatics, Tokyo, Japan, January 7, 2022

2021

An Inverse QSAR Method Based on Linear Regression and Integer Programming.

[BibT_eX]

[DOI]

CoRR, 2021

A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.

[BibT_eX]

[DOI]

Aleksandar Shurbevski

Tatsuya Akutsu

Algorithms Mol. Biol., 2021

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.

[BibT_eX]

[DOI]

Proceedings of the Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 2021

An Inverse QSAR Method Based on Decision Tree and Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computing Theories and Application, 2021

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2017

γk(n) = max {⌊n/(2k+1)⌋, 1} for Maximal Outerplanar Graphs with n mod (2k+1) ≤ 6.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Genesis: New Media Art Created as a Visualization of Fluid Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Entertainment Computing - ICEC 2017, 2017

A practical system for optimized assignment of shelters to evacuees.

[BibT_eX]

[DOI]

Proceedings of the IEEE Canada International Humanitarian Technology Conference, 2017

Creation of Media Art Utilizing Fluid Dynamics.

[BibT_eX]

[DOI]

Proceedings of the 2017 International Conference on Culture and Computing, 2017

A Study on Variable Control of Sound Vibration Form (SVF) for Media Art Creation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEICE Trans. Commun., 2013

A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs.

[BibT_eX]

[DOI]

Hiroshi Kadowaki

Dorothea Wagner

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.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2010

An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.

[BibT_eX]

[DOI]

Tatsuya Ohshima

Pipaporn Eumthurapojn

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2008

Enumerating Treelike Chemical Graphs with Given Path Frequency.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2008

2007

An Efficient Algorithm for Generating Colored Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Linear-tree rule structure for firewall optimization.

[BibT_eX]

A. Shimae

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.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Greedy splitting algorithms for approximating multiway partition problems.

[BibT_eX]

[DOI]

Math. Program., 2005

2004

On generalized greedy splitting algorithms for multiway partition problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2001

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

A Unified Framework for Approximating Multiway Partition Problems.

[BibT_eX]

[DOI]