constructive-algorithms

might not be the shortest but descriptive and easy for newcomers too.

A Research that i have done in College for TSP as a new Heuristic.

Constructive classification of incidence full coupled graph dynamics with a complete parity invariant, exact local complementation, polynomial canonicalization, and reproducible verification — Shunyaya Structural Discovery Demonstration.

Codeforces problem solving

Exact classification of reversible monochromatic triangle dynamics on complete graphs for all n >= 6, with a complete degree parity and mod 3 invariant, constructive stabilization, exact orbit growth, and reproducible verification - Shunyaya Orbit Stabilization Theory.