BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:9e03ac7d-ae8c-4851-981c-59899ac32c4d
X-WR-CALNAME:[gt.go] - 'Cops and Robber Game on Surfaces of Euclidean\, Sph
 erical and Hyperbolic Metric' by Amadeus Reinald
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:9e03ac7d-ae8c-4851-981c-59899ac32c4d
DTSTAMP:20260407T091115Z
CLASS:PUBLIC
DESCRIPTION:/Exposé en anglais/Talk in english/ \n\nTwin-width is a graph i
 nvariant recently introduced by Bonnet\, Kim\, Thomassé and Watrigant [FOC
 S'20]. \nThe core result of their paper states that\, on classes of bounde
 d twin-width\, deciding any problem expressible by a first-order logic for
 mula φ is FPT with respects to |φ|. \nBounded twin-width classes are very 
 diverse\, and plenty of decision problems such as k-Independent Set\, k-Do
 minating Set and k-Vertex Cover can be expressed in first order\, yielding
  their fixed-parameter tractability on these classes. \n\nIn this talk\, w
 e investigate the existence of polynomial kernels for k-Vertex Cover and k
 -Dominating Set on classes of bounded twin-width. \nIn these classes\, we 
 start by showing a (sub)quadratic kernel k-Vertex Cover. \nAfter introduci
 ng the background required for kernel lower bounds\, we present our main r
 esult\, that k-Dominating Set admits no polynomial kernel on classes of tw
 in-width at most four. \n\nJoint work with Édouard Bonnet\, Eun Jung Kim\,
  Stéphan Thomassé and Rémi Watrigant [Algorithmica\, https://arxiv.org/abs
 /2107.02882 ] \n\n\n[Amadeus Reinald] (LIRMM ) \n\nhttps://www.lirmm.fr/~a
 reinald/about/ \n\n\nRemarks / Remarques \n\nFind all the information of t
 he working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.p
 hp/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les information
 s du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Grou
 pe/GT | page web ] .
DTSTART;TZID=Europe/Paris:20230210T140000
DTEND;TZID=Europe/Paris:20230210T150000
LOCATION:https://webconf.u-bordeaux.fr/b/mar-ef4-zed and LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Cops and Robber Game on Surfaces of Euclidean\, Spherica
 l and Hyperbolic Metric' by Amadeus Reinald
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
