Cornelius Brand
Cornelius Brand
Verified email at - Homepage
TitleCited byYear
C Brand, H Dell, T Husfeldt
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
On the complexity of solving zero-dimensional polynomial systems via projection
C Brand, M Sagraloff
Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016
Fine-grained dichotomies for the tutte plane and boolean# CSP
C Brand, H Dell, M Roth
Algorithmica 81 (2), 541-556, 2019
Parameterized counting of trees, forests and matroid bases
C Brand, M Roth
International Computer Science Symposium in Russia, 85-98, 2017
Patching Colors with Tensors
C Brand
27th Annual European Symposium on Algorithms (ESA 2019), 2019
Paths and walks, forests and planes: arcadian algorithms and complexity
C Brand
Saarländische Universitäts-und Landesbibliothek, 2019
Fine-grained dichotomies for the Tutte plane and Boolean# CSP
M Roth, C Brand, H Dell
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 63 (9), 2017
3.5 A fully polynomial randomized approximation scheme for Kostka numbers of two-row diagrams
C Brand
Computational Counting, 29, 0
The system can't perform the operation now. Try again later.
Articles 1–8