BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Michal Pilipczuk (University of Warsaw)
DTSTART;VALUE=DATE-TIME:20200521T150000Z
DTEND;VALUE=DATE-TIME:20200521T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/1
DESCRIPTION:Title:
Beyond Sparsity\nby Michal Pilipczuk (University of Warsaw) as part of
Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Marx (Max-Planck-Institut für Informatik)
DTSTART;VALUE=DATE-TIME:20200528T150000Z
DTEND;VALUE=DATE-TIME:20200528T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/2
DESCRIPTION:Title:
Incompressibility of H-free edge modification problems: Towards dichotomy<
/a>\nby Daniel Marx (Max-Planck-Institut für Informatik) as part of Front
iers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hans Bodlaender (Utrecht University)
DTSTART;VALUE=DATE-TIME:20200604T150000Z
DTEND;VALUE=DATE-TIME:20200604T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/3
DESCRIPTION:Title:
Typical sequences revisited - computing width parameters of graphs\nby
Hans Bodlaender (Utrecht University) as part of Frontiers of Parameterize
d Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edith Elkind (University of Oxford)
DTSTART;VALUE=DATE-TIME:20200611T150000Z
DTEND;VALUE=DATE-TIME:20200611T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/4
DESCRIPTION:Title:
Hedonic diversity games\nby Edith Elkind (University of Oxford) as par
t of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Martin Grohe (RWTH Aachen University)
DTSTART;VALUE=DATE-TIME:20200618T150000Z
DTEND;VALUE=DATE-TIME:20200618T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/5
DESCRIPTION:Title:
Polylogarithmic parameterized algorithms for the graph isomorphism problem
: From bounded degree to excluded minors\nby Martin Grohe (RWTH Aachen
University) as part of Frontiers of Parameterized Complexity\n\nAbstract:
TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marcin Pilipczuk (University of Warsaw)
DTSTART;VALUE=DATE-TIME:20200625T150000Z
DTEND;VALUE=DATE-TIME:20200625T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/6
DESCRIPTION:Title:
Optimal Discretization is Fixed-parameter Tractable\nby Marcin Pilipcz
uk (University of Warsaw) as part of Frontiers of Parameterized Complexity
\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kevin Pratt (CMU)
DTSTART;VALUE=DATE-TIME:20200813T150000Z
DTEND;VALUE=DATE-TIME:20200813T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/7
DESCRIPTION:Title:
Parameterized applications of multivariate polynomial differentiation\
nby Kevin Pratt (CMU) as part of Frontiers of Parameterized Complexity\n\n
Abstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pasin Manurangsi (Google Research)
DTSTART;VALUE=DATE-TIME:20200820T150000Z
DTEND;VALUE=DATE-TIME:20200820T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/8
DESCRIPTION:Title:
The Complexity of Adversarially Robust Proper Learning of Halfspaces with
Agnostic Noise\nby Pasin Manurangsi (Google Research) as part of Front
iers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Karthik C.S. (Tel Aviv University)
DTSTART;VALUE=DATE-TIME:20200827T150000Z
DTEND;VALUE=DATE-TIME:20200827T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/9
DESCRIPTION:Title:
Towards a Unified Framework for Hardness of Approximation in P\nby Kar
thik C.S. (Tel Aviv University) as part of Frontiers of Parameterized Comp
lexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Peter Gartland (University of California Santa Barbara)
DTSTART;VALUE=DATE-TIME:20200910T150000Z
DTEND;VALUE=DATE-TIME:20200910T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/10
DESCRIPTION:Title: Independent Set on P_k-Free Graphs in Quasi-Polynomial Time\nby Peter
Gartland (University of California Santa Barbara) as part of Frontiers of
Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Meirav Zehavi (Ben-Gurion University)
DTSTART;VALUE=DATE-TIME:20200917T150000Z
DTEND;VALUE=DATE-TIME:20200917T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/11
DESCRIPTION:Title: Lossy Kernelization for (Implicit) Hitting Set Problems\nby Meirav Ze
havi (Ben-Gurion University) as part of Frontiers of Parameterized Complex
ity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Edouard Bonnet (Universite Claude Bernard Lyon)
DTSTART;VALUE=DATE-TIME:20201001T150000Z
DTEND;VALUE=DATE-TIME:20201001T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/12
DESCRIPTION:Title: Twin-width\nby Edouard Bonnet (Universite Claude Bernard Lyon) as par
t of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:William Lochet (University of Bergen)
DTSTART;VALUE=DATE-TIME:20201015T150000Z
DTEND;VALUE=DATE-TIME:20201015T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/13
DESCRIPTION:Title: A polynomial time algorithm for the $k$-disjoint shortest path problem\nby William Lochet (University of Bergen) as part of Frontiers of Parame
terized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ariel Kulik (Computer Science Department\, Technion)
DTSTART;VALUE=DATE-TIME:20201022T150000Z
DTEND;VALUE=DATE-TIME:20201022T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/14
DESCRIPTION:by Ariel Kulik (Computer Science Department\, Technion) as par
t of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ariel Kulik (Computer Science Department\, Technion)
DTSTART;VALUE=DATE-TIME:20201029T160000Z
DTEND;VALUE=DATE-TIME:20201029T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/15
DESCRIPTION:Title: Analysis of Two-variable Recurrence Relations with Application to Paramet
erized Approximations\nby Ariel Kulik (Computer Science Department\, T
echnion) as part of Frontiers of Parameterized Complexity\n\nAbstract: TBA
\n
LOCATION:https://researchseminars.org/talk/FrontPC/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Karthik Chandrasekaran (University of Illinois\, Urbana-Champaign)
DTSTART;VALUE=DATE-TIME:20201112T160000Z
DTEND;VALUE=DATE-TIME:20201112T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/17
DESCRIPTION:Title: Hypergraph k-cut for fixed k in deterministic polynomial time\nby Kar
thik Chandrasekaran (University of Illinois\, Urbana-Champaign) as part of
Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Karol Wegrzycki (Saarland University and Max Planck Institute for
Informatics)
DTSTART;VALUE=DATE-TIME:20201126T160000Z
DTEND;VALUE=DATE-TIME:20201126T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/18
DESCRIPTION:Title: Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal
Vectors\nby Karol Wegrzycki (Saarland University and Max Planck Insti
tute for Informatics) as part of Frontiers of Parameterized Complexity\n\n
Abstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chalermsook Parinya (Aalto University)
DTSTART;VALUE=DATE-TIME:20201210T160000Z
DTEND;VALUE=DATE-TIME:20201210T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/19
DESCRIPTION:Title: Vertex Sparsification for Edge Connectivity\nby Chalermsook Parinya (
Aalto University) as part of Frontiers of Parameterized Complexity\n\nAbst
ract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Magnus Wahlstrom (Royal Holloway University of London)
DTSTART;VALUE=DATE-TIME:20210218T160000Z
DTEND;VALUE=DATE-TIME:20210218T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/20
DESCRIPTION:Title: Quasipolynomial multicut-mimicking networks and kernelization of multiway
cut problems\nby Magnus Wahlstrom (Royal Holloway University of Londo
n) as part of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bart Jansen (Eindhoven University of Technology)
DTSTART;VALUE=DATE-TIME:20210225T160000Z
DTEND;VALUE=DATE-TIME:20210225T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/21
DESCRIPTION:Title: Algebraic Sparsification for Decision and Maximization Constraint Satisfa
ction Problems\nby Bart Jansen (Eindhoven University of Technology) as
part of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Danil Sagunov (Steklov Institute of Mathematics)
DTSTART;VALUE=DATE-TIME:20210304T160000Z
DTEND;VALUE=DATE-TIME:20210304T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/22
DESCRIPTION:Title: Algorithmic Extensions of Dirac's Theorem\nby Danil Sagunov (Steklov
Institute of Mathematics) as part of Frontiers of Parameterized Complexity
\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Fahad Panolan (Indian Institute of Technology\, Hyderabad)
DTSTART;VALUE=DATE-TIME:20210311T160000Z
DTEND;VALUE=DATE-TIME:20210311T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/23
DESCRIPTION:Title: Hitting topological minors is FPT\nby Fahad Panolan (Indian Institute
of Technology\, Hyderabad) as part of Frontiers of Parameterized Complexi
ty\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:S\\'andor Kisfaludi-Bak (Max Planck Institute for Informatics)
DTSTART;VALUE=DATE-TIME:20210318T160000Z
DTEND;VALUE=DATE-TIME:20210318T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/24
DESCRIPTION:Title: Planar Steiner Tree With Terminals On Few Faces\nby S\\'andor Kisfalu
di-Bak (Max Planck Institute for Informatics) as part of Frontiers of Para
meterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sitan Chen (Massachusetts Institute of Technology)
DTSTART;VALUE=DATE-TIME:20210325T160000Z
DTEND;VALUE=DATE-TIME:20210325T170000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/25
DESCRIPTION:Title: Learning Deep ReLU Networks is Fixed-Parameter Tractable\nby Sitan Ch
en (Massachusetts Institute of Technology) as part of Frontiers of Paramet
erized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Eduard Eiben (Royal Holloway University of London)
DTSTART;VALUE=DATE-TIME:20210408T150000Z
DTEND;VALUE=DATE-TIME:20210408T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/26
DESCRIPTION:Title: Removing Connected Obstacles in the Plane is FPT\nby Eduard Eiben (Ro
yal Holloway University of London) as part of Frontiers of Parameterized C
omplexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sebastian Siebertz (University of Bremen)
DTSTART;VALUE=DATE-TIME:20210506T150000Z
DTEND;VALUE=DATE-TIME:20210506T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/27
DESCRIPTION:Title: Twinwidth and Permutations\nby Sebastian Siebertz (University of Brem
en) as part of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dimitrios M. Thilikos (LIRMM\, Univ Montpellier\, CNRS)
DTSTART;VALUE=DATE-TIME:20210513T150000Z
DTEND;VALUE=DATE-TIME:20210513T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/28
DESCRIPTION:Title: Parameterized Algorithms for Vertex Deletion to Minor-closed Graph Classe
s\nby Dimitrios M. Thilikos (LIRMM\, Univ Montpellier\, CNRS) as part
of Frontiers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michal Wlodarczyk (Eindhoven University of Technology)
DTSTART;VALUE=DATE-TIME:20210520T150000Z
DTEND;VALUE=DATE-TIME:20210520T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/29
DESCRIPTION:Title: Vertex Deletion Parameterized by Elimination Distance and Even Less\n
by Michal Wlodarczyk (Eindhoven University of Technology) as part of Front
iers of Parameterized Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tuukka Korhonen (University of Helsinki)
DTSTART;VALUE=DATE-TIME:20210527T150000Z
DTEND;VALUE=DATE-TIME:20210527T160000Z
DTSTAMP;VALUE=DATE-TIME:20240328T152103Z
UID:FrontPC/30
DESCRIPTION:Title: Single-Exponential Time 2-Approximation Algorithm for Treewidth\nby T
uukka Korhonen (University of Helsinki) as part of Frontiers of Parameteri
zed Complexity\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/FrontPC/30/
END:VEVENT
END:VCALENDAR