Yiyuan Wang

Orcid: 0000-0002-3071-3461

Affiliations:
  • Northeast Normal University, School of Computer Science and Information Technology, China
  • Jilin University, Key Laboratory of Symbolic Computation and Knowledge Engineering, Changchun, China


According to our database1, Yiyuan Wang authored at least 52 papers between 2015 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Improving local search algorithms for clique relaxation problems via group driven initialization.
Frontiers Comput. Sci., June, 2025

A comprehensive survey of UPPAAL-assisted formal modeling and verification.
Softw. Pract. Exp., 2025

Improving Local Search Algorithm for Pseudo Boolean Optimization.
J. Artif. Intell. Res., 2025

Towards more efficient local search for weighted graph coloring problem in massive graphs.
Comput. Oper. Res., 2025

2024
Ensuring reliability in electronic examinations through UPPAAL-based trustworthy design.
PeerJ Comput. Sci., 2024

A local search algorithm with movement gap and adaptive configuration checking for the maximum weighted s-plex problem.
Eng. Appl. Artif. Intell., 2024

A fast local search algorithm for minimum sum coloring problem on massive graphs.
Comput. Oper. Res., 2024

PathLAD+: Towards effective exact methods for subgraph isomorphism problem.
Artif. Intell., 2024

Nukplex: An Efficient Local Search Algorithm for Maximum K-Plex Problem.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem.
Frontiers Comput. Sci., August, 2023

An efficient local search algorithm for minimum positive influence dominating set problem.
Comput. Oper. Res., June, 2023

Combinatorial optimization and local search: A case study of the discount knapsack problem.
Comput. Electr. Eng., January, 2023

A master-apprentice evolutionary algorithm for maximum weighted set K-covering problem.
Appl. Intell., 2023

Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism.
Artif. Intell., 2023

PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Unsupervised Aspect Term Extraction by Integrating Sentence-level Curriculum Learning with Token-level Self-paced Learning.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Learning with Partial Labels from Semi-supervised Perspective.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Combining max-min ant system with effective local search for solving the maximum set k-covering problem.
Knowl. Based Syst., 2022

A Fast Local Search Algorithm for the Latin Square Completion Problem.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
An efficient local search for large-scale set-union knapsack problem.
Data Technol. Appl., 2021

Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set.
J. Artif. Intell. Res., 2021

A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs.
J. Artif. Intell. Res., 2021

An improved configuration checking-based algorithm for the unicost set covering problem.
Eur. J. Oper. Res., 2021

Core-guided method for constraint-based multi-objective combinatorial optimization.
Appl. Intell., 2021

Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
NuMWVC: A novel local search for minimum weighted vertex cover problem.
J. Oper. Res. Soc., 2020

A local search algorithm with reinforcement learning based repair procedure for minimum weight independent dominating set.
Inf. Sci., 2020

A two phase removing algorithm for minimum independent dominating set problem.
Appl. Soft Comput., 2020

SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem.
Artif. Intell., 2020

NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Two-goal Local Search and Inference Rules for Minimum Dominating Set.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Reduction and Local Search for Weighted Graph Coloring Problem.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
MLQCC: an improved local search algorithm for the set k-covering problem.
Int. Trans. Oper. Res., 2019

An Improved Memetic Algorithm for the Partial Vertex Cover Problem.
IEEE Access, 2019

2018
An efficient local search for partial vertex cover problem.
Neural Comput. Appl., 2018

A restart local search algorithm for solving maximum set k-covering problem.
Neural Comput. Appl., 2018

A memetic algorithm for minimum independent dominating set problem.
Neural Comput. Appl., 2018

New heuristic approaches for maximum balanced biclique problem.
Inf. Sci., 2018

A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

An Exact Algorithm for Maximum k-Plexes in Massive Graphs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
A path cost-based GRASP for minimum independent dominating set problem.
Neural Comput. Appl., 2017

A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem.
Neural Comput. Appl., 2017

GRASP for connected dominating set problems.
Neural Comput. Appl., 2017

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function.
J. Artif. Intell. Res., 2017

A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>-covering problem.
Int. Trans. Oper. Res., 2017

A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity.
Sci. China Inf. Sci., 2017

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Improved Algorithm of Unsatisfiability-based Maximum Satisfiability.
Proceedings of the 1st International Workshop on Semantic Technologies (IWOST), 2015


  Loading...