Bin Chen

Orcid: 0000-0003-2965-0333

Affiliations:
  • Fuzhou University, Center for Discrete MathematicsFuzhou, China


According to our database1, Bin Chen authored at least 17 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The dichromatic number of digraphs without induced subdigraphs.
Discret. Math., 2026

2025
A New Connectivity Bound for a Tournament to be Highly Linked.
Graphs Comb., October, 2025

Long antipaths and anticycles in oriented graphs.
Discret. Math., 2025

New results on a problem of Alon.
Discret. Math., 2025

2024
Disjoint cycles in tournaments and bipartite tournaments.
J. Graph Theory, February, 2024

Forbidden subdigraphs conditions on the Traceability Conjecture.
Discret. Math., January, 2024

Towards Adversarial-Robust Class-Incremental Learning via Progressively Volume-Up Perturbation Generation.
Proceedings of the Pattern Recognition and Computer Vision - 7th Chinese Conference, 2024

MEAT: Median-Ensemble Adversarial Training for Improving Robustness and Generalization.
Proceedings of the IEEE International Conference on Acoustics, 2024

2023
A note on Seymour's second neighborhood conjecture.
Discret. Appl. Math., October, 2023

Oriented diameter of graphs with given girth and maximum degree.
Discret. Math., April, 2023

Push Stricter to Decide Better: A Class-Conditional Feature Adaptive Framework for Improving Adversarial Robustness.
IEEE Trans. Inf. Forensics Secur., 2023

Q-TrHDRI: A Qurey-Based Transformer for High Dynamic Range Imaging with Dynamic Scenes.
Proceedings of the Pattern Recognition and Computer Vision - 6th Chinese Conference, 2023

An Adaptive Model Ensemble Adversarial Attack for Boosting Adversarial Transferability.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

2022
Turán number of 3-free strong digraphs with out-degree restriction.
Discret. Appl. Math., 2022

On the Transversal Number of k-Uniform Connected Hypergraphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
3-Free Strong Digraphs with the Maximum Size.
Graphs Comb., 2021

Diameter Three Orientability of Bipartite Graphs.
Electron. J. Comb., 2021


  Loading...