We establish new results on the complexity of computing the VC-dimension, including fixed-parameter algorithms and running time lower bounds under the Exponential Time Hypothesis.