default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Hertrich
Person information
- affiliation: University of Technology Nuremberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Christoph Hertrich:
Facets of neural network complexity. Technical University of Berlin, Germany, 2022
Journal Articles
- 2025
- [j7]Christoph Hertrich
, Leon Sering:
ReLU neural networks of polynomial size for exact maximum flow computation. Math. Program. 210(1): 377-406 (2025) - 2023
- [j6]Christoph Hertrich, Martin Skutella:
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. INFORMS J. Comput. 35(5): 1079-1097 (2023) - [j5]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. SIAM J. Discret. Math. 37(2): 997-1029 (2023) - 2022
- [j4]Christoph Hertrich, Felix Schröder, Raphael Steiner:
Coloring Drawings of Graphs. Electron. J. Comb. 29(1) (2022) - [j3]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. J. Artif. Intell. Res. 74: 1775-1790 (2022) - [j2]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online algorithms to schedule a proportionate flexible flow shop of batching machines. J. Sched. 25(6): 643-657 (2022) - 2020
- [j1]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a proportionate flow shop of batching machines. J. Sched. 23(5): 575-593 (2020)
Conference and Workshop Papers
- 2025
- [c13]Vincent Froese, Moritz Grillo, Christoph Hertrich, Martin Skutella:
Open Problem: Fixed-Parameter Tractability of Zonotope Problems. COLT 2025: 6210-6214 - [c12]Marie-Charlotte Brandenburg, Moritz Leo Grillo, Christoph Hertrich:
Decomposition Polyhedra of Piecewise Linear Functions. ICLR 2025 - 2024
- [c11]Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. IPCO 2024: 57-70 - 2023
- [c10]Christian Haase, Christoph Hertrich, Georg Loho:
Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes. ICLR 2023 - [c9]Christoph Hertrich, Leon Sering:
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation. IPCO 2023: 187-202 - [c8]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS 2023 - [c7]Vincent Froese, Christoph Hertrich:
Training Neural Networks is NP-Hard in Fixed Dimension. NeurIPS 2023 - [c6]Christoph Hertrich, Yixin Tao, László A. Végh:
Mode Connectivity in Auction Design. NeurIPS 2023 - 2021
- [c5]Christoph Hertrich, Martin Skutella:
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. AAAI 2021: 7685-7693 - [c4]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. NeurIPS 2021: 3336-3348 - 2019
- [c3]Christoph Hertrich:
Scheduling a Proportionate Flow Shop of Batching Machines. OR 2019: 27-33 - [c2]Heiner Ackermann, Erik Diessel, Michael Helmling, Christoph Hertrich, Neil Jami, Johanna Schneider:
Decision Support for Material Procurement. OR 2019: 693-699 - 2018
- [c1]Christoph Hertrich, Philipp Hungerländer, Christian Truden:
Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows. OR 2018: 127-133
Informal and Other Publications
- 2025
- [i19]Moritz Grillo, Christoph Hertrich, Georg Loho:
Depth-Bounds for Neural Networks via the Braid Arrangement. CoRR abs/2502.09324 (2025) - [i18]Egor Bakaev, Florestan Brunck, Christoph Hertrich, Daniel Reichman, Amir Yehudayoff:
On the Depth of Monotone ReLU Neural Networks and ICNNs. CoRR abs/2505.06169 (2025) - [i17]Egor Bakaev, Florestan Brunck, Christoph Hertrich, Jack Stade, Amir Yehudayoff:
Better Neural Network Expressivity: Subdividing the Simplex. CoRR abs/2505.14338 (2025) - [i16]Moritz Stargalla, Christoph Hertrich, Daniel Reichman:
The Computational Complexity of Counting Linear Regions in ReLU Neural Networks. CoRR abs/2505.16716 (2025) - 2024
- [i15]Marie-Charlotte Brandenburg, Moritz Grillo, Christoph Hertrich:
Decomposition Polyhedra of Piecewise Linear Functions. CoRR abs/2410.04907 (2024) - [i14]Christoph Hertrich, Georg Loho:
Neural Networks and (Virtual) Extended Formulations. CoRR abs/2411.03006 (2024) - 2023
- [i13]Christian Haase, Christoph Hertrich, Georg Loho:
Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes. CoRR abs/2302.12553 (2023) - [i12]Vincent Froese, Christoph Hertrich:
Training Neural Networks is NP-Hard in Fixed Dimension. CoRR abs/2303.17045 (2023) - [i11]Christoph Hertrich, Yixin Tao, László A. Végh:
Mode Connectivity in Auction Design. CoRR abs/2305.11005 (2023) - [i10]Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR abs/2311.01959 (2023) - 2022
- [i9]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. CoRR abs/2204.01368 (2022) - 2021
- [i8]Christoph Hertrich, Leon Sering:
ReLU Neural Networks for Exact Maximum Flow Computation. CoRR abs/2102.06635 (2021) - [i7]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR abs/2105.08675 (2021) - [i6]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. CoRR abs/2105.14835 (2021) - 2020
- [i5]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines. CoRR abs/2005.03552 (2020) - [i4]Christoph Hertrich, Martin Skutella:
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. CoRR abs/2005.14105 (2020) - [i3]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a Proportionate Flow Shop of Batching Machines. CoRR abs/2006.09872 (2020) - [i2]Christoph Hertrich, Felix Schröder, Raphael Steiner:
Coloring Drawings of Graphs. CoRR abs/2008.09692 (2020) - 2019
- [i1]Christoph Hertrich, Philipp Hungerländer, Christian Truden:
Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Window. CoRR abs/1901.02771 (2019)
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 2025-08-21 01:55 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:
