1 citations · 1 across the 2 of their papers we have counts for
7 papers
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Cornelius Brand, Esra Ceylan, Christian Hatschka +2
Decompositional parameters such as treewidth are commonly used to obtain fixed-parameter algorithms for NP-hard graph problems. For problems that are W[1]-hard parameterized by tre…
A Note on the Approximability of Deepest-Descent Circuit Steps
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann +1
Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent steps (dd-steps). Computing t…
An Algorithmic Method of Partial Derivatives
Cornelius Brand, Kevin Pratt
We study the following problem and its applications: given a homogeneous degree- polynomial as an arithmetic circuit, and a matrix whose entries are homogen…
Parameterized Algorithms for MILPs with Small Treedepth
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Solving (mixed) integer linear programs, (M)ILPs for short, is a fundamental optimization task. While hard in general, recent years have brought about vast progress for solving str…
Extensor-Coding
Cornelius Brand, Holger Dell, Thore Husfeldt
We devise an algorithm that approximately computes the number of paths of length in a given directed graph with vertices up to a multiplicative error of …
Fine-grained dichotomies for the Tutte plane and Boolean #CSP
Cornelius Brand, Holger Dell, Marc Roth
Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the rema…