Jannik Irmai
Doctoral Student
Research Interests
My research lies in discrete optimization and its applications in machine learning. This involves studying the complexity of combinatorial optimization problems. I am particularly interested in both the development of exact algorithms via polyhedral analysis and the development of efficient approximation algorithms.
Vita
Jannik obtained a Bachelor's degree in Mathematics from the Technical University Dortmund in 2017. In 2018, he spent a semester at the University of Jyväskylä, and in 2019 he did a one-year internship with GE Aviation. After that, he studied discrete optimization and optimization under uncertainty and obtained a Master's degree in Mathematics from the Technical University Dortmund in 2021.
Awards
Publications
-
Heidrich H., Irmai J. and Andres B.
A 4-approximation algorithm for min max correlation clustering
AISTATS 2024 (accepted)
arXiv (pre-print) -
Andres B., Di Gregorio S., Irmai J. and Lange J.-H.
A Polyhedral Study of Lifted Multicuts
Discrete Optimization 47:100757, 2023
At publisher's -
Sekuboyina A., Irmai J., Shit S., Kirschke J., Andres B. and Menze B. H.
Pushing the limits of an FCN and a CRF towards near-ideal vertebrae labelling
International Symposium on Biomedical Imaging 2023
-
Buchheim C., Henke D. and Irmai J.
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective.
Journal of Optimization Theory and Applications. Springer 2022
At publisher's
Technical Reports
-
Naumann L. F., Irmai J., Zhao S. and Andres B.
Cut Facets and Cube Facets of Lifted Multicut Polytopes
ArXiv ePrint. 2024
arXiv • PDF -
Swoboda P., Andres B., Hornakova A., Bernard F., Irmai J., Roetzer P., Savchynskyy B., Stein D., Abbas A.
Structured Prediction Problem Archive
ArXiv ePrint. 2024
arXiv • PDF -
Irmai J., Zhao S., Presberger J. and Andres B.
A Graph Multi-separator Problem for Image Segmentation
ArXiv ePrint. 2023
arXiv • PDF