Jan-Hendrik Lange

Max Planck Institute for Informatics — Germany

Computer Science · Physical Sciences

5h-index92citations21works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(6), Advanced Graph Theory Research(5), Sparse and Compressive Sensing Techniques(5), Machine Learning and Algorithms(5), VLSI and FPGA Design Techniques(4)

Publications21 total

Corrigendum to “A polyhedral study of lifted multicuts” [Discrete Optim. 47 (2023) 100757]
Discrete Optimization·2025Open Access
Optimization methods for the capacitated refueling station location problem with routing
arXiv (Cornell University)·2023· 1 citedOpen Access
A polyhedral study of lifted multicuts
Discrete Optimization·2023· 5 citedOpen Access
A Polyhedral Study of Lifted Multicuts
arXiv (Cornell University)·2022Open Access
On the Lifted Multicut Polytope for Trees
Lecture notes in computer science·2021· 4 cited
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
arXiv (Cornell University)·2020· 3 citedOpen Access
Flow-Partitionable Signed Graphs
arXiv (Cornell University)·2020· 1 citedOpen Access
Sparse recovery with integrality constraints
Discrete Applied Mathematics·2020· 1 citedOpen Access
Multicut Optimization Guarantees & Geometry of Lifted Multicuts
Publications of the UdS (Saarland University)·2020· 1 citedOpen Access
Combinatorial Persistency Criteria for Multicut and Max-Cut
2019· 1 citedOpen Access
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering
MPG.PuRe (Max Planck Society)·2018· 10 citedOpen Access
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
2018· 10 cited
Efficient Algorithms for Moral Lineage Tracing
2017· 13 cited
Analysis and Optimization of Graph Decompositions by Lifted Multicuts
Max Planck Digital Library·2017· 23 citedOpen Access
Decomposition of Trees and Paths via Correlation
arXiv (Cornell University)·2017Open Access
Discrete-Continuous Splitting for Weakly Supervised Learning
arXiv (Cornell University)·2017Open Access
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
arXiv (Cornell University)·2017Open Access
Efficient Algorithms for Moral Lineage Tracing
arXiv (Cornell University)·2017· 1 citedOpen Access
Analysis and Optimization of Graph Decompositions by Lifted Multicuts
arXiv (Cornell University)·2015· 13 citedOpen Access
A hierarchical graph oriented compaction system for symbolic layout
2003· 1 cited
page 1 of 2Next →

Frequent Co-authors

Bjoern Andres(14), Emanuel Laude(3), Daniel Cremers(3), Silvia Di Gregorio(3), Jannik Irmai(3), Andrea Horňáková(2), Markus Rempfler(2), Florian Jug(2), Corinna Blasse(2), Eugene W. Myers(2), Bjoern Menze(2), Jonas Schüpfer(2), Csaba Domokos(2), Laura Leal-Taixé(2), Frank R. Schmidt(2), Annkristin Lange(2), Paul Swoboda(2), Andreas Karrenbauer(1), J.F. Vink(1), Marc E. Pfetsch(1)