KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem

华中科技大学 计算机学院 硕士/博士 毕业论文 Latex 模板（参考2023年标准）

Enhancing the Transferability of Adversarial Attacks through Variance Tuning

Single Image Reflection Removal through Cascaded Refinement, CVPR 2020

Relaxed Graph Color Bound for the Maximum $k$-plex Problem

Learning-based Hybrid Local Search for the Hard-label Textual Attack

Generating Natural Language Adversarial Examples through Probability Weighted Word Saliency

Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks

HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problem and its Variants

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit

NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs

禁忌搜索算法C++实现，运行500.5文件49色，大概率2、3分钟出结果

BandMaxSAT: Multi-armed Bandit for the Local Search MaxSAT Solver

Robust Textual Embedding against Word-level Adversarial Attacks

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem

A Strengthened Branch and Bound Algorithm for Maximum Common Subgraph Problems