Analysis of algorithms is concerned with accurate estimates of complexity parameters of algorithms and aims at predicting the behaviour of a given algorithm run in a given environment. It develops general methods for obtaining closed-form formulae, asymptotic estimates, and probability distributions for combinatorial or probabilistic quantities, that are of interest in the optimization of algorithms. Interest is also placed on the methods themselves, whether combinatorial, probabilistic, or analytic. Combinatorial and statistical properties of discrete structures (strings, trees, tries, dags, graphs, and so on) as well as mathematical objects (e.g., continued fractions, polynomials, operators) that are relevant to the design of efficient algorithms are investigated.

This section of DMTCS is devoted to publishing original research from several domains covered by Volume B of the Handbook of Theoretical Computer Science (Elsevier Publisher). Our scope is suggested by the following list of keywords: automata theory, automata-theoretic complexity, automatic program verification, combinatorics of words, coding theory, concurrency, data bases, formal languages, functional programming, logic in computer science, logic programming, program specification, rewriting, semantics of programming languages, theorem proving.

This section seeks high quality research articles in all aspects of combinatorics, including enumerative combinatorics, probabilistic combinatorics, extremal combinatorics, algebraic combinatorics, additive combinatorics, bijections and mappings to enumeration, structural and enumerative properties of combinatorial objects, ordered sets, posets, quasi-orderings, combinatorial structures with geometric properties, combinatorial geometry, combinatorial objects in statistical physics, positional games, power series and generating functions.

The section covers research in all aspects of the design and analysis of discrete algorithms. This extends also to data structures, combinatorial structures, and lower bounds.

Topics includes: Algorithmic aspects of networks - Algorithmic game theory - Approximation algorithms - Combinatorial optimization - Computational biology - Distributed algorithms - Computational geometry - Data compression - Data structures - Databases and information retrieval - Graph algorithms - Hierarchical memories - Mobile computing - On-line algorithms - Parallel algorithms - Parametrized complexity - Pattern matching - Randomized algorithms - Scheduling - Streaming algorithms

This section of Discrete Mathematics & Theoretical Computer Science seeks high quality articles on structural and algorithmic aspects of graphs and related discrete mathematical models. We particularly seek topics with an intersection between discrete mathematics and computer science. We handle submissions in all areas of finite graph theory.

This section of Discrete Mathematics & Theoretical Computer Science seeks high quality articles on structural and algorithmic aspects of graphs and related discrete mathematical models. We particularly seek topics with an intersection between discrete mathematics and computer science. We handle submissions in all areas of finite graph theory.

This section is closed because it has been split into two new sections, Graph Theory and Discrete Algorithms

This section handles the special issue of DMTCS for 13th International Permutation Patterns conference that has been held in London, UK, 15-19 June.

https://sites.google.com/site/pp2015london/

Special guest editors are

Jonathan Bloom

Mathilde Bouvel

Robert Brignall

This section handles papers related to work that was presented at the special session on Combinatorics and Discrete Mathematics of the Second Pacific Rim Mathematical Association (PRIMA) Congress, held in Shanghai, China, June 24-28, 2013.</br>

Editors: Andreas Dress, Jing Huang, and Yaokun W.