Discrete Mathematics & Theoretical Computer Science, Volume 16

Volume 16, Number 1, 2014

Graph Theory

• 
  Simon Mukwembi:
  On size, radius and minimum degree. 1-6
• 
  Christian Löwenstein, Dieter Rautenbach, Roman Soták:
  On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs. 7-30

Discrete Algorithms

• 
  Milan Bradonjic, Gunes Ercal, Adam Meyerson, Alan Roytman:
  The Price of Mediation. 31-60

Combinatorics

• 
  Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher:
  Descents after maxima in compositions. 61-72
• 
  Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto:
  Graphs where every k-subset of vertices is an identifying set. 73-88

Graph Theory

• 
  Frédéric Havet, Andrew D. King:
  List circular backbone colouring. 89-104
• 
  Dorota Kuziak, Iztok Peterin, Ismael González Yero:
  Efficient open domination in graph products. 105-120

General

• 
  Serge Burckel, Emeric Gioan, Emmanuel Thomé:
  Computation with No Memory, and Rearrangeable Multicast Networks. 121-142

Graph Theory

• 
  Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski:
  Strong parity vertex coloring of plane graphs. 143-158

Automata, Logic and Semantics

• 
  José Carlos Costa:
  Canonical forms for free κ-semigroups. 159-178

Discrete Algorithms

• 
  Daniel Binkele-Raible, Henning Fernau:
  A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph. 179-200

Graph Theory

• 
  Hosam Abdo, Stephan Brandt, Darko Dimitrov:
  The Total Irregularity of a Graph. 201-206
• 
  Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
  The Price of Connectivity for Vertex Cover. 207-224
• 
  Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
  On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. 225-232

Automata, Logic and Semantics

• 
  Julien Leroy:
  An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2. 233-286

Graph Theory

• 
  Jiyun Guo, Jianhua Yin:
  A forcible version of Niessen's problem on degree sequences of graphs. 287-292
• 
  Janusz Adamus, Lech Adamus, Anders Yeo:
  On the Meyniel condition for hamiltonicity in bipartite digraphs. 293-302
• 
  Alice C. Niemeyer, Cheryl E. Praeger:
  Elements in finite classical groups whose powers have large 1-Eigenspaces. 303-312

Analysis of Algorithms

• 
  Rebecca J. Stones:
  Computing the number of h-edge spanning forests in complete bipartite graphs. 313-326

Combinatorics

• 
  Toufik Mansour, Mark Shattuck, Mark C. Wilson:
  Congruence successions in compositions. 327-338

Graph Theory

• 
  Xueliang Li, Yaping Mao:
  The generalized 3-connectivity of Lexicographic product graphs. 339-354

Combinatorics

• 
  Adrian Tanasa, Gérard Henry Edmond Duchamp, Loïc Foissy, Nguyen Hoang Nghia, Dominique Manchon:
  A combinatorial non-commutative Hopf algebra of graphs. 356-370
• 
  Anna Chiara Lai, Paola Loreti:
  Robot's hand and expansions in non-integer bases. 371-394

Volume 16, Number 2, 2014

Special issue PRIMA 2013

• 
  David Bryant, Paul F. Tupper:
  Diversities and the Geometry of Hypergraphs. 1-20
• 
  Xuegang Chen, Jing Huang:
  Uniquely monopolar-partitionable block graphs. 21-34
• 
  L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh:
  On Additive Combinatorics of Permutations of ℤ_n. 35-40
• 
  Andreas W. M. Dress, Katharina T. Huber, Mike A. Steel:
  A matroid associated with a phylogenetic tree. 41-56
• 
  Pierre Charbit, Michel Habib, Antoine Mamcarz:
  Influence of the tie-break rule on the end-vertex problem. 57-72
• 
  Igor da Fonseca Ramos, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
  Complexity aspects of the computation of the rank of a graph. 73-86
• 
  Ryuhei Uehara:
  The graph isomorphism problem on geometric graphs. 87-96
• 
  Balázs Keszegh, Balázs Patkós, Xuding Zhu:
  Nonrepetitive colorings of lexicographic product of graphs. 97-110

Volume 16, Number 3, 2014

Graph Theory

• 
  Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
  Balancedness of subclasses of circular-arc graphs. 1-22
• 
  Peng Li, Yaokun Wu:
  A Four-Sweep LBFS Recognition Algorithm for Interval Graphs. 23-50
• 
  Xiaolong Huang, Hengzhe Li, Xueliang Li, Yuefang Sun:
  Oriented diameter and rainbow connection number of a graph. 51-60
• 
  Peter Dukes, Steve Lowdon, Gary MacGillivray:
  Conditional Colourings with Given Template. 61-76

Discrete Algorithms

• 
  Konstanty Junosza-Szaniawski, Pawel Rzazewski:
  An Exact Algorithm for the Generalized List T-Coloring Problem. 77-94

Combinatorics

• 
  Alexandr Valyuzhenich:
  On permutation complexity of fixed points of uniform binary morphisms. 95-128

Graph Theory

• 
  Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
  Genus distributions of cubic series-parallel graphs. 129-146

Combinatorics

• 
  Nándor Sieben, Ian Norris:
  Biased Weak Polyform Achievement Games. 147-172

Graph Theory

• 
  Ben Seamone:
  Bounding the monomial index and (1, l)-weight choosability of a graph. 173-188
• 
  Hung-Chih Lee:
  Packing and covering the balanced complete bipartite multigraph with cycles and stars. 189-202
• 
  Oleg Duginov:
  Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. 203-214

Combinatorics

• 
  Kevin Buchin, Bettina Speckmann, Sander Verdonschot:
  On the Number of Regular Edge Labelings. 215-228

Graph Theory

• 
  Anthony Bonato, William B. Kinnersley, Pawel Pralat:
  Toppling numbers of complete and random graphs. 229-252
• 
  Hal A. Kierstead, Karin Rebecca Saoub:
  Generalized Dynamic Storage Allocation. 253-262
• 
  Olivier Baudon, Julien Bensmail, Éric Sopena:
  Partitioning Harary graphs into connected subgraphs containing prescribed vertices. 263-278

Analysis of Algorithms

• 
  Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva:
  An algorithmic analysis of Flood-it and Free-Flood-it on graph powers. 279-290

Combinatorics

• 
  José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero:
  On the number of radial orderings of planar point sets. 291-304

Discrete Algorithms

• 
  Shigeki Akiyama, Franz Gähler, Jeong-Yup Lee:
  Determining pure discrete spectrum for some self-affine tilings. 305-316

Combinatorics

• 
  Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
  Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. 317-332

Graph Theory

• 
  Frédéric Havet, Nagarajan Paramaguru, Rathinasamy Sampathkumar:
  Detection number of bipartite graphs and cubic graphs. 333-342