FRI, 10.07.2020, 15:30-16:30 UTC+2
Papers:
• Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
• Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
• Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem
• On the Fine-Grained Complexity of Parity Problems
• Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs
• Efficient diagonalization of symmetric matrices associated with graphs of small treewidth