Nimrod Megiddo (Hebrew: נמרוד מגידו) is a mathematician and computer scientist.

His interests include combinatorial optimization, algorithm design and analysis, game theory, and machine learning.

Megiddo received his PhD in mathematics from the Hebrew University of Jerusalem for research supervised by Michael Maschler.

[2][3][5] In computational geometry, Megiddo is known for his prune and search and parametric search techniques both suggested in 1983[6][7] and used for various computational geometric optimization problems, in particular to solve the smallest-circle problem in linear time.

[10] In 2009 he received the Institute for Operations Research and the Management Sciences (INFORMS) Fellows award for contributions to the theory and application of mathematical programming, including parametric searches, interior point methods, low dimension Linear Programming, probabilistic analysis of the simplex method and computational game theory.