| Extensor-coding C Brand, H Dell, T Husfeldt Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 40 | 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 | 21 | 2016 |
| Fine-grained dichotomies for the Tutte plane and Boolean# CSP C Brand, H Dell, M Roth Algorithmica 81, 541-556, 2019 | 19 | 2019 |
| Parameterized counting of trees, forests and matroid bases C Brand, M Roth International Computer Science Symposium in Russia, 85-98, 2017 | 12 | 2017 |
| Parameterized algorithms for MILPs with small treedepth C Brand, M Koutecký, S Ordyniak Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12249 …, 2021 | 11 | 2021 |
| Patching colors with tensors C Brand 27th Annual European Symposium on Algorithms (ESA 2019), 2019 | 11 | 2019 |
| Edge-cut width: An algorithmically driven analogue of treewidth based on edge cuts C Brand, E Ceylan, R Ganian, C Hatschka, V Korchemna International Workshop on Graph-Theoretic Concepts in Computer Science, 98-113, 2022 | 8 | 2022 |
| Parameterized applications of symbolic differentiation of (totally) multilinear polynomials C Brand, K Pratt 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 7 | 2021 |
| A parameterized theory of PAC learning C Brand, R Ganian, K Simonov Proceedings of the AAAI Conference on Artificial Intelligence 37 (6), 6834-6841, 2023 | 6 | 2023 |
| Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms C Brand Journal of Computer and System Sciences 129, 62-71, 2022 | 4 | 2022 |
| A note on the approximability of deepest-descent circuit steps S Borgwardt, C Brand, AE Feldmann, M Koutecký Operations Research Letters 49 (3), 310-315, 2021 | 4 | 2021 |
| A note on algebraic techniques for subgraph detection C Brand Information Processing Letters 176, 106242, 2022 | 3 | 2022 |
| An algorithmic method of partial derivatives C Brand, K Pratt arXiv preprint arXiv:2005.05143, 2020 | 2 | 2020 |
| Paths and walks, forests and planes. C Brand Saarland University, Germany, 2019 | 2 | 2019 |
| Fast Convolutions for Near-Convex Sequences C Brand, A Lassota 34th International Symposium on Algorithms and Computation (ISAAC 2023), 2023 | 1 | 2023 |
| Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds C Brand, M Koutechy, A Lassota, S Ordyniak Leibniz International Proceedings in Informatics, 2024 | | 2024 |
| The Complexity of Optimizing Atomic Congestion C Brand, R Ganian, S Kalyanasundaram, F Mc Inerney Proceedings of the AAAI Conference on Artificial Intelligence 38 (18), 20044 …, 2024 | | 2024 |
| Counting Vanishing Matrix-Vector Products C Brand, V Korchemna, K Simonov, M Skotnica International Conference and Workshops on Algorithms and Computation, 335-349, 2024 | | 2024 |
| New complexity-theoretic frontiers of tractability for neural network training C Brand, R Ganian, M Rocton Advances in Neural Information Processing Systems 36, 2024 | | 2024 |
| The Boundaries of Tractability in Hierarchical Task Network Planning C Brand, R Ganian, FM Inerney, S Wietheger arXiv preprint arXiv:2401.14174, 2024 | | 2024 |
Martin KouteckýCharles University在 iuuk.mff.cuni.cz 的电子邮件经过验证
