Cornelius Brand

Address:
Cornelius Brand
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HF0413
Phone:	+43(1)58801–192117
Email:	cbrand@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/cbrand/

9 results

2021
[9]	A note on the approximability of deepest-descent circuit steps Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký Oper. Res. Lett., volume 49, number 3, pages 310–315, 2021. [bibtex] [pdf] [doi]
[8]	Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials Cornelius Brand, Kevin Pratt 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 38:1–38:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[7]	Parameterized Algorithms for MILPs with Small Treedepth Cornelius Brand, Martin Koutecký, Sebastian Ordyniak Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pages 12249–12257, 2021, AAAI Press. [bibtex] [pdf]
2019
[6]	Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP Cornelius Brand, Holger Dell, Marc Roth Algorithmica, volume 81, number 2, pages 541–556, 2019. [bibtex] [pdf] [doi]
[5]	Patching Colors with Tensors Cornelius Brand 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), volume 144 of LIPIcs, pages 25:1–25:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
2018
[4]	Extensor-coding Cornelius Brand, Holger Dell, Thore Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018 (Ilias Diakonikolas, David Kempe, Monika Henzinger, eds.), pages 151–164, 2018, ACM. [bibtex] [pdf] [doi]
2017
[3]	Parameterized Counting of Trees, Forests and Matroid Bases Cornelius Brand, Marc Roth Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings (Pascal Weil, ed.), volume 10304 of Lecture Notes in Computer Science, pages 85–98, 2017, Springer. [bibtex] [pdf] [doi]
2016
[2]	Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP Cornelius Brand, Holger Dell, Marc Roth 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark (Jiong Guo, Danny Hermelin, eds.), volume 63 of LIPIcs, pages 9:1–9:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[1]	On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection Cornelius Brand, Michael Sagraloff Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016 (Sergei A. Abramov, Eugene V. Zima, Xiao-Shan Gao, eds.), pages 151–158, 2016, ACM. [bibtex] [pdf] [doi]