On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. - Cornelius Brand; Michael Sagraloff (ISSAC, 2016)

Parameterized Counting of Trees, Forests and Matroid Bases. - Cornelius Brand; Marc Roth (CSR, 2017)

Extensor-coding. - Cornelius Brand; Holger Dell; Thore Husfeldt (STOC, 2018)

Patching Colors with Tensors. - Cornelius Brand (ESA, 2019)

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. - Cornelius Brand; Holger Dell; Marc Roth (Algorithmica, 2019)

Paths and walks, forests and planes. - Cornelius Brand (2019)

An Algorithmic Method of Partial Derivatives. - Cornelius Brand; Kevin Pratt (CoRR, 2020)

Parameterized Algorithms for MILPs with Small Treedepth. - Cornelius Brand; Martin Koutecký; Sebastian Ordyniak (AAAI, 2021)

Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials. - Cornelius Brand; Kevin Pratt (ICALP, 2021)

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (CoRR, 2021)

A note on the approximability of deepest-descent circuit steps. - Steffen Borgwardt; Cornelius Brand; Andreas Emil Feldmann; Martin Koutecký (Oper. Res. Lett., 2021)

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. - Cornelius Brand; Esra Ceylan; Robert Ganian; Christian Hatschka; Viktoriia Korchemna (WG, 2022)

A note on algebraic techniques for subgraph detection. - Cornelius Brand (Inf. Process. Lett., 2022)

Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms. - Cornelius Brand (J. Comput. Syst. Sci., 2022)

A Parameterized Theory of PAC Learning. - Cornelius Brand; Robert Ganian; Kirill Simonov (AAAI, 2023)

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. - Cornelius Brand; Robert Ganian; Sebastian Röder; Florian Schager (GD (2), 2023)

Fast Convolutions for Near-Convex Sequences. - Cornelius Brand; Alexandra Lassota (ISAAC, 2023)

A Polyhedral Perspective on Tropical Convolutions. - Cornelius Brand; Martin Koutecký; Alexandra Lassota (IWOCA, 2023)

Deterministic Constrained Multilinear Detection. - Cornelius Brand; Viktoriia Korchemna; Michael Skotnica (MFCS, 2023)

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training. - Cornelius Brand; Robert Ganian; Mathis Rocton (NeurIPS, 2023)

Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (ESA, 2024)

The Boundaries of Tractability in Hierarchical Task Network Planning. - Cornelius Brand; Robert Ganian; Fionn Mc Inerney; Simon Wietheger (CoRR, 2024)

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs. - Cornelius Brand; Robert Ganian; Sebastian Röder; Florian Schager (J. Graph Algorithms Appl., 2024)

Counting vanishing matrix-vector products. - Cornelius Brand; Viktoriia Korchemna; Kirill Simonov; Michael Skotnica (Theor. Comput. Sci., 2024)

The complexity of optimizing atomic congestion. - Cornelius Brand; Robert Ganian; Subrahmanyam Kalyanasundaram; Fionn Mc Inerney (Artif. Intell., 2025)

Faster Convolutions: Yates and Strassen Revisited. - Cornelius Brand; Radu Curticapean; Baitian Li; Kevin Pratt (CoRR, 2025)