Christoph Hertrich

Orcid: 0000-0001-5646-8567

According to our database1, Christoph Hertrich authored at least 18 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards Lower Bounds on the Depth of ReLU Neural Networks.
SIAM J. Discret. Math., June, 2023

A First Order Method for Linear Programming Parameterized by Circuit Imbalance.
CoRR, 2023

Mode Connectivity in Auction Design.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Training Neural Networks is NP-Hard in Fixed Dimension.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Training Fully Connected Neural Networks is ∃R-Complete.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Facets of neural network complexity.
PhD thesis, 2022

Online algorithms to schedule a proportionate flexible flow shop of batching machines.
J. Sched., 2022

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality.
J. Artif. Intell. Res., 2022

Coloring Drawings of Graphs.
Electron. J. Comb., 2022

2021
ReLU Neural Networks for Exact Maximum Flow Computation.
CoRR, 2021

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Scheduling a proportionate flow shop of batching machines.
J. Sched., 2020

2019
Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Window.
CoRR, 2019

Scheduling a Proportionate Flow Shop of Batching Machines.
Proceedings of the Operations Research Proceedings 2019, 2019

Decision Support for Material Procurement.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows.
Proceedings of the Operations Research Proceedings 2018, 2018


  Loading...