Talks and Presentations

Selected talks with links to slides, posters, and video recordings.

  • A (3/2+1/e)-Approximation Algorithm for Ordered TSP) [Slides] [Poster]
    Based on the same-named paper with Susanne Armbruster and Matthias Mnich.

    • - upcoming - Poster presentation: 25rd Conference on Integer Programming and Combinatorial Optimization 2024, Wrocław. July 2024.

    • Seminar of the Institute for Discrete Mathematics, Bonn. May 15, 2024.

  • A Better-Than-1.6-Approximation for Prize-Collecting TSP [Slides]
    Based on the same-named paper with Jannis Blauth and Nathan Klein.

    • Seminar of the Institute for Discrete Mathematics, Bonn. February 14, 2024.

  • An improved approximation guarantee for Prize-Collecting TSP [Slides][Video recording ft. Jannis]
    Based on the same-named paper with Jannis Blauth.

    • DACO Seminar, ETH Zurich. July 27, 2023.

    • 7th Colloquium of Research Area C3, Hausdorff Center for Mathematics, Bonn. June 30, 2023.

    • Seminar of the Institute for Discrete Mathematics, Bonn. December 14, 2022.

  • Advances on Strictly Delta-Modular IPs [Slides]
    Based on the same-named paper with Christian Nöbel, Richard Santiago, and Rico Zenklusen.

    • OMS Graduate Seminar, RWTH Aachen. March 10, 2023.

    • 25th Combinatorial Optimization Workshop 2023, Aussois. January 10, 2023.

  • Congruency-Constrained Optimization [Slides]
    Based on recent work on bounded subdeterminant and congruency-constrained probems.

    • 83rd Workshop on Algorithms and Complexity (GI-Theorietag 2022), Fachgruppe Algorithmen and Fachgruppe Komplexität of the Gesellschaft für Informatik. Bonn, November 11, 2022.

    • Bonn Workshop on Combinatorial Optimization 2022, on the occasion of Bill Cook’s 65th birthday. Bonn, October 20, 2022.

  • Challenges in Congruency-Constrained Optimization [Poster]
    Poster presentation based on our research and open questions in the area.

    • 23rd Conference on Integer Programming and Combinatorial Optimization 2022, Eindhoven. June 27, 2022. Best Poster Award

  • Congruency-Constrained TU Problems Beyond the Bimodular Case [Slides]
    Based on the same-named paper with Richard Santiago and Rico Zenklusen.

    • 33rd Annual ACM-SIAM Symposium on Discrete Algorithms 2022, online. January 11, 2022.

    • Invited talk at the Hausdorff Trimester Programme “Discrete Optimization”, Hausdorff Center for Mathematics, Bonn. November 3, 2021.

  • Congruency-Constrained Optimization
    Invited talk.

    • Google Research, Zurich. March 4, 2020.

  • A New Contraction Technique with Applications to Congruency-Constrained Cuts [Slides] [Poster]
    Based on the same-named paper with Rico Zenklusen.

    • 24th Combinatorial Optimization Workshop 2020, Aussois. January 9, 2020.

    • 19th International Conference on Random Structures and Algorithms 2019, Zurich. July 19, 2019.

    • 4th Highlights of Algorithms 2019, Copenhagen. June 14, 2019. Poster presentation.

    • 20th Conference on Integer Programming and Combinatorial Optimization 2019, Ann Arbor. May 22, 2019.

  • The Travelling Salesman Problem: Recent advances in theory and some applications
    Invited talk on the Travelling Salesman Problem, giving an overview of the state of the art in theory and some applications.

    • IfA Coffee Talks, Automatic Control Laboratory, ETH Zürich. August 15, 2019.

  • A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond [Slides]
    Based on the same-named paper with Rico Zenklusen.

    • 30th Annual ACM-SIAM Symposium on Discrete Algorithms 2019, San Diego. January 08, 2019.

  • A 1.5-Approximation for Path TSP [Slides]
    Based on the same-named paper by Rico Zenklusen (appeared in SODA 2019, [Link] [Arxiv]).

    • 30th Annual ACM-SIAM Symposium on Discrete Algorithms 2019, San Diego. January 08, 2019.

    • Workshop on the Travelling Salesman Problem, Banff. September 26, 2018. [Video recording]

  • Submodular Minimization Under Congruency Constraints [Slides]
    Based on the same-named paper with Benny Sudakov and Rico Zenklusen.

    • 23rd International Symposium on Mathematical Programming 2018, Bordeaux. July 03, 2018.

    • Swiss Operations Research Days 2018, Bern. June 12, 2018.

    • 29th Annual ACM-SIAM Symposium on Discrete Algorithms 2018, New Orleans. January 08, 2018.

  • Refuting a conjecture of Goemans on bounded degree spanning trees. [Slides]
    Based on the same-named paper with Stephen R. Chestnut and Rico Zenklusen.

    • Mittagsseminar, Institute for Theoretical Computer Science, ETH Zürich. March 01, 2016.