Vera Traub is a German applied mathematician and theoretical computer scientist known for her research on approximation algorithms for combinatorial optimization problems including the travelling salesperson problem and the Steiner tree problem. She is a junior professor in the Institute for Discrete Mathematics at the University of Bonn.^[1]

Traub earned a bachelor's degree at the University of Bonn in 2015.^[2] She completed her doctorate (Dr. rer. nat.) there in 2020, with the dissertation Approximation Algorithms for Traveling Salesman Problems supervised by Jens Vygen [de].^[3] She was a postdoctoral researcher for Rico Zenklusen at ETH Zurich^[4][5] before taking her present position at the University of Bonn.^[1][5]

Traub was a recipient of the 2020 European Association for Theoretical Computer Science Distinguished Dissertation Award,^[6] and the Hausdorff Memorial Prize for best dissertation of the University of Bonn Mathematics Department.^[7] In 2022 she received the Richard Rado Prize [de] of the Discrete Mathematics group of the German Mathematical Society, a biennial prize for outstanding dissertations.^[5]

She was one of three recipients of the 2023 Maryam Mirzakhani New Frontiers Prize, given to her "for advances in approximation results in classical combinatorial optimization problems, including the traveling salesman problem and network design".^[5][8] She also received the 2023 Heinz Maier-Leibnitz Prize [de] of the German Research Foundation, the foundation's "most important award for researchers in early career stages".^[1]

• Home page
• Vera Traub publications indexed by Google Scholar