Jan-Hendrik Lange

According to our database1, Jan-Hendrik Lange authored at least 13 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A polyhedral study of lifted multicuts.
Discret. Optim., February, 2023

2021
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Multicut optimization guarantees & geometry of lifted multicuts.
PhD thesis, 2020

Sparse recovery with integrality constraints.
Discret. Appl. Math., 2020

Flow-Partitionable Signed Graphs.
CoRR, 2020

On the Lifted Multicut Polytope for Trees.
Proceedings of the Pattern Recognition - 42nd DAGM German Conference, DAGM GCPR 2020, Tübingen, Germany, September 28, 2020

2019
Combinatorial Persistency Criteria for Multicut and Max-Cut.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering.
Proceedings of the 35th International Conference on Machine Learning, 2018

Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

2017
Discrete-Continuous Splitting for Weakly Supervised Learning.
CoRR, 2017

Decomposition of Trees and Paths via Correlation.
CoRR, 2017

Analysis and Optimization of Graph Decompositions by Lifted Multicuts.
Proceedings of the 34th International Conference on Machine Learning, 2017

Efficient Algorithms for Moral Lineage Tracing.
Proceedings of the IEEE International Conference on Computer Vision, 2017


  Loading...