default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 26
Volume 26, Number 1, 2024
Permutation Patterns 2023
- Michael Albert, Mathilde Bouvel, Valentin Féray, Marc Noy:
A logical limit law for 231-avoiding permutations. - Beáta Bényi, Toufik Mansour
, José Luis Ramírez:
Pattern Avoidance in Weak Ascent Sequences. - Miklós Bóna:
Long increasing subsequences and non-algebraicity. - Tian Han, Sergey Kitaev:
Joint distributions of statistics over permutations avoiding two patterns of length 3. - Anant Godbole, Hannah Swickheimer:
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation. - Juan B. Gil, Oscar A. Lopez, Michael D. Weiner:
A positional statistic for 1324-avoiding permutations. - Alexander Burstein:
Distribution of sets of descent tops and descent bottoms on restricted permutations. - Bill Kay, Audun Myers, Thad Boydston, Emily Ellwein, Cameron Mackenzie, Iliana Alvarez, Erik Lentz:
Permutation Entropy for Signal Analysis. - Tomás Aguilar-Fraga, Jennifer Elder, Rebecca E. Garcia, Kimberly P. Hadaway, Pamela E. Harris, Kimberly J. Harry, Imhotep B. Hogan, Jakeyl Johnson, Jan Kretschmann, Kobe Lawson-Chavanu:
Interval and ℓ-interval Rational Parking Functions.
Volume 26, Number 2, 2024
- Julien Baste:
Composing dynamic programming tree-decomposition-based algorithms. - Wenjie Fang:
Bijective proof of a conjecture on unit interval posets. - Nadia Lafrenière, Yan Zhuang:
On the rix statistic and valley-hopping. - Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Silvia B. Tondato:
Weakly toll convexity and proper interval graphs. - Carl Johan Casselgren, Jonas B. Granholm, Fikre B. Petros:
Extending partial edge colorings of iterated cartesian products of cycles and paths. - Sebastian Czerwinski:
On harmonious coloring of hypergraphs. - Samvel Kh. Darbinyan:
A new sufficient condition for a 2-strong digraph to be Hamiltonian. - Deyu Wu, Yipei Zhang, Xiumei Wang:
A note on removable edges in near-bricks. - Ben Adenbaum, Alexander Wilson:
Coloring Groups. - Eun Jung Kim, Arnaud de Mesmay, Tillmann Miltzow:
Representing Matroids over the Reals is ∃ℝ-complete. - Michal Dvorák, Dusan Knop, Simon Schierreich:
On the Complexity of Target Set Selection in Simple Geometric Networks. - Stephan Dominique Andres, Wai Lam Fong:
Line game-perfect graphs. - David Coudert, Samuel Coulomb, Guillaume Ducoffe:
Leanness Computation: Small Values and Special Graph Classes. - Mercè Claverol, Andrea de las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer, David Orden:
On polynomials associated to Voronoi diagrams of point sets and crossing numbers.
Volume 26, Number 3, 2024
- Ta Sheng Tan, Wen Chean Teh:
A Note on Graph Burning of Path Forests. - L'ubomíra Dvoráková, Veronika Hendrychová:
String attractors of Rote sequences. - Lito Goldmann, Leon Kellerhals, Tomohiro Koana:
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. - Jennifer Elder, Pamela E. Harris, Jan Kretschmann, Juan Carlos Martínez Mori:
Cost-sharing in Parking Games. - Mohsen Alambardar Meybodi, Abolfazl Poureidi:
On [1, 2]-Domination in Interval and Circle Graphs. - Gunnar Brinkmann, Matthias De Pauw:
Uniquely hamiltonian graphs for many sets of degrees. - Benjamin R. Jones:
Minor-closed classes of binary functions. - Heidi Van den Camp, Brendan D. McKay:
Generating Plane Quadrangulations and Symmetry-preserving Operations on Maps. - Tiziana Calamoneri, Manuel Lafond, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. - Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
2-polarity and algorithmic aspects of polarity variants on cograph superclasses. - Arun Anil, Manoj Changat:
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs. - Anupam Mondal, Sajal Mukherjee, Kuldeep Saha:
Topology of matching complexes of complete graphs via discrete Morse theory. - Sylwia Cichacz, Karol Suchan:
Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings. - Thomas Fernique, Carole Porrier:
Ammann Bars for Octagonal Tilings. - Oothan Nweit, Daqing Yang:
On the mod k chromatic index of graphs. - Kenta Noguchi, Carol T. Zamfirescu:
Spanning trees for many different numbers of leaves. - Jean-Christophe Aval:
About the determinant of complete non-ambiguous trees. - David Eppstein:
The Widths of Strict Outerconfluent Graphs. - Béla Csaba, Judit Nagy-György:
On the Advice Complexity of Online Matching on the Line. - Marin Bougeret, Jérémy Omer, Michael Poss:
Approximating optimization problems in graphs with locational uncertainty. - Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the parameterized complexity of computing tree-partitions. - Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
Makespan Trade-offs for Visiting Triangle Edges.
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 2026-01-29 02:24 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:
