4 papers
Counting Vanishing Matrix-Vector Products
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica +1
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let…
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Cornelius Brand, Robert Ganian, Sebastian Röder +1
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly , where the number of bend…
A Parameterized Theory of PAC Learning
Cornelius Brand, Robert Ganian, Kirill Simonov
Probably Approximately Correct (i.e., PAC) learning is a core concept of sample complexity theory, and efficient PAC learnability is often seen as a natural counterpart to the clas…
Parameterized counting of trees, forests and matroid bases
Cornelius Brand, Marc Roth
We investigate the complexity of counting trees, forests and bases of matroids from a parameterized point of view. It turns out that the problems of computing the number of trees a…