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

09

November

New FWF ESPRIT Postdocs

Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT Projects:

  • QBF Proofs and Certificates (FWF ESP 197, PI: Leroy Chew)
  • Overcoming Intractability in the Knowledge Compilation Map (FWF ESP 235, PI: Alexis de Colnet)

Congratulations to Leroy and Alexis for winning these competitively awarded project grants!

 

Read more

01

July

Robert Ganian promoted to Associate Professor

Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, Robert!

 

Read more

02

July

Jan Dreier receives a LICS’21 Distinguished Paper Award

Congratulations to Jan Dreier for his LICS 2021 Distinguished Paper Award for his paper Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes.

Here is a link to the video of his presentation.

 

Read more

16

June

Lecture at Austrian Parliament

Stefan Szeider and Martin Kronegger gave a lecture on Algorithms and Programming to members of the Austrian Parliament.

The lecture consisted of three parts and concluded with a Q&A session with the MPs and ended with a live programming demonstration.

The Algorithms lecture took place on June 15th, 2021, in the same venue where usually the plenary discussions of the Austrian parliament take place, the “great Redoutensaal,” a beautiful hall located in Vienna’s Hofburg.

This lecture was part of the Faculty of Informatic’s initiative Digitale Kompetenzen (digital competence), consisting of several lectures on

Read more

14

June

Promotio Sub Auspiciis Praesidentis Rei Publica

Congratulations to our former students Martin Riedler and Tomas Peitl for receiving this outstanding award of a Promotio Sub Auspiciis Praesidentis Rei Publica (Doctoral graduation under the auspices of the Federal President). Each year, only a handful  of doctoral students from Austria receive this special award, which requires excellent grades throughout secondary school, undergraduate and graduate studies.

We are specially proud that two students from our group receive this honour this year.

The ceremony took place with over year’s delay due to the Covid pandemic.

News post at TU Wien’s website.

 

 

 

Read more

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

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

30

October

New Assistant Professor: Jiehua Chen

In October 2019, Jiehua Chen has joined the Algorithms and Complexity Group on a tenure track position. 

Jiehua’s research interests are the parameterized complexity of, and the design and analysis for, combinatorial problems arising in contexts such as optimization related to graphs and hypergraphs, computational social choice, and preference-based stable matchings.

Jiehua is the principal investigator of a Vienna Research Group in ICT project, which is funded by the Vienna Science and Technology Fund (WWTF), which is comparable both in competitiveness as well as funding volume with an ERC starting grant. The project’s

Read more
1234Next

Next Page »

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.