Jakob Greilhuber

MFCS International Symposium on Mathematical Foundations of Computer Science (MFCS) A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth

European Symposium on Algorithms (ESA) Faster Exponential Algorithms For Multi-Machine Scheduling Problems

European Symposium on Algorithms (ESA) Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-eta Deletion

Symposium on Theoretical Aspects of Computer Science (STACS) Residue Domination in Bounded-Treewidth Graphs

International Symposium on Parameterized and Exact Computation (IPEC) Component Order Connectivity admits no polynomial kernel parameterized by the distance to subdivided comb graphs