SIAM Journal on Discrete Mathematics From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
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) Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-eta Deletion
European Symposium on Algorithms (ESA) Faster Exponential Algorithms For Multi-Machine Scheduling Problems
STOC '26: 58th Annual ACM Symposium on Theory of Computing Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs