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

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

30

October

Three WWTF Projects for the Algorithms and Complexity Group

At the highly competitive  ”Information and Communication Technology” Project Call of the Vienna Science and Technology Fund (WWTF), three projects from members of the Algorithms and Complexity group where successful.

Engineering Linear Ordering Algorithms for Optimizing Data Visualizations. PI: Martin Nöllenburg 
Learning to Solve Quantified Boolean Formulas. PI: Friedrich Slivovsky
Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI. PI Stefan Szeider

All three projects together amount to a total funding sum of over EUR 1.3 Mio.

Out of 96 submitted short proposals, 26 have been invited to submit a full proposal, and 9 of

Read more

14

October

New PhD: Tomáš Peitl

Tomáš Peitl successfully defended his PhD thesis “Advanced Dependency Analysis for QBF” on October 14, 2019. Congratulations!

Tomáš was was supervised by Stefan Szeider and co-supervised by Friedrich Slivovsky.

In November, he will start with his FWF Erwin Schrödinger scholarship a postdoc position at the Friedrich Schiller Universität Jena.

 

Read more

13

September

Winner of the PACE’19 Competition, Hypertree Width/Exact

Our solver htdSMT submitted by André Schidler and Stefan Szeider achieved the first place in the PACE’19 competition for the Track Hypertree Width/Exact.

PACE’19 is the 4th edition of the Parameterized Algorithms and Computational Experiments Challenge,  which was conceived in Fall 2015 to deepen the relationship between parameterized algorithms and practice. Implemented algorithms are submitted and ranked by their performance on a large set of benchmark problem instances.

PACE’19 had three tracks: Vertex Cover, Hypertree Width/Exact, and Hypertree Width/Heuristic. Our algorithm HtdSMT came first in the Hypertree Width/Exact track.

The award ceremony took

Read more

18

June

New PhD: Neha Lodha

Neha Lodha successfully defended her PhD thesis “SAT Approach to Decomposition” on June 18,, 2019. Congratulations!

Neha was was supervised by Stefan Szeider.

Neha was one of the first students who joined the Doctoral Program Logical Methods in Computer Science (LogiCS) where she was a student representative.

Read more

18

January

Three female PhD students at the Algorithms and Complexity Group

The Algorithms and Complexity Group has currently three female PhD students:

Thekla Hamm works in the FWF funded research project “New Frontiers for Parameterized Complexity (FWF P31336)” under the advise of  Dr. Robert Ganian.
Guangping Li works in the FWF funded research project “Human-centered Algorithm Engineering: Graph and Map Visualization (FWF P31119)” under the advise of Prof. Martin Nöllenburg.
Neha Lodha works in the FWF funded Doctoral College “Logical Methods in Computer Science (FWF W1255)” under the advise of Prof. Stefan Szeider.

Thekla and Guanping joined just recently, Neha is close to completion of her PhD

Read more
1234Next

Next Page »

News

  • Martin Nöllenburg: promotion to Full Professor

    Martin Nöllenburg: promotion to Full Professor

    2020-12-17
    By December 1st, 2020, our colleague Martin Nöllenburg has been promoted to Full Professor for Graph and Geometric Algorithms.  Martin has …Read More »
  • Martin Kronegger wins the Best Teaching Award 2020

    Martin Kronegger wins the Best Teaching Award 2020

    2020-10-23
    Congratulations to Martin Kronegger who received a Best Teaching Award 2020 from TU Wien. The Algorithms and Complexity group is …Read More »
  • Welcome to our Feodor Lynen Fellow Dr. Manuel Sorge

    Welcome to our Feodor Lynen Fellow Dr. Manuel Sorge

    2020-10-12
    On October 1, 2020, Dr. Manuel Sorge has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc …Read More »
  • TU Wien students excel at the 2020 Graph Drawing Contest

    TU Wien students excel at the 2020 Graph Drawing Contest

    2020-10-01
    The 27th annual Graph Drawing Contest, held (virtually) in conjunction with the 28th International Symposium on Graph Drawing and Network …Read More »
  • Best Paper Award at CP’2020

    Best Paper Award at CP’2020

    2020-09-11
    Tomáš Peitl and Stefan Szeider won the Best Paper Award at the main track of CP'2020, the 26th International Conference on Principles …Read More »

News archive

All news for 2015, 2016, 2017, 2018 and 2019.
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.