BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:75a208f5-e506-4d60-8488-5284eb7a4f26
X-WR-CALNAME:[RATIO+GO] Karolina Okrasa
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20241027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:75a208f5-e506-4d60-8488-5284eb7a4f26
DTSTAMP:20260927T164245Z
CLASS:PUBLIC
DESCRIPTION:Title: Algorithmic Aspects of the Comparison of Phylogenetic Ne
 twork Homomorphisms in graphs with forbidden structures\nAbstract: For a f
 ixed graph H\, the H-coloring problem takes as an instance a graph G and a
 sks whether there exists a homomorphism from G to H\, i.e.\, a mapping f: 
 V(G) -> V(H) such that if uv is an edge of G\, then f(u)f(v) is an edge of
  H. Graph homomorphisms are a well-known generalization of graph colorings
 \, one of the most popular and elegant objects in graph theory. Indeed\, f
 or any k>0\, the notions of k-coloring and K_k-coloring (of G) coincide.\n
 \nThe H-coloring problem is polynomial-time solvable when H is bipartite o
 r has a loop\, and NP-complete otherwise. In general\, the existence of al
 gorithms solving NP-complete cases of H-coloring significantly faster than
  brute-force is unlikely under standard complexity assumptions. However\, 
 it is still possible to find algorithms working in time polynomial\, or at
  least subexponential\, in the size of the instance\, if we put additional
  assumptions on the class of input instances. In this talk\, I will show w
 hat can be achieved in the classes of F-free graphs\, i.e.\, graphs define
 d by forbidding a fixed graph F as an induced subgraph. In particular\, we
  examine to which extent the variety of tools developed to work on colorin
 g and independent set problems in these graphs can be applied.\n\n\nImport
  automatique depuis https://framagenda.org/remote.php/dav/public-calendars
 /D3yqF7nwys9amfyY?export par sync_icals_to_drupal.py pour M2F
DTSTART;TZID=Europe/Paris:20250221T140000
DTEND;TZID=Europe/Paris:20250221T150000
LOCATION:178
SEQUENCE:0
SUMMARY:[RATIO+GO] Karolina Okrasa
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR