Cornelius Brand

Orcid: 0000-0002-1929-055X

According to our database1, Cornelius Brand authored at least 23 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Boundaries of Tractability in Hierarchical Task Network Planning.
CoRR, 2024

Counting Vanishing Matrix-Vector Products.
Proceedings of the WALCOM: Algorithms and Computation, 2024

The Complexity of Optimizing Atomic Congestion.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Deterministic Constrained Multilinear Detection.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

A Polyhedral Perspective on Tropical Convolutions.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Fast Convolutions for Near-Convex Sequences.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

A Parameterized Theory of PAC Learning.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

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

A note on algebraic techniques for subgraph detection.
Inf. Process. Lett., 2022

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021
A note on the approximability of deepest-descent circuit steps.
Oper. Res. Lett., 2021

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.
CoRR, 2021

Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Parameterized Algorithms for MILPs with Small Treedepth.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
An Algorithmic Method of Partial Derivatives.
CoRR, 2020

2019
Paths and walks, forests and planes.
PhD thesis, 2019

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP.
Algorithmica, 2019

Patching Colors with Tensors.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Extensor-coding.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Parameterized Counting of Trees, Forests and Matroid Bases.
Proceedings of the Computer Science - Theory and Applications, 2017

2016
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016


  Loading...