Bin Sheng

Orcid: 0000-0003-4601-446X

Affiliations:
  • Nanjing University of Aeronautics and Astronautics, College of Computer Science and Technology, China
  • Royal Holloway, University of London, Egham, UK (PhD 2017)


According to our database1, Bin Sheng authored at least 24 papers between 2014 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Adaptive triple collaborative learning for contrastive community discovery in heterogeneous graphs with fuzzy boundaries.
Appl. Intell., April, 2026

Seamless skill transitions with hierarchical reward shaping and failure-driven replay.
Neurocomputing, 2026

Group morphological adaptation via adversarial imitation learning.
Eng. Appl. Artif. Intell., 2026

2025
HEPI: High-reward experience-assisted policy iteration in deep reinforcement learning.
Knowl. Based Syst., 2025

2024
MMTFN: Multi-modal multi-scale transformer fusion network for Alzheimer's disease diagnosis.
Int. J. Imaging Syst. Technol., January, 2024

Construction of Gene Expression Patterns to Identify Critical Genes Under SARS-CoV-2 Infection Conditions.
IEEE Trans. Comput. Biol. Bioinform., 2024

2023
Hic-KGQA: Improving multi-hop question answering over knowledge graph via hypergraph and inference chain.
Knowl. Based Syst., October, 2023

Fixed parameterized algorithms for generalized feedback vertex set problems.
Theor. Comput. Sci., April, 2023

Patch-based deep multi-modal learning framework for Alzheimer's disease diagnosis using multi-view neuroimaging.
Biomed. Signal Process. Control., 2023

2022
Modeling social network behavior spread based on group cohesion under uncertain environment.
Concurr. Comput. Pract. Exp., 2022

2021
The minimum size of a graph with given tree connectivity.
Discuss. Math. Graph Theory, 2021

2020
FPT Algorithms for Generalized Feedback Vertex Set Problems.
Proceedings of the Theory and Applications of Models of Computation, 2020

2019
An improved linear kernel for the cycle contraction problem.
Inf. Process. Lett., 2019

The second neighbourhood for bipartite tournaments.
Discuss. Math. Graph Theory, 2019

2017
Polynomial and FPT algorithms for Chinese Postman, packing and acyclicity.
PhD thesis, 2017

Odd properly colored cycles in edge-colored graphs.
Discret. Math., 2017

Acyclicity in edge-colored graphs.
Discret. Math., 2017

Chinese Postman Problem on edge-colored multigraphs.
Discret. Appl. Math., 2017

An improved kernel for the cycle contraction problem.
CoRR, 2017

The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs.
CoRR, 2017

2016
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.
Inf. Process. Lett., 2016

2015
Parameterized and Approximation Algorithms for the Load Coloring Problem.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Parameterized Complexity of the k-Arc Chinese Postman Problem.
Proceedings of the Algorithms - ESA 2014, 2014


  Loading...