Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th GASCom 2018: Athens, Greece
- Luca Ferrari, Malvina Vamvakari:
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, GASCom 2018, Athens, Greece, June 18-20, 2018. CEUR Workshop Proceedings 2113, CEUR-WS.org 2018
Invited Talks
- Charalambos A. Charalambides:
A class of power series q-distributions. 1-6 - Maria Bras-Amorós:
Different tree approaches to the problem of counting numerical semigroups by genus. 7-11 - Torsten Mütze:
On Hamilton cycles in highly symmetric graphs. 12-23
Contributed Papers
- Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil:
On the maximal number of leaves in induced subtrees of series-parallel graphs. 24-31 - Ron M. Adin, Sergi Elizalde, Victor Reiner, Yuval Roichman:
Cyclic descent extensions and distributions. 32-42 - Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso:
MergeShuffle: a very fast, parallel random permutation algorithm. 43-52 - Eli Bagno, Riccardo Biagioli, David Garber:
Stirling and Eulerian numbers of types B and D. 53-59 - Cyril Banderier, Philippe Marchal, Michael Wallner:
Rectangular Young tableaux with local decreases and the density method for uniform random generation. 60-68 - Cyril Banderier, Michael Wallner:
Local time for lattice paths and the associated limit laws. 69-78 - Elena Barcucci, Antonio Bernini, Renzo Pinzani:
Exhaustive generation of positive lattice paths. 79-86 - Elena Barcucci, Antonio Bernini, Renzo Pinzani:
A Gray code for a regular language. 87-93 - Frédérique Bassino, Andrea Sportiello:
Linear-time exact sampling of sum-constrained random variables. 94-105 - Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. 106-115 - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Non saturated polyhexes and polyiamonds. 116-123 - Giulio Cerbai, Luca Ferrari:
Permutation patterns in genome rearrangement problems. 124-131 - Julien David, Lionel Pournin, Rado Rakotonarivo:
A Markov chain for lattice polytopes. 132-139 - Henri Derycke:
Permutation statistics for a percolation model on Z2 with imposed symmetries. 140-147 - Ioannis Giotis, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. 148-155 - Thomas Kamalakis, Malvina Vamvakari:
q-Random walks on the integers and on the two-dimensional integer lattice. 156-165 - Dimitris J. Kavvadias, Lina Panagopoulou:
A semantic view of the switching lemma. 166-171 - Andreas Kyriakoussis, Malvina Vamvakari:
On associated q-orthogonal polynomials with a class of discrete q-distributions. 172-178 - Philippe Marchal:
The density method and permutations with a prescribed descent set. 179-186 - Ljuben R. Mutafchiev:
On the largest part size and its multiplicity of a random integer partition. 187-194 - Ahmad Sabri, Vincent Vajnovszki:
Exhaustive generation for ballot sequences in lexicographic and Gray code order. 195-201 - Xavier Gérard Viennot:
Growth diagrams and edge local rules. 202-211 - Sylvain Carrozza, Thomas Krajewski, Adrian Tanasa:
Using Grassmann calculus in combinatorics: Lindström-Gessel-Viennot lemma and Schur functions. 212-221
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
