Journal: Discrete Mathematics & Theoretical Computer Science

Volume 12, Issue 5

1 -- 24Tinaz Ekim, Bernard Ries, Dominique de Werra. Split-critical and uniquely split-colorable graphs
25 -- 62Geneviève Paquin. A characterization of infinite smooth Lyndon words
63 -- 82David E. Brown, Arthur H. Busch, Garth Isaak. Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs
83 -- 96Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev. Crucial abelian k-power-free words
97 -- 124Brendon Rhoades. 33] are equal
125 -- 138Camino Balbuena, Xavier Marcote, Diego González-Moreno. Some properties of semiregular cages
139 -- 174Fabrizio Frati. Lower Bounds on the Area Requirements of Series-Parallel Graphs
175 -- 184Carmen C. Centeno, S. Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter. Convex Partitions of Graphs induced by Paths of Order Three

Volume 12, Issue 4

9 -- 18Juhani Karhumäki, Aleksi Saarela. Noneffective Regularity of Equality Languages and Bounded Delay Morphisms
41 -- 58Jorge Almeida, Ondrej Klíma. New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages
59 -- 72Christian Choffrut, Robert George Mercas. Contextual partial commutations
73 -- 94Violetta Lonati, Matteo Pradella. Deterministic recognizability of picture languages with Wang automata
95 -- 108Evgeny S. Skvortsov, Yulia Zaks. Synchronizing random automata
109 -- 126Roberto Radicioni, Alberto Bertoni. Grammatical compression: compressed equivalence and other problems

Volume 12, Issue 3

1 -- 28Ioannis Michos. On the support of the free Lie algebra: the Schützenberger problems
29 -- 34James D. Currie, Narad Rampersad. Cubefree words with many squares
35 -- 40Ying Liu. The Laplacian spread of Cactuses
41 -- 62Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Remy. On the number of balanced words of given length and height over a two letter alphabet
63 -- 74Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard. Covering codes in Sierpinski graphs
75 -- 80Elcio Lebensztayn. On the asymptotic enumeration of accessible automata
81 -- 102Reinhard Kutzelnigg. A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r
103 -- 114Milan Bradonjic, Tobias Müller, Allon G. Percus. Coloring Geographical Threshold Graphs
115 -- 138Stefan Felsner, Clemens Huemer, Sarah Kappes, David Orden. Binary Labelings for Plane Quadrangulations and their Relatives
139 -- 150Ligia Loreta Cristea, Helmut Prodinger. q-Enumeration of words by their total variation
151 -- 176Shu-Chiuan Chang, Lung-Chi Chen. Structure of spanning trees on the two-dimensional Sierpinski gasket

Volume 12, Issue 2

0 -- 0Pawel Blasiak. Combinatorial Route to Algebra: The Art of Composition & Decomposition
1 -- 22Svante Janson. A divertent generating function that can be summed and analysed analytically
23 -- 46Gérard Duchamp, Laurent Poinsot, Allan I. Solomon, Karol A. Penson, Pawel Blasiak, Andrzej Horzela. Ladder Operators and Endomorphisms in Combinatorial Physics
47 -- 64Helmut Prodinger. Continued fraction expansions for q-tangent and q-cotangent functions
65 -- 88Mireille Bousquet-Mélou. The expected number of inversions after n adjacent transpositions
89 -- 102Miklós Bóna. The absence of a pattern and the occurrences of another
103 -- 166Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas. Asymptotic variance of random symmetric digital search trees
167 -- 184Guy Louchard. Asymptotics of the Stirling numbers of the first kind revisited: A saddle point approach
185 -- 196Guy Louchard, Helmut Prodinger. Asymptotic results for silent elimination
197 -- 222Li Dong, Zhicheng Gao, Daniel Panario, L. Bruce Richmond. Asymptotics of smallest component sizes in decomposable structures of alg-log type
223 -- 236Khodabakhsh Hessami Pilehrood, Tatiana Hessami Pilehrood. Series acceleration formulae for beta values
237 -- 248Juhani Karhumäki, Yury Lifshits, Wojciech Rytter. Tiling Periodicity
249 -- 262Stefan Felsner, Éric Fusy, Marc Noy. Asymptotic enumeration of orientations
263 -- 294Damien Regnault, Nicolas Schabanel, Eric Thierry. On the analysis of simple 2D stochastic cellular automata
295 -- 306Karol A. Penson, Pawel Blasiak, Gérard Duchamp, Andrzej Horzela, Allan I. Solomon. On certain non-unique solutions of the Stieltjes moment problem
307 -- 332Alfredo Viola. Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets

Volume 12, Issue 1

1 -- 12Therese C. Biedl, Michal Stern. On edge-intersection graphs of k-bend paths in grids
13 -- 20Taras O. Banakh, Artem Dudko, Dusan Repovs. Symmetric monochromatic subsets in colorings of the Lobachevsky plane
21 -- 38Christian Choffrut, Achille Frigeri. Deciding whether the ordering is necessary in a Presburger formula
39 -- 58Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer. Tight Bounds for Delay-Sensitive Aggregation
59 -- 74Mieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz. Acyclic colourings of graphs with bounded degree
75 -- 86Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood. Edge-Removal and Non-Crossing Configurations in Geometric Graphs
87 -- 100Lukasz Kowalik, Borut Luzar, Riste Skrekovski. An improved bound on the largest induced forests for triangle-free planar graphs
101 -- 108Jakub Przybylo, Mariusz Wozniak. On a 1, 2 Conjecture
109 -- 122Vincent Vajnovszki. Generating involutions, derangements, and relatives by ECO