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

The AC Retreat took place between 29.6. and 1.7.. Within the retreat, a number of topics and research directions were discussed and introduced, and we provide a brief summary of potential research ideas below.

-Applications of metaheuristics to Bayesian Networks / synergies between Bayesian Networks and other topics, such as bicycle sharing (Sebastian + Christian?)

-Use SAT/QBF solvers for Unique Hamiltonian Graphs (Friedrich/Neha + Benedikt)

-ILP-to-SAT encodings (?)

-Connection between Solution Archives and Knowledge Compilation (Simone, Friedrich + Benjamin)

-FPT reductions from problems beyond NP to Mixed Integer Programming (Ronald+Benjamin)

-Invite Sarah Kirchner (already happened!)

-Structural parameters for Map Labeling (Martin+Robert...)

-Connections between (weak) backdoors / master problem for Benders' decomposition; Benders' decomposition / SAT clause learning (Neha, Eduard, ... + Christopher, Johannes, MartinR)

-Crossing minimization in book embeddings (Martin + ...)

-Neighborhood Search technique in relation to Parameterized Complexity, use SAT for Local Search (Frederico + ?)

-Applications of Kernelization for Meta-Heuristics (Robert, Sebastian, Eduard, Ramanujan + Petrina, Frederico)

-Visualizing SAT instances, searching for structure (Martin+Stefan?)

-Column generation for SAT (Christopher+Neha, Friedrich)

-SAT/MIPS/CSP encodings for Scheduling or other problems (Neha, Friedrich+Johannes, Martin)

-Apply SAT/QBF for subproblems resulting from decomposition-techniques such as Benders' decomposition or others (pricing problem for column generation) (Robert, Sebastian ... + Gunther, Christopher...)

-Tree-decompositions as basis for Benders' decomposition (Gunther+Sebastian, Robert, Eduard)

 

 

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.