Discrete Mathematics and Theoretical Computer Science

Aims & Scope

Discrete Mathematics & Theoretical Computer Science (DMTCS) is an open-access scientific journal that has been online since 1998. It is a member of the Free Journal Network. DMTCS is organized as an overlay journal. Please see https://www.episciences.org/ for a description. There is no charge for publication and access to DMTCS, and there will never be. We only deal with submissions by authors directly through this website. In particular, we do not accept submissions from third parties. There is also no possibility to speed up publication by paying a fee. Topics by Sections Automata, logics and semantics : 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, databases, formal languages, functional programming, logic in computer science, logic programming, program specification, rewriting, semantics of programming languages, theorem proving. Combinatorics : 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. Discrete algorithms : 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. Graph Theory : this section 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.

A twelfth criterion — whether APC fees are clearly disclosed — is not scored here; it is left out of the total rather than counted as a failure. Publication charges appear in the metrics card above.

Based on the Think.Check.Submit framework by DOAJ, COPE & OASPA. All data from verified open sources.

Source: OpenAlex · Each year’s green bar = citations earned by that year’s papers, counted to date — so recent years look lower simply because their papers haven’t had time to be cited yet.

SJR Quartile by Discipline

Scimago ranks this journal separately in each subject category — its quartile can differ by discipline.

Subject Classification