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

Courses

chalk-wide

We are offering courses in  Algorithms and Data Structures, Optimization, Metaheuristics, Constrained Optimization, Graph algorithms, and Algorithmic Geometry.

Project and Thesis Topics

We are always looking for enthusiastic students who are interested in a research project or thesis in our Bachelor and Master programs. Examples of topics for Projects, Bachelor and Master theses can be found here.

Courses offered in 2023W term

Number Type Title Hours Credits Semester
192.133 VU Algorithmic Geometry 3.0 4.5 2023W
192.122 VU Algorithmic Meta-Theorems 2.0 3.0 2023W
186.814 VU Algorithmics 4.0 6.0 2023W
186.102 VU Approximation Algorithms 2.0 3.0 2023W
186.819 PR Bachelor Thesis in Computer Science 5.0 7.5 2023W
192.135 VU Fixed-Parameter Algorithms and Complexity 2.0 3.0 2023W
192.137 VU Heuristic Optimization Techniques 3.0 4.5 2023W
180.767 SE Orientation Bachelor with Honors of Informatics and Business Informatics 1.0 1.5 2023W
192.021 PR Project in Computer Science 1 4.0 6.0 2023W
192.105 PR Project in Computer Science 1 Team-Based Research in Algorithmics 4.0 6.0 2023W
192.022 PR Project in Computer Science 2 4.0 6.0 2023W
186.852 PR Project in Software Engineering & Internet Computing 6.0 9.0 2023W
192.090 PR Project in Visual Computing 6.0 9.0 2023W
180.771 VU Propädeutikum für Informatik 2.0 3.0 2023W
193.052 SE Randomized Algorithms 2.0 3.0 2023W
186.842 SE Research seminar for PhD candidates 2.0 3.0 2023W
193.052 SE Scientific Research and Writing 2.0 3.0 2023W
186.199 SE Seminar for PhD candidates 2.0 3.0 2023W
186.862 SE Seminar in Algorithms Graphs and Geometry 2.0 3.0 2023W
192.119 SE Seminar in Artificial Intelligence Algorithmic and Computational Decision Theory 2.0 3.0 2023W
186.182 SE Seminar on Algorithms 2.0 3.0 2023W
193.052 SE Wissenschaftliches Arbeiten 2.0 3.0 2023W
187.B12 VU Ways of thinking in informatics 4.0 6.0 2023W

Courses offered in the previous 2023S term

Number Type Title Hours Credits Semester
192.118 VU Algorithmic Social Choice 4.0 6.0 2023S
186.866 VU Algorithms and Data Structures 5.5 8.0 2023S
186.819 PR Bachelor Thesis in Computer Science 5.0 10.0 2023S
192.141 VU Graph Drawing Algorithms 3.0 4.5 2023S
186.835 VU Mathematical Programming 2.0 3.0 2023S
186.861 VU Modeling and Solving Constrained Optimization Problems -- not offered this term due to budgetary reasons 2.0 3.0 2023S
186.190 VU Optimization in Transport and Logistics -- not offered this term due to budgetary reasons 2.0 3.0 2023S
180.767 SE Orientation Bachelor with Honors of Informatics and Business Informatics 1.0 1.5 2023S
186.820 PR Project in Computer Science 1 4.0 6.0 2023S
186.821 PR Project in Computer Science 2 4.0 6.0 2023S
184.767 SE Research Seminar LogiCS 2.0 3.0 2023S
186.842 SE Research Seminar for PhD candidates 2.0 3.0 2023S
193.052 SE Scientific Research and Writing 2.0 3.0 2023S
180.773 SE Seminar for Master Students in Logic and Computation 1.0 1.5 2023S
186.199 SE Seminar for PhD candidates 2.0 3.0 2023S
192.119 SE Seminar in Artificial Intelligence Algorithmic and Computational Decision Theory 2.0 3.0 2023S
186.182 SE Seminar on Algorithms 2.0 3.0 2023S
186.856 VU Structural Decompositions and Algorithms 2.0 3.0 2023S

Graduate Studies

Our group is involved in lectures and organization of the following programs:

Master Programs

  • Master Program in Logic and Computation
    (English language Master program)
  • Erasmus Mundus European Master Program in Computational Logic
    (English language Master program with EU scholarships in collaboration with Dresden, Bolzano, Lisbon)

PhD Programs

  • Doctoral Program Logical Methods in Computer Science
  • Vienna Graduate School on Computational Optimization
  • Vienna PhD School of Informatics
    (yearly applications for 10-20 scholarships)
  • Doctoral program in Computer Science
    (funding usually provided by advisor’s grants; please inquire with potential advisors)

News

  • PhD completed by Anaïs Villedieu

    PhD completed by Anaïs Villedieu

    2023-07-24
    Anaïs Villedieu successfully defended her PhD thesis “Engineering Human-in-the-loop Graph Drawing Algorithms” on July 24, 2023. Congratulations, Dr. Villedieu! Anaïs …Read More »
  • PhD completed by Andre Schidler

    PhD completed by Andre Schidler

    2023-05-31
    Congratulations to André Schidler, who successfully defended his PhD thesis "Scalability for SAT-based combinatorial problem solving" today.   Thanks to …Read More »
  • PhD completed by Vaidyanathan P.R.

    PhD completed by Vaidyanathan P.R.

    2023-05-12
    Congratulations to Vaidyanathan P.R., who successfully defended his PhD thesis Scalable Bayesian Network Structure Learning using SAT-based Methods today. Thanks …Read More »
  • PhD completed by Nikolaus Frohner

    PhD completed by Nikolaus Frohner

    2023-05-11
    Congratulations to Nikolaus Frohner, who successfully defended his PhD thesis "Advancing State Space Search for Static and Dynamic Optimization by …Read More »
  • Best paper award at IEEE PacificVis 2023

    Best paper award at IEEE PacificVis 2023

    2023-04-22
    Markus Wallinger, Alexander Dobler, and Martin Nöllenburg received the Best Paper Award for their paper LinSets.zip: Compressing Linear Set Diagrams …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.