András Sebő (born 24 April 1954) is a Hungarian-French mathematician working in the areas of combinatorial optimization and discrete mathematics.

He moved to the University of Grenoble in 1988, where he advanced to his current position of CNRS Director of Research.

He is also one of seven honorary members of the Egerváry Research Group on Combinatorial Optimization.

[3] In 2012, Sebő and Jens Vygen developed a 7/5-approximation algorithm for the graph version of the traveling salesman problem;[4][5] currently the best-known approximation, improving on the widely cited 1.5-epsilon result of Gharan, Saberi, and Singh.

[8] A scientific conference in honor of Sebő was held April 24–25, 2014 in Grenoble, France.