Tuukka Korhonen. Single-Exponential Time 2-Approximation Algorithm for Treewidth
55:32
Tuukka Korhonen. Single-Exponential Time 2-Approximation Algorithm for Treewidth
Michal Wlodarczyk. Vertex Deletion Parameterized by Elimination Distance and Even Less
43:38
Michal Wlodarczyk. Vertex Deletion Parameterized by Elimination Distance and Even Less
Sebastian Siebertz. Twinwidth and Permutations
1:08:24
Sebastian Siebertz. Twinwidth and Permutations
Eduard Eiben. Removing Connected Obstacles in the Plane is FPT
1:05:08
Eduard Eiben. Removing Connected Obstacles in the Plane is FPT
Sitan Chen. Learning Deep ReLU Networks is Fixed-Parameter Tractable
58:32
Sitan Chen. Learning Deep ReLU Networks is Fixed-Parameter Tractable
Sandor Kisfaludi-Bak. Planar Steiner Tree With Terminals On Few Faces
1:01:12
Sandor Kisfaludi-Bak. Planar Steiner Tree With Terminals On Few Faces
Fahad Panolan. Hitting topological minors is FPT
1:00:04
Fahad Panolan. Hitting topological minors is FPT
Danil Sagunov. Algorithmic Extensions of Dirac's Theorem
1:05:17
Danil Sagunov. Algorithmic Extensions of Dirac's Theorem
Bart Jansen. Algebraic Sparsification for Decision and Maximization Constraint Satisfaction Problems
1:01:48
Bart Jansen. Algebraic Sparsification for Decision and Maximization Constraint Satisfaction Problems
Magnus Wahlstrom. Quasipolynomial multicut-mimicking networks and kernelization of multiway cut
56:34
Magnus Wahlstrom. Quasipolynomial multicut-mimicking networks and kernelization of multiway cut
Parinya Chalermsook. Vertex Sparsification for Edge Connectivity
51:58
Parinya Chalermsook. Vertex Sparsification for Edge Connectivity
Karol Wegrzycki. Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
55:52
Karol Wegrzycki. Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
Karthik Chandrasekaran. Hypergraph k-cut for fixed k in deterministic polynomial time
55:18
Karthik Chandrasekaran. Hypergraph k-cut for fixed k in deterministic polynomial time
Ariel Kulik. Two-variable Recurrence Relations with Application to Parameterized Approximations
48:47
Ariel Kulik. Two-variable Recurrence Relations with Application to Parameterized Approximations
William Lochet. A polynomial time algorithm for the k-disjoint shortest path problem
55:28
William Lochet. A polynomial time algorithm for the k-disjoint shortest path problem
Edouard Bonnet. Twin-width
1:05:56
Edouard Bonnet. Twin-width
Meirav Zehavi. Lossy Kernelization for (Implicit) Hitting Set Problems
1:07:27
Meirav Zehavi. Lossy Kernelization for (Implicit) Hitting Set Problems
Peter Gartland. Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
59:08
Peter Gartland. Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
Karthik C. S. Towards a Unified Framework for Hardness of Approximation in P
1:02:46
Karthik C. S. Towards a Unified Framework for Hardness of Approximation in P
Pasin Manurangsi. Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise: Complexity
58:26
Pasin Manurangsi. Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise: Complexity
Kevin Pratt. Parameterized applications of multivariate polynomial differentiation
1:04:14
Kevin Pratt. Parameterized applications of multivariate polynomial differentiation
Marcin Pilipczuk. Optimal Discretization is Fixed-parameter Tractable
1:06:07
Marcin Pilipczuk. Optimal Discretization is Fixed-parameter Tractable
Martin Grohe. Polylogarithmic Parameterized Algorithms for the Graph Isomorphism Problem
1:04:41
Martin Grohe. Polylogarithmic Parameterized Algorithms for the Graph Isomorphism Problem
Edith Elkind. Hedonic diversity games (Correction in the description)
59:02
Edith Elkind. Hedonic diversity games (Correction in the description)
Hans Bodlaender: Typical Sequences Revisited - Computing Width Parameters of Graphs
1:03:36
Hans Bodlaender: Typical Sequences Revisited - Computing Width Parameters of Graphs
Daniel Marx. Incompressibility of H-free edge modification problems: Towards dichotomy
1:08:07
Daniel Marx. Incompressibility of H-free edge modification problems: Towards dichotomy
Michal Pilipczuk: Beyond Sparsity
1:09:57
Michal Pilipczuk: Beyond Sparsity
Vincent Cohen-Added: On the Parameterized Complexity of Various Clustering Problems
1:01:59
Vincent Cohen-Added: On the Parameterized Complexity of Various Clustering Problems
Jason Li: Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
1:05:51
Jason Li: Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
Daniel Lokshtanov: A Parameterized Approximation Scheme for k-Min Cut
1:04:14
Daniel Lokshtanov: A Parameterized Approximation Scheme for k-Min Cut