Prof. Dr. Tobias Friedrich


Master thesis paper accepted at ALENEX

David Stangl wrote his master thesis with the Algorithm Engineering group under the supervision of Thomas Bläsius and Christopher Weyand (now at the KIT). In his thesis David improved a branching algorithm for the NP-hard Minimum Hitting Set problem by transfering heuristics from SAT-solving to the new setting and showed in an empirical analysis that his solution outperforms the state of the art on real-world datasets. We are very proud to announce that the paper resulting from his work was accepted at the 2022 SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), which is one of the leading conferences on experimental algorithmics. ALENEX will be held January 9-10 2022, colocated with the ACM-SIAM Symposium on Discrete Algorithms (SODA), in Alexandria, VA, United States as an in-person conference with a hybrid option.

Congratulations to David!

  • An Efficient Branch-and-B... - Download
    Bläsius, Thomas; Friedrich, Tobias; Stangl, David; Weyand, Christopher An Efficient Branch-and-Bound Solver for Hitting SetAlgorithm Engineering and Experiments (ALENEX) 2022