Efficient Algorithms for Moral Lineage Tracing. - Markus Rempfler; Jan-Hendrik Lange; Florian Jug; Corinna Blasse; Eugene W. Myers; Bjoern H. Menze; Bjoern Andres (ICCV, 2017)

Analysis and Optimization of Graph Decompositions by Lifted Multicuts. - Andrea Hornáková; Jan-Hendrik Lange; Bjoern Andres (ICML, 2017)

Decomposition of Trees and Paths via Correlation. - Jan-Hendrik Lange; Bjoern Andres (CoRR, 2017)

Discrete-Continuous Splitting for Weakly Supervised Learning. - Emanuel Laude; Jan-Hendrik Lange; Frank R. Schmidt; Bjoern Andres; Daniel Cremers (CoRR, 2017)

Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs. - Emanuel Laude; Jan-Hendrik Lange; Jonas Schüpfer; Csaba Domokos; Laura Leal-Taixé; Frank R. Schmidt; Bjoern Andres; Daniel Cremers (CVPR, 2018)

Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering. - Jan-Hendrik Lange; Andreas Karrenbauer; Bjoern Andres (ICML, 2018)

Combinatorial Persistency Criteria for Multicut and Max-Cut. - Jan-Hendrik Lange; Bjoern Andres; Paul Swoboda (CVPR, 2019)

On the Lifted Multicut Polytope for Trees. - Jan-Hendrik Lange; Björn Andres (GCPR, 2020)

Flow-Partitionable Signed Graphs. - Jan-Hendrik Lange (CoRR, 2020)

Sparse recovery with integrality constraints. - Jan-Hendrik Lange; Marc E. Pfetsch; Bianca M. Seib; Andreas M. Tillmann (Discret. Appl. Math., 2020)

Multicut optimization guarantees & geometry of lifted multicuts. - Jan-Hendrik Lange (2020)

Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams. - Jan-Hendrik Lange; Paul Swoboda (ICML, 2021)

A polyhedral study of lifted multicuts. - Bjoern Andres; Silvia Di Gregorio; Jannik Irmai; Jan-Hendrik Lange (Discret. Optim., 2023)

Corrigendum to "A polyhedral study of lifted multicuts" [Discrete Optim. 47 (2023) 100757]. - Bjoern Andres; Silvia Di Gregorio; Jannik Irmai; Jan-Hendrik Lange (Discret. Optim., 2025)