default search action
Discrete Mathematics & Theoretical Computer Science, Volume 18
Volume 18, Number 1, 2015
- Rudolf Grübel:
Persisting randomness in randomly growing discrete structures: graphs and search trees. - Stephan Dominique Andres, Winfried Hochstättler:
The game colouring number of powers of forests.
Volume 18, Number 2, 2016
- Michael H. Albert, Robert Brignall:
2×2 monotone grid classes are finitely based. - Sylvie Corteel, Megan A. Martinez, Carla D. Savage, Michael Weselcouch:
Patterns in Inversion Sequences I. - Mitchell Paukner, Lucy Pepin, Manda Riehl, Jarred Wieser:
Pattern Avoidance in Task-Precedence Posets. - Vincent Vatter:
An Erdős-Hajnal analogue for permutation classes. - Eric S. Egge, Kailee Rubin:
Snow Leopard Permutations and Their Even and Odd Threads. - Ran Pan, Jeffrey B. Remmel:
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays. - Josefran de Oliveira Bastos, Leonardo Nagami Coregliano:
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. - David I. Bevan
, Derek Levin, Peter Nugent
Pattern avoidance in forests of binary shrubs. - Jonathan Bloom, Dan Saracino:
Pattern avoidance for set partitions à la Klazar. - David I. Bevan
The permutation class Av(4213, 2143). - Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. - Cyril Banderier, Jean-Luc Baril, Céline Moreira Dos Santos:
Right-jumps and pattern avoiding permutations. - Quang T. Bach, Jeffrey B. Remmel:
Descent c-Wilf Equivalence. - Both Emerite Neou, Romeo Rizzi
Permutation Pattern matching in (213, 231)-avoiding permutations.
Volume 18, Number 3, 2016
- Jorge Almeida, José Carlos Costa, Marc Zeitoun:
Factoriality and the Pin-Reutenauer procedure. - Gwen Spencer:
Sticky Seeding in Discrete-Time Reversible-Threshold Networks. - Joshua N. Cooper
Asymptotic Density of Zimin Words. - Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. - Paul Dorbec, Seethu Varghese, Ambat Vijayakumar:
Heredity for generalized power domination. - Dorota Kuziak
Open k-monopolies in graphs: complexity and related concepts. - Miklós Bóna:
On the number of vertices of each rank in phylogenetic trees and their generalizations. - David Coudert
Combinatorial optimization in networks with Shared Risk Link Groups. - Clemens Heuberger, Daniel Krenn, Sara Kropf:
Automata in SageMath - Combinatorics meet Theoretical Computer Science. - Tadeja Kraner Sumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh:
Partitioning the vertex set of G to make G ☐ H an efficient open domination graph. - Sara Kropf:
Variance and Covariance of Several Simultaneous Outputs of a Markov Chain. - Tomás Dvorák
Matchings of quadratic size extend to long cycles in hypercubes. - F. Thomas Bruss, Guy Louchard:
Sequential selection of the k best out of nrankable objects. - Jean Cardinal, Michael S. Payne, Noam Solomon:
Ramsey-type theorems for lines in 3-space. - Janusz A. Brzozowski, Sylvie Davies, Bo Yang Victor Liu:
Most Complex Regular Ideal Languages. - Edita Pelantová
Constructions of words rich in palindromes and pseudopalindromes. - Alice L. L. Gao, Emily X. L. Gao, Patxi Laborde-Zubieta, Brian Yi Sun:
Enumeration of Corners in Tree-like Tableaux. - Frédéric Chapoton
Stokes posets and serpent nests. - M. Archana, V. Kannan:
A Context free language associated with interval maps. - Stefan Felsner, Daniel Heldt:
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs.
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-12-29 01:16 CET 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: