We study elliptic and modular curves, the dual graphs of their reductions, and other Diophantine equations and systems. We use a combination of classical methods (such as linear forms in logarithms, Diophantine approximation and Baker–Davenport reduction) and algorithmic methods of arithmetic geometry (such as the Chabauty method). We have completed the classification of torsion groups of elliptic curves over sextic fields. We are developing a modular algorithm for determining the dual graph of a quotient of the classical modular curve. We will then apply this algorithm to compute local heights and to rigorously determine the set of rational points on these curves. We study Diophantine m-tuples and their generalizations, as well as a generalization of Euler numbers in the context of walks on graphs. The algorithms, results and papers we develop will be made publicly available.