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 15 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

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

Parameterized complexity of the k-arc Chinese Postman Problem.
J. Comput. Syst. Sci., 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

Parameterized and Approximation Algorithms for the Load Coloring Problem.
Algorithmica, 2017

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

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


  Loading...