Humboldt-Universität zu Berlin - Mathematisch-Naturwissenschaftliche Fakultät - Algorithm Engineering

Lehrstuhl Algorithm Engineering

 

Willkommen am Lehrstuhl "Algorithm Engineering"!

 

Unsere Forschungsschwerpunkte liegen im Bereich der Algorithmik, speziell parametrisierte Algorithmen bzw. Komplexität, effiziente Algorithmen, Vorverarbeitung und Algorithm Engineering. In der Lehre bieten wir neben Grundlagenvorlesungen zu theoretischer Informatik, z.B. "Algorithmen und Datenstrukturen, diverse weiterführende Vorlesungen zu Gebieten der Algorithmik an.

 

 

Welcome to the chair of "Algorithm Engineering"!

 

Our research focus is on the field of algorithms, specifically parameterized algorithms and complexity, efficient algorithms, preprocessing, and algorithm engineering. Apart from foundational lectures on theoretical computer science, like "algorithms and data structures", we offer a selection of advanced lectures on algorithmic topics.

 

News

 

  • Dr. Falko Hegerfeld successfully defended his PhD thesis in August, 2023.
  • Dr. Florian Nelles successfully defended his PhD thesis in 2022.
  • We welcome several new group members starting October/November 2022!
 
New publications
  • The paper "A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width", co-authored by Narek Bojikian and Stefan Kratsch, was accepted for publication in the proceedings of ICALP 2024.
  • The paper "Incremental Ordering for Scheduling Problems", co-authored by Stefan Neubert and Katrin Casel, was accepted for publication in the proceedings of ICAPS 2024.
  • The paper "Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth", co-authored by Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, and Erik Jan van Leeuwen, was accepted for publication in the proceedings of ESA 2023.
  • The paper "Tight Algorithms for Connectivity Problems Parameterized by Clique-Width", co-authored by Falko Hegerfeld and Stefan Kratsch, was accepted for publication in the proceedings of ESA 2023.
  • The paper "Approximate Turing Kernelization and Lower Bounds for Domination Problems", co-authored by Stefan Kratsch and Pascal Kunz, was accepted for publication in the proceedings of IPEC 2023.
  • The paper "Tight Algorithmic Applications of Clique-Width Generalizations", co-authored by Vera Chekan and Stefan Kratsch, was accepted for publication in the proceedings of MFCS 2023.
  • The paper "Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints", co-authored by Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, and Magnus Wahlström, was accepted for publication in the proceedings of SODA 2023.