Yi Fan

Affiliations:

Qiannan Normal University for Nationalities, School of Mathematics and Statistic, Duyun, China
Guilin University of Electronic Technology, Guangxi Key Laboratory of Trusted Software, China
Griffith University, Brisbane, Australia (PhD 2017)

According to our database¹, Yi Fan authored at least 19 papers between 2015 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2024

Temporal Coverage Optimization for Epoch-based Vehicular Crowdsensing Recruitment.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE International Conference on Parallel and Distributed Systems, 2024

2023

Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.

[BibT_eX]

[DOI]

Entropy, October, 2023

2022

Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT.

[BibT_eX]

[DOI]

Entropy, December, 2022

A Hybrid Opinion Formation and Polarization Model.

[BibT_eX]

[DOI]

Baizhong Yang

Quan Yu

Yi Fan

Entropy, November, 2022

Optimized Large-Scale Road Sensing Through Crowdsourced Vehicles.

[BibT_eX]

[DOI]

IEEE Trans. Intell. Transp. Syst., 2022

2021

Dynamic Transit Flow Graph Prediction in Spatial-Temporal Network.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

Shortest Path Distance Prediction Based on CatBoost.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems and Applications, 2021

2020

Hamming Distance Encoding Multihop Relation Knowledge Graph Completion.

[BibT_eX]

[DOI]

IEEE Access, 2020

2019

Taxi Demand Prediction with LSTM-Based Combination Model.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, 2019

Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2019

Efficient Local Search for Minimum Dominating Sets in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2019

2018

Advancing Tabu and Restart in Local Search for Maximum Weight Cliques.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Efficient Local Search for Maximum Weight Cliques in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Deterministic Tournament Selection in Local Search for Maximum Edge Weight Clique on Large Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the AI 2017: Advances in Artificial Intelligence, 2017

2016

Local Search with Noisy Strategy for Minimum Vertex Cover in Massive Graphs.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2016: Trends in Artificial Intelligence, 2016

Random Walk in Large Real-World Graphs for Finding Smaller Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures.

[BibT_eX]

[DOI]

Proceedings of the AI 2016: Advances in Artificial Intelligence, 2016

2015

Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs.

[BibT_eX]

[DOI]

Vladimir Estivill-Castro

Abdul Sattar

CoRR, 2015

Yi Fan

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...