Discrete Mathematics & Theoretical Computer Science, Volume 14

Volume 14, Number 1, 2012

Graphs and Algorithms

• 
  Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens:
  Vertex-colouring edge-weightings with two edge weights. 1-20
• 
  Andrzej Zak, Aneta Dudek:
  On Hamilton-chain saturated uniform hypergraphs. 21-28
• 
  Serge Gaspers, Mathieu Liedloff:
  A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. 29-42

Graph Theory

• 
  Hengzhe Li, Xueliang Li, Yuefang Sun:
  The generalized 3-connectivity of Cartesian product. 43-54

Distributed Computing and Networking

• 
  Efraim Laksman, Håkan Lennerstad, Lars Lundberg:
  Optimal Computer Crash Performance Precaution. 55-68

Combinatorics

• 
  Ville Junnila:
  Adaptive Identification of Sets of Vertices in Graphs. 69-86

Automata, Logic and Semantics

• 
  Jason P. Bell, Stanley Burris, Karen A. Yeats:
  Monadic second-order classes of forests with a monadic second-order 0-1 law. 87-108

Graphs and Algorithms

• 
  Sascha Kurz, Martin Lätsch:
  Bounds for the minimum oriented diameter. 109-140

Automata, Logic and Semantics

• 
  Manfred Kufleitner, Alexander Lauser:
  The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. 141-146

Discrete Algorithms

• 
  Zbigniew Lonc, Pawel Naroski:
  A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. 147-158

Graph Theory

• 
  Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen:
  α-Labelings and the Structure of Trees with Nonzero α-Deficit. 159-174

Volume 14, Number 2, 2012

Graph Theory

• 
  Boram Park, Yoshio Sano:
  The competition number of a generalized line graph is at most two. 1-10
• 
  Yoshio Okamoto, Yota Otachi, Ryuhei Uehara:
  On bipartite powers of bigraphs. 11-20

Graphs and Algorithms

• 
  Mirko Hornák, Mariusz Wozniak:
  On neighbour-distinguishing colourings from lists. 21-28

Combinatorics

• 
  Robert H. Sloan, Despina Stasi, György Turán:
  Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs. 29-36

Graphs and Algorithms

• 
  Raffaele Mosca:
  Some Results on Stable Sets for k-Colorable P₆-Free Graphs and Generalizations. 37-56

Graph Theory

• 
  Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
  On paths, trails and closed trails in edge-colored graphs. 57-74
• 
  Dieter Rautenbach, Friedrich Regen:
  Graphs with many Vertex-Disjoint Cycles. 75-82
• 
  Manuel E. Lladser, Primoz Potocnik, Jozef Sirán, Mark C. Wilson:
  Random Cayley digraphs of diameter 2 and given degree. 83-90

Analysis of Algorithms

• 
  Helmut Prodinger, Guy Louchard:
  The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis. 91-128
• 
  Diether Knof, Uwe Roesler:
  The Analysis of Find and Versions of it. 129-154

Graph Theory

• 
  Faisal N. Abu-Khzam, Michael A. Langston:
  Immersion Containment and Connectivity in Color-Critical Graphs. 155-164
• 
  Manu Basavaraju:
  Acyclic Chromatic Index of Fully Subdivided Graphs and Halin Graphs. 165-172
• 
  Sanming Zhou:
  On 4-valent Frobenius circulant graphs. 173-188

Automata, Logic and Semantics

• 
  Hermann Gruber:
  Digraph Complexity Measures and Applications in Formal Language Theory. 189-204

Discrete Algorithms

• 
  Per Austrin, Siavosh Benabbas, Avner Magen:
  On Quadratic Threshold CSPs. 205-228

General

• 
  Vera Koponen:
  Random graphs with bounded maximum degree: asymptotic structure and a logical limit law. 229-254

Graph Theory

• 
  Guofei Zhou, Yaojun Chen, Zhengke Miao, Shariefuddin Pirzada:
  A Note on Planar Ramsey Numbers for a Triangle Versus Wheels. 255-260
• 
  Hossein Hajiabolhassan, Farokhlagha Moazami:
  Secure Frameproof Code Through Biclique Cover. 261-270

/ul> Distributed Computing and Networking

• 
  Marie Albenque, Lucas Gerin:
  On the algebraic numbers computable by some generalized Ehrenfest urns. 271-284

Graph Theory

• 
  Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao:
  Upper k-tuple domination in graphs. 285-292