The Austrian Science Fund (FWF) is funding two new projects led by members of the Algorithms and Complexity group:
Congratulations to the new PIs!
Martin Nöllenburg and Therese Biedl (U Waterloo) have been elected as two new members of the steering committee of the International Symposium on Graph Drawing and Network Visualization (GD) by the GD community. They will serve for a three-year term until 2020. Martin was already an elected member of the steering committee in the previous period 2015-2017.
After a successful evaluation, the Doctoral Program Logical Methods in Computer Science (LogiCS) receives funding of over EUR 3.6M from the Austrian Science Funds (FWF) for a second period. The Doctoral program is directed by Georg Gottlob (speaker) and Stefan Szeider (deputy speaker) and has currently over 40 doctoral students.
Application for 16 new fully funded positions is open.
After his successful tenure evaluation, our colleague Martin Nöllenburg has been promoted to an Associate Professor.
Martin has joined the Algorithms and Complexity group at TU Wien in September 2015.
His research interests include graph algorithms, in particular for graph drawing and network visualization, computational geometry, in particular algorithms for cartography and geovisualization, as well as algorithm engineering and combinatorial optimization.
Congratulations!
The ALGO 2017 Congress on Algorithms, organised by the Algorithms and Complexity Group, took place September 4-8, 2017, in Vienna, Austria.
Photo galleries with highlights as well as day-by-day pictures have been posted on Flickr.
Highlights | Day 0 | Day 1 | Day 2 | Day 3 | Day 4 | Day 5
Further pictures can be found on the Social Media Wall.
Three researchers of the Algorithms and Complexity group returned from the International Symposium on Graph Drawing and Network Visualization (GD) 2017 in Boston winning several awards.
Theresa Fröschl, Master student in the Algorithms and Complexity group, received a “Konferenzschnuppern” travel grant for female Master students from the Faculty of Informatics to join her advisor Martin Nöllenburg on the conference trip to Boston. They received the Best Poster Award for their joint poster on Minimizing Wiggles in Storyline Visualizations, which is based on Theresa’s ongoing Master’s thesis.
Moreover, Theresa together with her teammates Jonathan
Press release from August 30, 2017 (in German)
Florian Aigner
Stefan Szeider
Ronald de Haan wins the E.W. Beth Dissertation Prize 2017 for his thesis “Parameterized Complexity in the Polynomial Hierarchy.”
Congratulations!
The E. W. Beth Dissertation Prize is named in honor of the Dutch mathematician Evert Willem Beth, and is awarded to outstanding PhD theses in the fields of Logic, Language, and Information by the Association for Logic, Language and Information.
Ronald wrote his thesis while working at the Algorithms and Complexity Group at TU Wien under the supervision of Stefan Szeider.
Currently Ronald is holding a postdoc position with the Computational Social Choice Group
Ricardo Baeza-Yates (NTENT, former Vice-President of Yahoo! Research Labs) gives the Vienna Gödel Lecture 2017
June 8th, 2017, 17:30
TU Wien, EI 7, Gußhausstraße 27-29, 1040 Wien
The lecture is moderated by Stefan Szeider.
More information can be found here.
Foto copyright: Faculty of Informatics / Nadia Meister
The Vienna March for Science on April 22, 2017, started with a Science Picnic. The Algorithms and Complexity Group performed a science demonstration with a human sorting network.
This demonstration introduced the participants to ideas of computational thinking. Volunteers from the public — adults and children — were invited to sort numbers (and other items) by progressing through the sorting network and in doing so, getting an understanding of fundamental principles used in computers.
Contact: Stefan Szeider
Further pictures:
