Algorithms and Permutation 2012

Presentation ↑

The Algorithms & Permutations 2012 workshop (Paris, February 20-21, 2012), brought together people coming from different algorithmic backgrounds working on permutations. Among the participants, were researchers working on discrete and computational geometry, comparative genomics, modular decomposition of graphs, tournaments and rankings, pattern matching...

The workshop consisted in surveys, as well as short or long talks, given by invited speakers. Their slides and recorded talks can be found below.

72 participants registered to attend the conference. Registration was free thanks to our partners, but required for organisational purposes.

Program ↑

	Monday, February 20, 2012
9:00-9:45	Registration, welcome coffee
9:45-10:45	Rida Laraki (PREG-CECO, CNRS): Voting and Majority Judgment -
10:45-11:15	Coffee break (E200)
11:15-12:00	Rolf Niedermeier (ISTI, Technische Universität Berlin): Rank Aggregation and Kemeny Voting -
12:00-12:30	Olivier Hudry (INFRES-MIC2 Télécom ParisTech): A Branch and Bound Algorithm to Compute a Median Permutation -
	Lunch break
2:30-3:30	Christophe Paul (LIRMM, CNRS): Algorithmics of Modular Decomposition -
3:30-4:00	Coffee break (E200)
4:00-4:30	Ioan Todinca (LIFO, Université d'Orléans): Permutation Graphs, an Introduction -
4:30-5:00	Mireille Bousquet-Mélou (LABRI, CNRS): The Number of Inversions After n Adjacent Transpositions -
5:00-5:30	Mathilde Bouvel (LABRI, CNRS): Average-Case Analysis of Perfect Sorting by Reversals -

	Tuesday, February 21, 2012
9:00-10:00	Jean Cardinal (Computer Science Department, Université Libre de Bruxelles): - Sorting and a Tale of Two Polytopes -
10:00-10:45	Coffee break (E200)
10:45-11:15	Vincent Pilaud (LIX, CNRS): Permutahedra, Associahedra and Sorting Networks -
11:15-11:45	Xavier Goaoc (LORIA, INRIA): On Geometric Permutations -
11:45-12:15	Dominique Rossin (LIX, CNRS): On Stanley-Wilf-Marcus-Tardos Theorem -
	Lunch break
2:30-3:30	Anthony Labarre (CODeS, Katholieke Universiteit Leuven): Permutations in Comparative Genomics -
3:30-4:00	Coffee break (E200)
4:00-4:30	Laurent Bulteau (LINA, Université de Nantes): Pancake Flipping Is Hard -
4:30-5:00	Jean-Luc Baril (LE2I, Université de Bourgogne): Whole Mirror Duplication-Random Loss Model and Pattern Avoiding Permutations -