default search action
Christoph Hunkenschröder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Christoph Hunkenschröder
:
Deciding whether a lattice has an orthonormal basis is in co-NP. Math. Program. 208(1): 763-775 (2024) - [c6]Christoph Hunkenschröder
Tight Lower Bounds for Block-Structured Integer Programs. IPCO 2024: 224-237 - [i8]Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. CoRR abs/2402.17290 (2024) - 2023
- [j4]Friedrich Eisenbrand
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023) - [j3]Christoph Hunkenschröder
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube. SIAM J. Optim. 33(2): 538-552 (2023) - [c5]Sabrina Bruckmeier
Sparse Approximation over the Cube. IPCO 2023: 44-57 - 2022
- [i7]Christoph Hunkenschröder, Sebastian Pokutta, Robert Weismantel:
Optimizing a low-dimensional convex function over a high-dimensional cube. CoRR abs/2204.05266 (2022) - [i6]Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel:
Sparse Approximation Over the Cube. CoRR abs/2210.02738 (2022) - 2021
- [c4]Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA 2021: 1666-1681 - 2020
- [j2]Christoph Hunkenschröder
On compact representations of Voronoi cells of lattices. Math. Program. 183(1): 337-358 (2020)
2010 – 2019
- 2019
- [j1]Christoph Hunkenschröder, Santosh S. Vempala, Adrian Vetta:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem. ACM Trans. Algorithms 15(4): 55:1-55:28 (2019) - [c3]Christoph Hunkenschröder
On Compact Representations of Voronoi Cells of Lattices. IPCO 2019: 261-274 - [i5]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019) - [i4]Christoph Hunkenschröder:
Deciding whether a Lattice has an Orthonormal Basis is in co-NP. CoRR abs/1910.03838 (2019) - 2018
- [c2]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
Faster Algorithms for Integer Programs with Block Structure. ICALP 2018: 49:1-49:13 - [i3]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
Faster Algorithms for Integer Programs with Block Structure. CoRR abs/1802.06289 (2018) - [i2]Christoph Hunkenschröder, Gina Reuland, Matthias Schymura:
On compact representations of Voronoi cells of lattices. CoRR abs/1811.08532 (2018) - 2016
- [c1]Nicolas Bousquet
On the Economic Efficiency of the Combinatorial Clock Auction. SODA 2016: 1407-1423 - 2015
- [i1]Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta:
On the Economic Efficiency of the Combinatorial Clock Auction. CoRR abs/1507.06495 (2015)
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-12-10 20:51 CET 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: