Editorial Policies

Focus and Scope

DMTCS is a high standard peer-reviewed electronic journal devoted to rapid publication of innovative research which covers the fields of Discrete Mathematics and Theoretical Computer Science and puts a certain emphasis on the intersection of these two fields.

 

Section Policies

General

This "meta" section of DMTCS handles all submissions that do not fit well into one of our genuine sections. It is managed by the Editor-in-Chief and the managers of the other sections.

Editors
  • Joergen Bang-Jensen, University of Southern Denmark
  • Michael Drmota, Technische Universität Wien, Austria
  • Isabelle Guérin Lassous, LIP / Université Lyon I, France
  • Jens Gustedt, INRIA Nancy - Grand Est
  • Mihyun Kang, Graz University of Technology (TU Graz)
  • Anca Muscholl, Université Bordeaux 1, LaBRI
  • Hadas Shachnai, Technion, Haifa, Israel
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Analysis of Algorithms

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.

Editors
  • Luc Devroye, McGill University, Montreal, Canada
  • Michael Drmota, Technische Universität Wien, Austria
  • Philippe Jacquet, INRIA, Rocquencourt, France
  • Wojciech Szpankowski, Purdue University, Indiana, USA
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Automata, Logic 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, data bases, formal languages, functional programming, logic in computer science, logic programming, program specification, rewriting, semantics of programming languages, theorem proving.

Editors
  • Juhani karhumäki, Department of Mathematics
  • Klaus-Jörn Lange, Universität Tübingen, Germany
  • Anca Muscholl, Université Bordeaux 1, LaBRI
  • Howard Straubing, Boston College, USA
  • Val Tannen, University of Pennsylvania, Philadelphia, USA
  • Pascal Weil, CNRS & LaBRI, Université Bordeaux 1, France
Checked Open Submissions Checked Indexed Checked Peer Reviewed

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. Editors

  • Olivier Bernardi, Brandeis University
  • Stefan Felsner, Technische Universität Berlin, Germany
  • Mihyun Kang, Graz University of Technology (TU Graz)
  • Martin Klazar, Charles University, Praha
  • Christian Krattenthaler, Universität Wien, Vienna, Austria
  • Daniel Krob, Ecole Polytechnique, France
  • Piotr Micek, Jagiellonian University, Kraków, Poland
  • Jean-Christophe Novelli, Université Paris-Est Marne-la-Vallée
  • Milos Stojakovic, University of Novi Sad, Serbia
Checked Open Submissions Checked Indexed Checked Peer Reviewed

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

Editors
  • Therese Biedl, University of Waterloo, Canada
  • Hans Bodlaender, Universiteit Utrecht, The Netherlands
  • Esther Ezra, New York University
  • Magnús Halldórsson, Reykjavik University
  • Klaus Jansen, Christian-Albrechts-Universität zu Kiel
  • Rolf Niedermeier, TU Berlin
  • Jaikumar Radhakrishnan, Tata Insititute of Fundamental Research
  • Jiří Sgall, Charles University, Praha, Czech Republic
  • Hadas Shachnai, Technion, Haifa, Israel
  • Zsolt Tuza, Hungarian Academy of Sciences & University of Pannonia, Hungary
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Distributed Computing and Networking

Editors
  • Isabelle Guérin Lassous, LIP / Université Lyon I, France
  • Ted Herman, University of Iowa, USA
  • Bernard Mans, Macquarie University, Australia
  • Andrzej Pelc, Universite du Quebec en Outaouais
  • Andrew Rau-Chaplin, Dalhousie University, Canada
Checked Open Submissions Checked Indexed Checked Peer Reviewed

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.

Editors
  • Joergen Bang-Jensen, University of Southern Denmark
  • Stephan Brandt, University of Southern Denmark Odense
  • Maria Chudnovsky, Columbia University
  • Frederic Havet, CNRS
  • Michael Henning, University of Johannesburg
  • Jing Huang, University of Victoria
  • Tomas Kaiser, University of West Bohemia
  • Ken-ichi Kawarabayashi, NII, Tokyo, Japan
  • Peter Keevash, University of Oxford
  • Matthias Kriesell, Ilmenau University of Technology
  • Dieter Rautenbach, Universität Ulm
  • Zoltán Szigeti, Grenoble INP - Ensimag
  • Zsolt Tuza, Hungarian Academy of Sciences & University of Pannonia, Hungary
  • Anders Yeo, Royal Holloway, University of London
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Graphs and Algorithms

This former section of DMTCS and is replaced by two new ones:

  • Discrete Algorithms
  • Graph Theory

Editors
  • Joergen Bang-Jensen, University of Southern Denmark
  • Therese Biedl, University of Waterloo, Canada
  • Hans Bodlaender, Universiteit Utrecht, The Netherlands
  • Magnús Halldórsson, Reykjavik University
  • Ken-ichi Kawarabayashi, NII, Tokyo, Japan
  • Jan Kratochvil, Charles University, Praha, Czech Republic
  • Matthias Kriesell, Ilmenau University of Technology
  • Hiroshi Nagamochi, Kyoto University, Japan
  • Jaikumar Radhakrishnan, Tata Insititute of Fundamental Research
  • Jiří Sgall, Charles University, Praha, Czech Republic
  • Zsolt Tuza, Hungarian Academy of Sciences & University of Pannonia, Hungary
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Regular Contributions

Unchecked Open Submissions Checked Indexed Unchecked Peer Reviewed
 

Peer Review Process

Submissions to DMTCS undergo a scientific peer review process that is initiated and organized by an editor. The first stage of this review process is to decide whether or not the submission fits well into the scope of DMTCS and to estimate if there are chances for it to be accepted.
The purpose of the reviewing process is then to eventually improve the submission, correct eventual flaws and come to a final decision of whether or not the manuscript is accepted for publication.
The reviewing is done by anonymous referees, that provide their feedback to the authors and the editors via detailed reports. These reports must in particular clearly state the decision that is proposed and give the reasons for which the referee has come to her or his conclusion.
For rejection a single but well justified report is sufficient.
For acception two well justified reports or one report and a well founded opinion of the editor is necessary.

 

Publication Frequency

Author's manuscripts are published as soon as they have been accepted and are be available internationally via the Internet. Due to the combined efforts of our authors (who typeset their final document with our LaTeX style) and our volunteers (who do the final layout) the time between acceptance and final publication has a median below 2 weeks.

 

Open Access Policy

DMTCS is a community effort, run by volunteers. Therefore access to DMTCS is free of charge.
Other than contributing your work (articles, reports, assistance), you may also contribute to our modest expences by making a donation.

 


ISSN: 1365-8050