1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
Jiehua Chen, Wojciech Czerwiński, Yann Disser +8
We present a data structure that in a dynamic graph of treedepth at most , which is modified over time by edge insertions and deletions, maintains an optimum-height elimination…
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee +1
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We surve…
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with vertices and integer edge weights is given together with a…