default search action
Discrete Mathematics & Theoretical Computer Science, Volume 22
Volume 22, Number 1, 2020
- Jérémy Omer, Tangi Migot:
Vertex order with optimal number of adjacent predecessors. - Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena:
From light edges to strong edge-colouring of 1-planar graphs. - Tim Smith:
A Characterization of Morphic Words with Polynomial Growth. - Winfried Hochstättler, Felix Schröder
, Raphael Steiner
On the Complexity of Digraph Colourings and Vertex Arboricity. - James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. - Raheel Anwar
Analysis of a Model for Generating Weakly Scale-free Networks. - Hanieh Amjadi, Nasrin Soltankhah
The 3-way flower intersection problem for Steiner triple systems. - Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile:
A method for eternally dominating strong grids. - Pascal Caron
New tools for state complexity. - Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro:
The Chromatic Number of the Disjointness Graph of the Double Chain. - Gülnaz Boruzanli Ekinci, John Baptist Gauci:
The super-connectivity of Johnson graphs. - Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz:
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. - Xinwei He, A. J. Hildebrand, Yuchen Li, Yunyi Zhang:
Complexity of Leading Digit Sequences. - Wady Naanaa:
New schemes for simplifying binary constraint satisfaction problems. - Lukasz Merta:
Formal inverses of the generalized Thue-Morse sequences and variations of the Rudin-Shapiro sequence. - Hongliang Lu, Wei Wang, Juan Yan:
Antifactors of regular bipartite graphs. - Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos
The Complexity of Helly-B1 EPG Graph Recognition. - L'ubomíra Dvoráková, Katerina Medková, Edita Pelantová:
Complementary symmetric Rote sequences: the critical exponent and the recurrence function. - János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca:
On the heapability of finite partial orders. - Ümit Islak, Alperen Y. Özdemir:
On an alternative sequence comparison statistic of Steele. - Hui Rao, Lei Ren, Yang Wang:
Dissecting a square into congruent polygons. - Jonathan Klawitter
The agreement distance of unrooted phylogenetic networks. - Chunyan Yan, Zhicong Lin:
Inversion sequences avoiding pairs of patterns.
Volume 22, Number 2, 2021
- Neal Madras, Justin M. Troyka:
Bounded affine permutations I. Pattern avoidance and enumeration. - Christian Bean, Émile Nadeau, Henning Úlfarsson
Enumeration of Permutation Classes and Weighted Labelled Independent Sets. - Colin Defant:
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma. - Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki:
Catalan words avoiding pairs of length three patterns. - Andrei Asinowski
Flip-sort and combinatorial aspects of pop-stack sorting. - Hanna Mularczyk:
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations. - Alexander Burstein
Enumeration of Dumont permutations avoiding certain four-letter patterns. - Vít Jelínek
Fillings of skew shapes avoiding diagonal patterns. - Michael Albert, Vít Jelínek
Two examples of Wilf-collapse. - Samuel Braunfeld
The undecidability of joint embedding for 3-dimensional permutation classes. - Kassie Archer:
Enumerating two permutation classes by the number of cycles. - David Callan:
Permutations avoiding 4321 and 3241 have an algebraic generating function.
Volume 22, Number 3, 2021
- Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. - Katarzyna Grygiel, Isabella Larcher:
Unary profile of lambda terms with restricted De Bruijn indices.
Volume 22, Number 4, 2020
- Doost Ali Mojdeh, Iztok Peterin, Babak Samadi
(Open) packing number of some graph products. - Pawel Parys:
A Type System Describing Unboundedness. - Joost Engelfriet, Heiko Vogler:
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. - Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Birgit Vogtenhuber:
Evacuating Robots from a Disk Using Face-to-Face Communication. - Éric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo:
Taking-and-merging games as rewrite games. - Shanshan Zhang, Xiumei Wang, Jinjiang Yuan:
Even cycles and perfect matchings in claw-free plane graphs. - Marcin Pilipczuk
A Double Exponential Lower Bound for the Distinct Vectors Problem. - Petr Kolman
Extension Complexity, MSO Logic, and Treewidth. - Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk
Two lower bounds for $p$-centered colorings. - Margaret Archibald
The number of distinct adjacent pairs in geometrically distributed words. - Raphael Steiner
A Note on Graphs of Dichromatic Number 2. - Samvel Kh. Darbinyan:
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture. - Xiao-Lu Gao, Shou-Jun Xu:
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability 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-18 18:30 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: