Algorithms for computing linear invariants if directed graphs

Algorithms for lattice games

Algorithms for learning and teaching sets of vertices in graphs

Algorithms for Producing and Ordering Lexical and Nonlexical Sequences out of one Element

Algorithms for Silver Coloring of Generalized Petersen Graphs

All Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices

All Difference Family Structures arise from Groups

All pentagonal face multi tori

All totally symmetric colored graphs

All-Pairs Shortest Paths in $O(n^2)$ time with high probability

Alliance free and alliance cover sets

Alliance free sets in Cartesian product graphs

Almost all cancellative triple systems are tripartite

Almost all triple systems with independent neighborhoods are semi-bipartite

Almost Hadamard matrices: general theory and examples

Almost optimal pairing strategy for Tic-Tac-Toe with numerous directions

Almost Product Evaluation of Hankel Determinants

Almost Series-Parallel graphs: structure and colorability

Almost simple groups with socle $L_n(q)$ acting on Steiner quadruple systems

Almost spanning subgraphs of random graphs after adversarial edge removal