Cornelius Brand

44 papers A* 7A 2B 6C 1Misc 1Journal 24Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Beyond Bilinear Complexity: What Works and What Breaks with Many Modes? CoRR Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026	J	`jnl`	Beyond Bilinear Complexity: What Works and What Breaks with Many Modes? Electron. Colloquium Comput. Complex. Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang
2026	—	`conf`	Faster Convolutions: Yates and Strassen Revisited. SOSA Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt
2025	A*	`conf`	A Structural Complexity Analysis of Hierarchical Task Network Planning. IJCAI Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger
2025	J	`jnl`	Faster Convolutions: Yates and Strassen Revisited. CoRR Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt
2025	J	`jnl`	The complexity of optimizing atomic congestion. Artif. Intell. Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2024	B	`conf`	Counting Vanishing Matrix-Vector Products. WALCOM Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
2024	J	`jnl`	Counting vanishing matrix-vector products. Theor. Comput. Sci. Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
2024	J	`jnl`	Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs. J. Graph Algorithms Appl. Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
2024	A	`conf`	Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. ESA Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
2024	J	`jnl`	The Boundaries of Tractability in Hierarchical Task Network Planning. CoRR Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger
2024	A*	`conf`	The Complexity of Optimizing Atomic Congestion. AAAI Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2023	A*	`conf`	A Parameterized Theory of PAC Learning. AAAI Cornelius Brand, Robert Ganian, Kirill Simonov
2023	J	`jnl`	A Parameterized Theory of PAC Learning. CoRR Cornelius Brand, Robert Ganian, Kirill Simonov
2023	C	`conf`	A Polyhedral Perspective on Tropical Convolutions. IWOCA Cornelius Brand, Martin Koutecký, Alexandra Lassota
2023	J	`jnl`	Counting Vanishing Matrix-Vector Products. CoRR Cornelius Brand, Viktoriia Korchemna, Michael Skotnica, Kirill Simonov
2023	B	`conf`	Deterministic Constrained Multilinear Detection. MFCS Cornelius Brand, Viktoriia Korchemna, Michael Skotnica
2023	B	`conf`	Fast Convolutions for Near-Convex Sequences. ISAAC Cornelius Brand, Alexandra Lassota
2023	—	`conf`	Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. GD (2) Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
2023	J	`jnl`	Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. CoRR Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
2023	A*	`conf`	New Complexity-Theoretic Frontiers of Tractability for Neural Network Training. NeurIPS Cornelius Brand, Robert Ganian, Mathis Rocton
2023	J	`jnl`	The Complexity of Optimizing Atomic Congestion. CoRR Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2022	J	`jnl`	A note on algebraic techniques for subgraph detection. Inf. Process. Lett. Cornelius Brand
2022	J	`jnl`	Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms. J. Comput. Syst. Sci. Cornelius Brand
2022	B	`conf`	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. WG Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
2022	J	`jnl`	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. CoRR Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna
2021	J	`jnl`	A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
2021	A*	`conf`	Parameterized Algorithms for MILPs with Small Treedepth. AAAI Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
2021	A*	`conf`	Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials. ICALP Cornelius Brand, Kevin Pratt
2021	J	`jnl`	Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
2020	J	`jnl`	A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
2020	J	`jnl`	An Algorithmic Method of Partial Derivatives. CoRR Cornelius Brand, Kevin Pratt
2019	J	`jnl`	Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Algorithmica Cornelius Brand, Holger Dell, Marc Roth
2019	J	`jnl`	Parameterized Algorithms for MILPs with Small Treedepth. CoRR Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
2019	A	`conf`	Patching Colors with Tensors. ESA Cornelius Brand
2019	—	`—`	Paths and walks, forests and planes. Cornelius Brand
2018	J	`jnl`	Extensor-Coding. CoRR Cornelius Brand, Holger Dell, Thore Husfeldt
2018	A*	`conf`	Extensor-coding. STOC Cornelius Brand, Holger Dell, Thore Husfeldt
2017	Misc	`conf`	Parameterized Counting of Trees, Forests and Matroid Bases. CSR Cornelius Brand, Marc Roth
2016	B	`conf`	Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. IPEC Cornelius Brand, Holger Dell, Marc Roth
2016	J	`jnl`	Fine-grained dichotomies for the Tutte plane and Boolean #CSP. CoRR Cornelius Brand, Holger Dell, Marc Roth
2016	B	`conf`	On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. ISSAC Cornelius Brand, Michael Sagraloff
2016	J	`jnl`	On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. CoRR Cornelius Brand, Michael Sagraloff
2016	J	`jnl`	Parameterized counting of trees, forests and matroid bases. CoRR Cornelius Brand, Marc Roth