Discrete Mathematics & Theoretical Computer Science, Volume 12

Volume 12, Number 1, 2010

Graphs and Algorithms

• 
  Therese Biedl, Michal Stern:
  On edge-intersection graphs of k-bend paths in grids. 1-12

Combinatorics

• 
  Taras O. Banakh, Artem Dudko, Dusan Repovs:
  Symmetric monochromatic subsets in colorings of the Lobachevsky plane. 13-20

Automata, Logic and Semantics

• 
  Christian Choffrut, Achille Frigeri:
  Deciding whether the ordering is necessary in a Presburger formula. 21-38

Distributed Computing and Networking

• 
  Yvonne-Anne Pignolet, Stefan Schmid, Roger Wattenhofer:
  Tight Bounds for Delay-Sensitive Aggregation. 39-58

Graphs and Algorithms

• 
  Mieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz:
  Acyclic colourings of graphs with bounded degree. 59-74
• 
  Oswin 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. 75-86
• 
  Lukasz Kowalik, Borut Luzar, Riste Skrekovski:
  An improved bound on the largest induced forests for triangle-free planar graphs. 87-100
• 
  Jakub Przybylo, Mariusz Wozniak:
  On a 1, 2 Conjecture. 101-108

Combinatorics

• 
  Vincent Vajnovszki:
  Generating involutions, derangements, and relatives by ECO. 109-122
• 
  Michael Huber:
  On the existence of block-transitive combinatorial designs. 122-132

Volume 12, Number 2, 2010

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

Volume 12, Number 3, 2010

Combinatorics

• 
  Ioannis Michos:
  On the support of the free Lie algebra: the Schützenberger problems. 1-28

Automata, Logic and Semantics

• 
  James D. Currie, Narad Rampersad:
  Cubefree words with many squares. 29-34

Combinatorics

• 
  Ying Liu:
  The Laplacian spread of Cactuses. 35-40
• 
  Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Rémy:
  On the number of balanced words of given length and height over a two letter alphabet. 41-62

Graphs and Algorithms

• 
  Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard:
  Covering codes in Sierpinski graphs. 63-74

Automata, Logic and Semantics

• 
  Elcio Lebensztayn:
  On the asymptotic enumeration of accessible automata. 75-80

Analysis of Algorithms

• 
  Reinhard Kutzelnigg:
  A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r. 81-102

Graphs and Algorithms

• 
  Milan Bradonjic, Tobias Müller, Allon G. Percus:
  Coloring Geographical Threshold Graphs. 103-114
• 
  Stefan Felsner, Clemens Huemer, Sarah Kappes, David Orden:
  Binary Labelings for Plane Quadrangulations and their Relatives. 115-138

Combinatorics

• 
  Ligia Loreta Cristea, Helmut Prodinger:
  q-Enumeration of words by their total variation. 139-150
• 
  Shu-Chiuan Chang, Lung-Chi Chen:
  Structure of spanning trees on the two-dimensional Sierpinski gasket. 151-176

Volume 12, Number 4, 2010

Special Issue on Automata: from Mathematics to Applications

• 
  Pavel Vadimovich Salimov:
  On Uniform Recurrence of a Direct Product. 1-8
• 
  Juhani Karhumäki, Aleksi Saarela:
  Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. 9-18
• 
  Abuzer Yakaryilmaz, A. C. Cem Say:
  Succinctness of two-way probabilistic and quantum finite automata. 19-40
• 
  Jorge Almeida, Ondrej Klíma:
  New decidable upper bound of the second level in the Straubing-Thérien concatenation hierarchy of star-free languages. 41-58
• 
  Christian Choffrut, Robert George Mercas:
  Contextual partial commutations. 59-72
• 
  Violetta Lonati, Matteo Pradella:
  Deterministic recognizability of picture languages with Wang automata. 73-94
• 
  Evgeny S. Skvortsov, Yulia Zaks:
  Synchronizing random automata. 95-108
• 
  Roberto Radicioni, Alberto Bertoni:
  Grammatical compression: compressed equivalence and other problems. 109-126

Volume 12, Number 5, 2010

Graphs and Algorithms

• 
  Tínaz Ekim, Bernard Ries, Dominique de Werra:
  Split-critical and uniquely split-colorable graphs. 1-24

Combinatorics

• 
  Geneviève Paquin:
  A characterization of infinite smooth Lyndon words. 25-62

Graphs and Algorithms

• 
  David E. Brown, Arthur H. Busch, Garth Isaak:
  Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs. 63-82

Combinatorics

• 
  Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
  Crucial abelian k-power-free words. 83-96
• 
  Brendon Rhoades:
  The cluster and dual canonical bases of ℤ[x₁₁, ..., x₃₃] are equal. 97-124

Graphs and Algorithms

• 
  Camino Balbuena, Xavier Marcote, Diego González-Moreno:
  Some properties of semiregular cages. 125-138
• 
  Fabrizio Frati:
  Lower Bounds on the Area Requirements of Series-Parallel Graphs. 139-174
• 
  Carmen C. Centeno, Simone Dantas, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
  Convex Partitions of Graphs induced by Paths of Order Three. 175-184