Discrete Mathematics & Theoretical Computer Science, Volume 15

Volume 15, Number 1, 2013

Graph Theory

• 
  José Cáceres, Delia Garijo, Antonio González Herrera, Alberto Márquez, María Luz Puertas:
  The determining number of Kneser graphs. 1-14
• 
  Ben Seamone, Brett Stevens:
  Sequence variations of the 1-2-3 Conjecture and irregularity strength. 15-28

Automata, Logic and Semantics

• 
  Anne Lacroix, Narad Rampersad:
  Automaticity of Primitive Words and Irreducible Polynomials. 29-36

Combinatorics

• 
  Marek Cygan, Marcin Pilipczuk, Riste Skrekovski:
  A bound on the number of perfect matchings in Klee-graphs. 37-54

Graphs and Algorithms

• 
  Martiniano Eguía, Francisco J. Soulignac:
  Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration. 55-74

Graph Theory

• 
  Joy Elizabeth Singleton, Alewyn Petrus Burger:
  Further results on Maximal Nontraceable graphs of smallest size. 75-92

Combinatorics

• 
  Ruy Fabila Monroy, Luis Felipe Barba Flores, Dolores Lara, Jesús Leaños, Cynthia A. Rodríguez Villalobos, Gelasio Salazar, Francisco Zaragoza:
  The Erdős-Sós Conjecture for Geometric Graphs. 93-100

Graphs and Algorithms

• 
  Aijun Dong, Guizhen Liu, Guojun Li:
  List Edge and List Total Colorings of Planar Graphs without non-induced 7-cycles. 101-106

Graph Theory

• 
  Pavel Skums, Yury Metelsky, Olga Glebova:
  Krausz dimension and its generalizations in special graph classes. 107-120
• 
  Peter Mark Kayll, Dave Perkins:
  A chip-firing variation and a new proof of Cayley's Formula. 121-132
• 
  Mariusz Grech, Andrzej Kisielewicz:
  All totally symmetric colored graphs. 133-146
• 
  Anja Kohl:
  The b-chromatic number of powers of cycles. 147-156

Discrete Algorithms

• 
  Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
  Isomorphism of graph classes related to the circular-ones property. 157-182

Combinatorics

• 
  Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne:
  A generic method for the enumeration of various classes of directed polycubes. 183-200

Volume 15, Number 2, 2013

Combinatorics

• 
  Charlotte A. C. Brennan, Arnold Knopfmacher:
  Descent variation of samples of geometric variables. 1-12
• 
  Adrien Boussicault:
  Operations on partially ordered sets and rational identities of type A. 13-32
• 
  Mathilde Bouvel, Luca Ferrari:
  On the enumeration of d-minimal permutations. 33-48

Graph Theory

• 
  L. Sunil Chandran, Rogers Mathew:
  Bipartite Powers of k-chordal Graphs. 49-58

Discrete Algorithms

• 
  Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber:
  Efficient repeat finding in sets of strings via suffix arrays. 59-70

Analysis of Algorithms

• 
  Luc Devroye, Linda Farczadi:
  Connectivity for line-of-sight networks in higher dimensions. 71-86

Graph Theory

• 
  Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah:
  Improved Bounds on the Crossing Number of Butterfly Network. 87-94

Automata, Logic and Semantics

• 
  Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot:
  Derivatives of Approximate Regular Expressions. 95-120

Discrete Algorithms

• 
  Edyta Szymanska:
  The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees. 121-138

Automata, Logic and Semantics

• 
  Marcella Anselmo, Maria Madonia:
  A Stronger Recognizability Condition for Two-dimensional Languages. 139-156

Graph Theory

• 
  Xiumei Wang, Cheng He, Yixun Lin:
  Removable Edges in Near-bricks. 157-164

Combinatorics

• 
  Josef Slapal:
  Topological structuring of the digital plane. 165-176

Graph Theory

• 
  Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
  Probe interval graphs and probe unit interval graphs on superclasses of cographs. 177-194

Graphs and Algorithms

• 
  Piotr Borowiecki, Dariusz Dereniowski:
  On-line ranking of split graphs. 195-214

Combinatorics

• 
  Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda:
  Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs. 215-222

Discrete Algorithms

• 
  Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
  A note on contracting claw-free graphs. 223-232

Graph Theory

• 
  Marc Demange, Tínaz Ekim:
  A note on the NP-hardness of two matching problems in induced subgrids. 233-242
• 
  Shuchao Li, Huihui Zhang, Xiaoyan Zhang:
  Maximal independent sets in bipartite graphs with at least one cycle. 243-258

Analysis of Algorithms

• 
  Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie:
  Coupon collecting and transversals of hypergraphs. 259-270

Volume 15, Number 3, 2013

Graph Theory

• 
  Reza Naserasr, Edita Rollová, Éric Sopena:
  Homomorphisms of planar signed graphs to signed projective cubes. 1-12
• 
  Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
  Clique cycle transversals in graphs with few P₄'s. 13-20

Combinatorics

• 
  Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia:
  On the connectedness and diameter of a Geometric Johnson Graph. 21-30

Graph Theory

• 
  Andrej Taranenko:
  A new characterization and a recognition algorithm of Lucas cubes. 31-40

Automata, Logic and Semantics

• 
  Silvio Capobianco, Pierre Guillon, Jarkko Kari:
  Surjective cellular automata far from the Garden of Eden. 41-60
• 
  Mariusz Grech, Andrzej Kisielewicz:
  The Černý conjecture for automata respecting intervals of a directed graph. 61-72

Combinatorics

• 
  Parikshit Kolipaka, Sathish Govindarajan:
  Two player game variant of the Erdős-Szekeres problem. 73-100

Distributed Computing and Networking

• 
  Krzysztof Krzywdzinski, Dariusz R. Kowalski:
  On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up. 101-118

Combinatorics

• 
  Dániel Gerbner:
  The Magnus-Derek game in groups. 119-126

Graph Theory

• 
  Rafal Witkowski, Janez Zerovnik:
  1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs. 127-138

Combinatorics

• 
  Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian:
  Coloring and Guarding Arrangements. 139-154

Graph Theory

• 
  Delia Garijo, Antonio González Herrera, Alberto Márquez:
  The resolving number of a graph. 155-166