Frontiers of Parameterized Complexity

External homepage

data structures and algorithms

Audience: Researchers in the topic
Seminar series time: Thursday 15:00-16:00 in your time zone, UTC
Organizers: Fedor Fomin, Saket Saurabh, Roohani Sharma*
*contact for this listing

Link to the zoom meeting: uib.zoom.us/j/4231169675 Meeting ID: 423 116 9675 Password: Name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.

Upcoming talks
Past talks
Your timeSpeakerTitle
ThuApr 0815:00Eduard EibenRemoving Connected Obstacles in the Plane is FPT
ThuMar 2516:00Sitan ChenLearning Deep ReLU Networks is Fixed-Parameter Tractable
ThuMar 1816:00S\'andor Kisfaludi-BakPlanar Steiner Tree With Terminals On Few Faces
ThuMar 1116:00Fahad PanolanHitting topological minors is FPT
ThuMar 0416:00Danil SagunovAlgorithmic Extensions of Dirac's Theorem
ThuFeb 2516:00Bart JansenAlgebraic Sparsification for Decision and Maximization Constraint Satisfaction Problems
ThuFeb 1816:00Magnus WahlstromQuasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
ThuDec 1016:00Chalermsook ParinyaVertex Sparsification for Edge Connectivity
ThuNov 2616:00Karol WegrzyckiImproving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
ThuNov 1216:00Karthik ChandrasekaranHypergraph k-cut for fixed k in deterministic polynomial time
ThuOct 2916:00Ariel KulikAnalysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
ThuOct 2215:00Ariel KulikTBA
ThuOct 1515:00William LochetA polynomial time algorithm for the $k$-disjoint shortest path problem
ThuOct 0115:00Edouard BonnetTwin-width
ThuSep 1715:00Meirav ZehaviLossy Kernelization for (Implicit) Hitting Set Problems
ThuSep 1015:00Peter GartlandIndependent Set on P_k-Free Graphs in Quasi-Polynomial Time
ThuAug 2715:00Karthik C.S.Towards a Unified Framework for Hardness of Approximation in P
ThuAug 2015:00Pasin ManurangsiThe Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise
ThuAug 1315:00Kevin PrattParameterized applications of multivariate polynomial differentiation
ThuJun 2515:00Marcin PilipczukOptimal Discretization is Fixed-parameter Tractable
ThuJun 1815:00Martin GrohePolylogarithmic parameterized algorithms for the graph isomorphism problem: From bounded degree to excluded minors
ThuJun 1115:00Edith ElkindHedonic diversity games
ThuJun 0415:00Hans BodlaenderTypical sequences revisited - computing width parameters of graphs
ThuMay 2815:00Daniel MarxIncompressibility of H-free edge modification problems: Towards dichotomy
ThuMay 2115:00Michal PilipczukBeyond Sparsity
Embed this schedule
Export series to