[1] His doctoral dissertation, Boolesche Funktionen, deren monotone Komplexität fast quadratisch ist, was jointly supervised by Wolfgang Paul [de] and Rudolf Ahlswede.
[1][2] He wrote two books on related topics, The Complexity of Boolean Functions (Wiley, 1987, also called "the blue book")[6] and Branching Programs and Binary Decision Diagrams: Theory and Applications (SIAM Press, 2000).
[7] Beginning in the 1990s, his research interests shifted towards the theoretical analysis of metaheuristics and evolutionary computation.
[1][2] Wegener was elected as a fellow of the German society for computer science, the Gesellschaft für Informatik, in 2004.
[8] For his merits on teaching and research in the field of theoretical computer science, he earned in 2006 the Konrad Zuse Medal from the Gesellschaft für Informatik.