default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan-Hendrik Lange
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Bjoern Andres
, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange:
A polyhedral study of lifted multicuts. Discret. Optim. 47: 100757 (2023)- 2022
- [i6]Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange:
A Polyhedral Study of Lifted Multicuts. CoRR abs/2202.08068 (2022) - 2021
- [c7]Jan-Hendrik Lange, Paul Swoboda:
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams. ICML 2021: 6000-6010 - 2020
- [b1]Jan-Hendrik Lange:
Multicut optimization guarantees & geometry of lifted multicuts. Saarland University, Germany, 2020 - [j1]Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse recovery with integrality constraints. Discret. Appl. Math. 283: 346-366 (2020) - [c6]Jan-Hendrik Lange, Björn Andres:
On the Lifted Multicut Polytope for Trees. GCPR 2020: 360-372 - [i5]Jan-Hendrik Lange:
Flow-Partitionable Signed Graphs. CoRR abs/2005.01536 (2020)
2010 – 2019
- 2019
- [c5]Jan-Hendrik Lange, Bjoern Andres, Paul Swoboda:
Combinatorial Persistency Criteria for Multicut and Max-Cut. CVPR 2019: 6093-6102 - 2018
- [c4]Emanuel Laude, Jan-Hendrik Lange, Jonas Schüpfer, Csaba Domokos, Laura Leal-Taixé, Frank R. Schmidt, Bjoern Andres, Daniel Cremers:
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs. CVPR 2018: 1614-1624 - [c3]Jan-Hendrik Lange, Andreas Karrenbauer, Bjoern Andres:
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering. ICML 2018: 2898-2907 - 2017
- [c2]Markus Rempfler, Jan-Hendrik Lange, Florian Jug, Corinna Blasse, Eugene W. Myers, Bjoern H. Menze, Bjoern Andres:
Efficient Algorithms for Moral Lineage Tracing. ICCV 2017: 4705-4714 - [c1]Andrea Hornáková, Jan-Hendrik Lange, Bjoern Andres:
Analysis and Optimization of Graph Decompositions by Lifted Multicuts. ICML 2017: 1539-1548 - [i4]Markus Rempfler, Jan-Hendrik Lange, Florian Jug, Corinna Blasse, Eugene W. Myers, Bjoern H. Menze, Bjoern Andres:
Efficient Algorithms for Moral Lineage Tracing. CoRR abs/1702.04111 (2017) - [i3]Emanuel Laude, Jan-Hendrik Lange, Frank R. Schmidt, Bjoern Andres, Daniel Cremers:
Discrete-Continuous Splitting for Weakly Supervised Learning. CoRR abs/1705.05020 (2017) - [i2]Jan-Hendrik Lange, Bjoern Andres:
Decomposition of Trees and Paths via Correlation. CoRR abs/1706.06822 (2017) - 2016
- [i1]Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse Recovery With Integrality Constraints. CoRR abs/1608.08678 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
