SIAM Journal on Discrete Mathematics From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
European Symposium on Algorithms (ESA) Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-η Deletion
European Symposium on Algorithms (ESA) Faster Exponential Algorithms For Multi-Machine Scheduling Problems
European Symposium on Algorithms (ESA) The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
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