BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.4.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:0-50@lisn.upsaclay.fr
DTSTART;TZID=Europe/Paris:20211213T150000
DTEND;TZID=Europe/Paris:20211213T160000
DTSTAMP:20230831T085249Z
URL:https://www.lisn.upsaclay.fr/evenements/efficient-generation-of-rectan
 gulations-and-elimination-trees-via-permutation-languages/
SUMMARY:Efficient generation of rectangulations and elimination trees via p
 ermutation languages
DESCRIPTION:In this talk we apply the Hartung-Hoang-Mütze-Williams permuta
 tion language framework to derive exhaustive generation algorithms for two
  further classes of combinatorial objects\, as well as Hamilton paths and 
 cycles on the corresponding polytopes: (3) different classes of rectangula
 tions\, which are subdivisions of a rectangle into smaller rectangles (see
  www.combos.org/rect)\; (4) elimination trees of chordal graphs\, which en
 code several interesting combinatorial objects such as permutations\, bina
 ry trees and bitstrings (see www.combos.org/elim). This talk is based on j
 oint work with Torsten Mütze and Jean Cardinal (SoCG 2021 + SODA 2022).
LOCATION:France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=France;X-APPLE-RADIUS=100;X
 -TITLE=:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20211031T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR