# GALaC team seminar

The GALaC team seminar is organized once a month on Friday at 14:30 in the Ada Lovelace building at LRI.

## Recent and up-coming seminars

## Maximum Independent Set in H-free graphs

Summary: Maximum Independent Set (MIS) in graphs without a connected H as an induced subgraph (that is, H-free) is NP-complete when H is not a tree with at most one vertex of degree at least 3. For the other graphs H, which are paths and subdivisions of the claw (K_1 ...

## Binary pattern of length greater than 14 are abelian-2-avoidable

Summary: Two words u and v are abelian equivalent if they are permutation of each other ("aabc" and "baca" are abelian equivalent). Let w be a word and P= P1...Pn (where the Pi are the letters of P) a pattern (a word over another alphabet), we say that w ...

Translations: fr