Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 14, 2019, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Torsten Mütze (TU Berlin)

Combinatorial generation via permutation languages

In this talk I present a new and versatile algorithmic framework for generating many different combinatorial classes of objects, based on encoding them as permutations. One of the main applications is the generation of pattern-avoiding permutations (vexillary, skew-merged, separable, clumped, Baxter permutations, and many more). Our algorithm provides a unified view on many known results, such as the binary reflected Gray code for bitstrings, the Steinhaus-Johnson-Trotter algorithm for permutations, the Lucas-Roelants-van Baronaigien Gray code for binary trees, Kaye’s Gray code for set partitions, and it also yields many new Gray codes, in particular for several classes of rectangulations (also known as floorplans). More generally, our algorithm produces a Hamilton path on any lattice quotient of the weak order on permutations. This is joint work with Liz Hartung, Hung Hoang, and Aaron Williams.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login