| Vol-2113 urn:nbn:de:0074-2113-0 Copyright © 2018 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

# GASCom 2018
Random and Exhaustive Generation of Combinatorial Structures

### Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures

### Athens, Greece, June 18-20, 2018.

Edited by

### Luca Ferrari *
Malvina Vamvakari **

* Department of Mathematics and Computer Science, University of Firenze, Italy
** Department of Informatics and Telematics, Harokopio University, Athens, Greece

## Table of Contents

- Preface

### Invited Talks

- A class of power series q-distributions 1-6
  Charalambos A. Charalambides,
- Different tree approaches to the problem of counting numerical semigroups by genus 7-11
  Maria Bras-Amorós,
- On Hamilton cycles in highly symmetric graphs 12-23
  Torsten Mütze

### Contributed Papers

- On the maximal number of leaves in induced subtrees of series-parallel graphs 24-31
  Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil
- Cyclic descent extensions and distributions 32-42
  Ron M. Adin, Sergi Elizalde, Victor Reiner, Yuval Roichman
- MergeShuffle: a very fast, parallel random permutation algorithm 43-52
  Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie Lumbroso
- Stirling and Eulerian numbers of types B and D 53-59
  Eli Bagno, Riccardo Biagioli, David Garber
- Rectangular Young tableaux with local decreases and the density method for uniform random generation 60-68
  Cyril Banderier, Philippe Marchal, Michael Wallner
- Local time for lattice paths and the associated limit laws 69-78
  Cyril Banderier, Michael Wallner
- Exhaustive generation of positive lattice paths 79-86
  Elena Barcucci, Antonio Bernini, Renzo Pinzani
- A Gray code for a regular language 87-93
  Elena Barcucci, Antonio Bernini, Renzo Pinzani
- Linear-time exact sampling of sum-constrained random variables 94-105
  Frédérique Bassino, Andrea Sportiello
- Random input helps searching predecessors 106-115
  Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis
- Non saturated polyhexes and polyiamonds 116-123
  Alexandre Blondin Massé, Julien de Carufel, Alain Goupil
- Permutation patterns in genome rearrangement problems 124-131
  Giulio Cerbai, Luca Ferrari
- A Markov chain for lattice polytopes 132-139
  Julien David, Lionel Pournin, Rado Rakotonarivo
- Permutation statistics for a percolation model on Z2 with imposed symmetries 140-147
  Henri Derycke
- Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma 148-155
  Ioannis Giotis, Lefteris Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
- q-Random walks on the integers and on the two-dimensional integer lattice 156-165
  Thomas Kamalakis, Malvina Vamvakari
- A semantic view of the switching lemma 166-171
  Dimitris J. Kavvadias, Lina Panagopoulou
- On associated q-orthogonal polynomials with a class of discrete q-distributions 172-178
  Andreas Kyriakoussis, Malvina Vamvakari
- The density method and permutations with a prescribed descent set 179-186
  Philippe Marchal
- On the largest part size and its multiplicity of a random integer partition 187-194
  Ljuben Mutafchiev
- Exhaustive generation for ballot sequences in lexicographic and Gray code order 195-201
  Ahmad Sabri, Vincent Vajnovszki
- Growth diagrams and edge local rules 202-211
  Xavier Viennot
- Using Grassmann calculus in combinatorics: Lindström-Gessel-Viennot lemma and Schur functions 212-221
  Sylvain Carrozza, Thomas Krajewski, Adrian Tanasa

2018-06-04: submitted by Luca Ferrari, Malvina Vamvakari metadata incl. bibliographic data published under Creative Commons CC0
2018-06-17: published on CEUR-WS.org |valid HTML5|