Jan-Hendrik Lange (PhD Student)

MSc Jan-Hendrik Lange

Address
Max-Planck-Institut für Informatik
Saarland Informatics Campus
Campus
Location
-
Phone
+49 681 9325 2000
Fax
+49 681 9325 2099

Personal Information

Research Interests:

  • Combinatorial Optimization
  • Applications of Mathematical Optimization in Machine Learning

Education:

  • Master of Science in Mathematics with Minor in Computer Science, Technische Universität Darmstadt, June 2016
  • Since June 2016: PhD Student at Max Planck Institute for Informatics

 

Publications

2020
Sparse Recovery with Integrality Constraints
J.-H. Lange, M. E. Pfetsch, B. M.Seib and A. M.Tillmann
Discrete Applied Mathematics, Volume 283, 2020
On the Lifted Multicut Polytope for Trees
J.-H. Lange and B. Andres
Pattern Recognition (GCPR 2020), 2020
(Accepted/in press)
Multicut Optimization Guarantees & Geometry of Lifted Multicuts
J.-H. Lange
PhD Thesis, Universität des Saarlandes, 2020
2019
Combinatorial Persistency Criteria for Multicut and Max-Cut
J.-H. Lange, B. Andres and P. Swoboda
IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR 2019), 2019
2018
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
E. Laude, J.-H. Lange, J. Schüpfer, C. Domokos, L. Leal-Taixé, F. R. Schmidt, B. Andres and D. Cremers
IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR 2018), 2018
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering
J.-H. Lange, A. Karrenbauer and B. Andres
Proceedings of the 35th International Conference on Machine Learning (ICML 2018), 2018
2017
Efficient Algorithms for Moral Lineage Tracing
M. Rempfler, J.-H. Lange, F. Jug, C. Blasse, E. W. Myers, B. H. Menze and B. Andres
IEEE International Conference on Computer Vision (ICCV 2017), 2017
Analysis and Optimization of Graph Decompositions by Lifted Multicuts
A. Horňáková, J.-H. Lange and B. Andres
Proceedings of the 34th International Conference on Machine Learning (ICML 2017), 2017