Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

17

December

Martin Nöllenburg: promotion to Full Professor

By December 1st, 2020, our colleague Martin Nöllenburg has been promoted to Full Professor for Graph and Geometric Algorithms. 

Martin has joined the Algorithms and Complexity group at TU Wien in September 2015 and was promoted to Associated professor in 2017. 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.

See here 5 Questions with … Martin Nöllenburg from last year.

Congratulations!

Read more

23

October

Martin Kronegger wins the Best Teaching Award 2020

Congratulations to Martin Kronegger who received a Best Teaching Award 2020 from TU Wien.

The Algorithms and Complexity group is very happy about Martin’s engagement in the Algorithms and Data Structures course, which received a nomination for the Best Distance Learning Award 2020 for its digitalisation of the course during the COVID-19 restrictions in Spring 2020.

 

Read more

12

October

Welcome to our Feodor Lynen Fellow Dr. Manuel Sorge

On October 1, 2020, Dr. Manuel Sorge has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc fellowship from the Alexander von Humboldt Foundation.

Manuel has received his PhD in 2016 from TU Berlin and has worked as a postdoc researcher at Ben-Gurion University in Beer Sheva, Israel and at Warsaw University, Poland. In his two-year project at TU Wien he will investigate network analysis and visualization problems by exploiting knowledge about inherent structures of complex networks, such as their structural sparsity or properties of overlapping clusters. Together

Read more

01

October

TU Wien students excel at the 2020 Graph Drawing Contest

The 27th annual Graph Drawing Contest, held (virtually) in conjunction with the 28th International Symposium on Graph Drawing and Network Visualization (GD) in Vancouver on September 15-18, 2020 was a big success for our TU Wien graph drawing students, winning the first prize in both creative categories, as well as one second prize and one third prize. Three out of these four layouts were created as part of the coursework for the lecture Graph Drawing Algorithms (taught by Martin Nöllenburg and Soeren Nickel).

The 2020 contest comprised two creative topics: the

Read more

11

September

Best Paper Award at CP’2020

Tomáš Peitl and Stefan Szeider won the Best Paper Award at the main track of CP’2020, the 26th International Conference on Principles and Practice of Constraint Programming, for their paper: “Finding the Hardest Formulas for Resolution”.

Congratulations!

In the paper, a  resolution-based method (CDCL SAT solver) is used to find the hardest formulas for resolution, which constitutes a self reference as greatly illustrated by MC Escher in his lithograph “Drawing Hands (1948).

 

 

Abstract: A CNF formula is harder than another CNF formula with the same number of clauses if it requires a longer resolution proof.

Read more

17

June

Robert Ganian receives an FWF START prize

Robert Ganian who receives an FWF START Prize for his project Parameterized Analysis in Artificial Intelligence.

The FWF START prize is comparable in competitiveness and funding to an ERC starting grant.

Out of 111 applications over all scientific disciplines, 7 START prizes where awarded.

Congratulations!

 

 

Read more

16

March

New PhD: Fabian Klute

Fabian Klute successfully defended his PhD thesis “Avoiding Crossings in Non-Planar Graph Layouts” on March 13, 2020. Congratulations!

Fabian was supervised by Martin Nöllenburg. His thesis reviewers were Fabrizio Frati and Stephen Kobourov. Fabian is now a postdoc at Utrecht University.

Read more

03

March

New PhD: Benedikt Klocker

Benedikt Klocker successfully defended his PhD thesis “Combinatorial Optimization Approaches for Graph Construction Problems” on March 25, 2020. Congratulations!

Benedikt was supervised by Günther Raidl and co-supervised by Herbert Fleischner.

Read more

27

January

Soeren Nickel wins the Distinguished Young Alumn Award

Soeren Nickel, who recently joined the Algorithms and Complexity Group as a PhD student, won the Distinguished Young Alumn Award at the 29th EPILOG event of the Faculty of Informatics. With this award the Faculty of Informatics honors Soeren’s outstanding Master thesis “Generating Stable Demers and Iso-Hexagon Cartograms” as well as his excellent EPILOG presentation.

Soeren’s thesis, supervised by Martin Nöllenburg, presents algorithms and complexity results for computing value-by-area square and hexagon cartograms to display spatiotemporal data as a highly abstract map. It has already been presented at the International Symposium

Read more

News

  • New FWF ESPRIT Postdocs

    New FWF ESPRIT Postdocs

    2022-11-09
    Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT …Read More »
  • Best student paper award at DIAGRAMS 2022

    Best student paper award at DIAGRAMS 2022

    2022-10-01
    Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams …Read More »
  • Robert Ganian promoted to Associate Professor

    Robert Ganian promoted to Associate Professor

    2022-07-01
    Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, …Read More »
  • Best paper award at EvoCOP 2022

    Best paper award at EvoCOP 2022

    2022-05-24
    Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search …Read More »
  • New PhD: Guangping Li

    New PhD: Guangping Li

    2022-05-13
    Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021 and 2022.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.