Let F(x , y) be an irreducible binary form of degree at least 3 and with integer coefficients. By a well-known result of Thue the equation F(x , y) = m has only finitely many solutions in integers x and y. I Shall discuss some different methods from classical Diophantine analysis and geometry of numbers to give upper bounds for the number of solutions to such equations.