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

Research

The Algorithms and Complexity group is concerned with the development and analysis of efficient algorithms for hard computational problems that arise in practical applications, as well as the establishment of theoretical limits of algorithmic approaches.

In particular, the group considers problems arising in the areas of Combinatorial Optimisation, Artificial Intelligence, Automated Reasoning, Planning and Scheduling, Network Design, Cutting and Packing, Network Visualization, and Cartography.

Among the methods the group's research builds upon are mathematical programming techniques, satisfiability solving techniques, metaheuristics, graph algorithms, computational geometry, fixed-parameter algorithms, constraint-based methods, and machine learning.

The group contributes to the research area Logic and Computation which is among the four focus areas of the Faculty of Informatics.

Publications

Publications of the Algorithms and Complexity group can be found here.

Current Research Projects

  • QBF Proofs and Certificates (FWF ESP 197 ESPRIT-Programm)
  • Overcoming Intractability in the Knowledge Compilation Map (FWF ESPRIT project)
  • MSCA COFUND Doctoral Programme LogiCS@TUWien
  • Cooperative Personnel Scheduling (Collaboration with Honda Research Institute)
  • Parameterized Analysis in Artificial Intelligence (FWF Y 1329 START-Programm)
  • Learning to Solve Quantified Boolean Formulas (WWTF, ICT19-060)
  • Engineering Linear Ordering Algorithms for Optimizing Data Visualizations (WWTF, ICT19-035)
  • Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI (WWTF, ICT19-065)
  • SAT Based Local Improvement (FWF P 32441)
  • Human-centered Algorithm Engineering: Graph and Map Visualization (FWF P31119)
  • Cooperative Optimization Approaches for Distributing Service Points (Collaboration with Honda Research Institute)
  • Doctoral College Vienna Graduate School on Computational Optimization (FWF W1260)
  • Doctoral College Logical Methods in Computer Science (FWF W1255)

Completed Research Projects

  • New Frontiers for Parameterized Complexity (FWF P31336)
  • Variable Dependencies of Quantified Boolean Formulas (FWF P27721)
  • Parameterized Compilation (FWF P26200)
  • Large-Scale Radio Therapy Scheduling (Research Collaboration with MedAustron)
  • Cycles on Graphs and Properties of Graphs with Special Cycle Structure (FWF P27615)
  • Multi-Criteria Optimization of FTTx Networks (FFG I892-N23)
  • Cutting and Packing Problems (cooperation with Eurosoft/Lodestar GmbH)
  • Balancing Bicycle Sharing Systems (FFG 831740)
  • Optimization Challenges in the Future Federated Internet (WWTF ICT-10-024)
  • Exploiting New Types of Structure for Fixed Parameter Tractability (FWF P26696)
  • The Parameterized Complexity of Reasoning Problems (ERC 239962)
  • Complete Solution Archives for Evolutionary Combinatorial Optimization (FWF P24660)
  • Matheuristics: Hybrid Optimization Algorithms for Transportation Problems with Mutltiple Visits (FWF P20342)

Resources

Benchmark suites for various problems: Problem Instances

Software

  • Qute, a dependency learning QBF solver.
  • BranchLIS, a tool for computing branch decompositions of graphs and hypergraphs
  • fraSMT, a tool for computing the fractional hyper tree width of hypergraphs

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.