Volume 10, Number 1, 2008

• 
  Tomi Kärki, Tero Harju, Vesa Halava: Interaction Properties of Relational Periods.

• 
  Bernard Ycart, Joel Ratsaby: VC-Dimensions of Random Function Classes.
• 
  David Joyner: On Quadratic Residue Codes and Hyperelliptic Curves.
• 
  Stanley Burris, Karen A. Yeats: Sufficient Conditions for Labelled 0-1 Laws.

• 
  Mickaël Montassier, Pascal Ochem, Alexandre Pinlou: Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.
• 
  David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Queue-Number.
• 
  Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Total Domination in K5- and K6-covered graphs.
• 
  Dorota Bród, Zdzislaw Skupien: Recurrence Among Trees with Most Numerous Efficient Dominating Sets.
• 
  Hamamache Kheddouci, Olivier Togni: Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs.
• 
  Marina Groshaus, Jayme Luiz Szwarcfiter: On Hereditary Helly Classes of Graphs.
• 
  Yi-Zheng Fan, Jing Xu, Yi Wang, Dong Liang: The Laplacian Spread of a Tree.

Volume 10, Number 2, 2008

• 
  Alois Panholzer: Analysis of Some Parameters for Random Nodes in Priority Trees.

• 
  Tomás Masopust, Jirí Techet: Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof.

• 
  Shu-Chiuan Chang, Lung-Chi Chen: Spanning Forests on the Sierpinski Gasket.
• 
  David Callan: A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata.
• 
  Mireille Bousquet-Mélou, Yann Ponty: Culminating Paths.
• 
  Michel Bousquet, Cédric Lamathe: On Symmetric Structures of Order Two.

• 
  Elyes Ben Hamida, Guillaume Chelius, Anthony Busson, Eric Fleury: Neighbor Discovery in Multi-hop Wireless Networks: Evaluation and Dimensioning with Interferences Considerations.

• 
  Joel Spencer, C. R. Subramanian: On the Size of Induced Acyclic Subgraphs in Random Digraphs.
• 
  Erfang Shan, Zuosong Liang, T. C. Edwin Cheng: Clique-transversal Number in Cubic Graphs.

Volume 10, Number 3, 2008

• 
  Helmut Prodinger: The Location of the First Maximum in the First Sojourn of a Dyck Path.
• 
  Grégory Nuel: Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach.
• 
  Svante Janson, Christian Lavault, Guy Louchard: Convergence of Some Leader Election Algorithms.

• 
  Peter Hertling, Christoph Spandl: Shifts with Decidable Language and Non-Computable Entropy.
• 
  Silvio Capobianco: Multidimensional Cellular Automata and Generalization of Fekete's Lemma.

• 
  Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel: Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.
• 
  Khodabakhsh Hessami Pilehrood, Tatiana Hessami Pilehrood: Simultaneous Generation for Zeta Values by the Markov-WZ Method.

• 
  Janez Zerovnik, Ignasi Sau: An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks.

• 
  Cyril Gavoille, Nicolas Hanusse: On Compact Encoding of Pagenumber.
• 
  Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: Extremal K(s, t)-free Bipartite Graphs.
• 
  Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat: On-line Ramsey Numbers for Paths and Stars.
• 
  Marietjie Frick, Peter Katrenic: Progress on the Traceability Conjecture for Oriented Graphs.
• 
  Gruia Calinescu, Cristina G. Fernandes: On the k-Structure Ratio in Planar and Outerplanar Graphs.
• 
  Dariusz Dereniowski, Adam Nadolski: A Note on Compact and Compact Circular Edge-colorings of Graphs.

last updated on Sun May 26 04:45:10 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page