Christoph Hunkenschröder

Orcid: 0000-0001-5580-3677

According to our database1, Christoph Hunkenschröder authored at least 13 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2024
Deciding whether a lattice has an orthonormal basis is in co-NP.
Math. Program., November, 2024

Tight Lower Bounds for Block-Structured Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023
Reducibility bounds of objective functions over the integers.
Oper. Res. Lett., November, 2023

Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube.
SIAM J. Optim., 2023

Sparse Approximation over the Cube.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Optimizing a low-dimensional convex function over a high-dimensional cube.
CoRR, 2022

2021
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
On compact representations of Voronoi cells of lattices.
Math. Program., 2020

2019
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem.
ACM Trans. Algorithms, 2019

An Algorithmic Theory of Integer Programming.
CoRR, 2019

2018
Faster Algorithms for Integer Programs with Block Structure.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016
On the Economic Efficiency of the Combinatorial Clock Auction.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016


  Loading...