| Lant hamiltonian | == user(user="pauldb" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| Lowest Common Ancestor | == user(user="pauldb" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| Algoritmul Bellman-Ford | == user(user="pauldb" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |

| Parantezare optima | == user(user="marius" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| Treapuri | == user(user="marius" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
| Subsecventa de suma maxima | == user(user="marius" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== |
 

In tabelul de mai jos se afla sugestii privind algoritmii care trebuie sa se gaseasca sub forma de probleme in arhiva educationala. Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":/forum/index.php?topic=3401.0.

|Principiul includerii si excluderii|Matematica|
|Submultimi|Backtracking|
|Knapsack|Programare dinamica|

|Subsecventa de suma maxima|Programare dinamica|
|Parantezare optima|Programare dinamica|

|Cuplaj maxim de cost minim|Algoritmi pe grafuri|
|2SAT|Algoritmi pe grafuri|
|Algoritmul Stoer-Wagner|Algoritmi pe grafuri|