Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. - Lei Shang 001; Michele Garraffa; Federico Della Croce; Vincent T'kindt (IPEC, 2017)

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice. - Lei Shang 001 (CoRR, 2017)

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice. (Algorithmes Exacts Avec Garantie au Pire Cas Pour l'Ordonnancement: de la Théorie à la Pratique). - Lei Shang 001 (2017)

Exact exponential algorithms for 3-machine flowshop scheduling problems. - Lei Shang 001; Christophe Lenté; Mathieu Liedloff; Vincent T'kindt (J. Sched., 2018)

An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. - Michele Garraffa; Lei Shang 001; Federico Della Croce; Vincent T'kindt (Theor. Comput. Sci., 2018)

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. - Vincent T'kindt; Lei Shang 001; Federico Della Croce (J. Comb. Optim., 2020)

Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees. - Lei Shang 001; Vincent T'kindt; Federico Della Croce (Comput. Oper. Res., 2021)