Cornelius Brand
Cornelius Brand
Verified email at iuuk.mff.cuni.cz
Title
Cited by
Cited by
Year
Extensor-coding
C Brand, H Dell, T Husfeldt
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
182018
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
102016
Fine-grained dichotomies for the tutte plane and boolean# CSP
C Brand, H Dell, M Roth
Algorithmica 81 (2), 541-556, 2019
82019
Parameterized counting of trees, forests and matroid bases
C Brand, M Roth
International Computer Science Symposium in Russia, 85-98, 2017
52017
Patching Colors with Tensors
C Brand
27th Annual European Symposium on Algorithms (ESA 2019), 2019
12019
An Algorithmic Method of Partial Derivatives
C Brand, K Pratt
arXiv preprint arXiv:2005.05143, 2020
2020
Parameterized Algorithms for MILPs with Small Treedepth
C Brand, M Koutecký, S Ordyniak
arXiv preprint arXiv:1912.03501, 2019
2019
Paths and walks, forests and planes: arcadian algorithms and complexity
C Brand
Saarländische Universitäts-und Landesbibliothek, 2019
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
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–10