Dorothea Wagner (born 1957) is a German computer scientist, known for her research in graph drawing, route planning, and social network analysis. [1] She heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology. [2]
Wagner did her undergraduate studies at RWTH Aachen University, graduating in 1983, and then continued at RWTH Aachen for her graduate studies, earning a Ph.D. in 1986 under the supervision of Rolf Möhring and Walter Oberschelp. [3] [4] She then earned her habilitation at Technische Universität Berlin in 1992. She stayed at TU Berlin as an assistant professor, also taking a temporary position at the University of Halle-Wittenberg in 1993, before becoming a full professor at the University of Konstanz in 1994. In 2003, she moved to Karlsruhe. [3]
Since 2007 she is vice president of the German Research Foundation (DFG). [5] [6] She is one of five editors-in-chief of the Journal of Discrete Algorithms, published by Elsevier, [7] and editor-in-chief of the OpenAccess Series in Informatics book series published by Schloss Dagstuhl. [8] She has been program committee chair or co-chair of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'2008), 14th International Symposium on Graph Drawing (GD'2006), 2nd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'2002), 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'2000), and 4th Workshop on Algorithm Engineering (WAE'2000), and been on the editorial boards and program committees of many more computer science journals and conferences. [5]
In 2019 Wagner was one of three candidates for the position as president of the DFG; after a year-long selection process, the position eventually went to Katja Becker. [9]
In 2008 she was elected as a fellow of the Gesellschaft für Informatik. [1] In 2012 she received a Google Focused Research Award together with Hannah Bast and Peter Sanders for the project “Next-Generation Route Planning“. [10] She is a member of the Academia Europaea. [11] In 2019 she was awarded the Konrad Zuse Medal. [12]
Plankalkül is a programming language designed for engineering purposes by Konrad Zuse between 1942 and 1945. It was the first high-level programming language to be designed for a computer.
Carl Adam Petri was a German mathematician and computer scientist.
The Z1 was a motor-driven mechanical computer designed by German inventor Konrad Zuse from 1936 to 1937, which he built in his parents' home from 1936 to 1938. It was a binary, electrically driven, mechanical calculator, with limited programmability, reading instructions from punched celluloid film.
The Gottfried Wilhelm Leibniz Prize, or Leibniz Prize, is awarded by the German Research Foundation to "exceptional scientists and academics for their outstanding achievements in the field of research". Since 1986, up to ten prizes have been awarded annually to individuals or research groups working at a research institution in Germany or at a German research institution abroad. It is considered the most important research award in Germany.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Manfred Broy is a German computer scientist, and an emeritus professor in the Department of Informatics at the Technical University of Munich, Garching, Germany.
Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.
In geometric graph theory, a branch of mathematics, a matchstick graph is a graph that can be drawn in the plane in such a way that its edges are line segments with length one that do not cross each other. That is, it is a graph that has an embedding which is simultaneously a unit distance graph and a plane graph. For this reason, matchstick graphs have also been called planar unit-distance graphs. Informally, matchstick graphs can be made by placing noncrossing matchsticks on a flat surface, hence the name.
Reinhard Wilhelm is a German computer scientist.
Jan van Leeuwen is a Dutch computer scientist and emeritus professor of computer science at the Department of Information and Computing Sciences at Utrecht University.
The German Informatics Society (GI) is a German professional society for computer science, with around 20,000 personal and 250 corporate members. It is the biggest organized representation of its kind in the German-speaking world.
The Konrad Zuse Medal for Services to Computer Science is the highest award of the Gesellschaft für Informatik, given every two years to one or sometimes two leading German computer scientists. It is named after German computer pioneer Konrad Zuse. Note that a different medal with the same name is also given out by the Zentralverband des Deutschen Baugewerbes.
Matthias Jarke was a German computer scientist.
Leif Kobbelt is a German university professor for Computer Science with a specialization in Computer Graphics. Since 2001 he is the head of the Institute for Computer Graphics and Multimedia at RWTH Aachen university.
Klaus Pohl is a German computer scientist and Professor for Software Systems Engineering at the University of Duisburg-Essen, mainly known for his work in Requirements Engineering and Software product line engineering.
Gunther Schmidt is a German mathematician who works also in informatics.
Gerhard J. Woeginger was an Austrian mathematician and computer scientist who worked in Germany as a professor at RWTH Aachen University, where he chaired the algorithms and complexity group in the department of computer science.
Thomas Lengauer is a German computer scientist and computational biologist.
Martin Grohe is a German mathematician and computer scientist known for his research on parameterized complexity, mathematical logic, finite model theory, the logic of graphs, database theory, descriptive complexity theory, and graph neural networks. He is a University Professor of Computer Science at RWTH Aachen University, where he holds the Chair for Logic and Theory of Discrete Systems.
The Department of Computer Science is a department of the Technische Universität Darmstadt. With a total of 36 professorships and about 3,700 students in 12 study courses, the Department of Computer Science is the largest department of the university. The department shapes the two research profile areas "Cybersecurity (CYSEC)" and "Internet and Digitization (InDi)" of the university.