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

Please submit here if your manuscript is not covered by any of the sections (but fits well into DMTCS) or could fit into several.

Editors
  • Michael Drmota, Technische Universität Wien, Austria
  • Isabelle Guérin Lassous, LIP / Université Lyon I, France
  • Jens Gustedt, DMTCS Editor-in-Chief, INRIA Nancy - Grand Est, France
  • Magnús Halldórsson, Reykjavik University
  • Christian Krattenthaler, Universität Wien, Austria
  • Anca Muscholl, Université Bordeaux 1, LaBRI

Indexed

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
  • Artur Czumaj, University of Warwick
  • Luc Devroye, McGill University, Montreal, Canada
  • Michael Drmota, Technische Universität Wien, Austria
  • Mordecai Golin, Hong Kong University of Science and Technology
  • Philippe Jacquet, INRIA, Rocquencourt, France
  • Helmut Prodinger, Stellenbosch University, Matieland, South Africa
  • Wojciech Szpankowski, Purdue University, Indiana, USA

Indexed

Automata, Logic and Semantics

This section of Discrete Mathematics &Theoretical Computer Science 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
  • Wolfgang Thomas, RWTH Aachen, Germany
  • Pascal Weil, CNRS & LaBRI, Université Bordeaux 1, France

Indexed

Combinatorics

This area covers all aspects of Combinatorics: all sorts of enumeration, weighted or unweighted, and the application of bijections and mappings to enumeration and to the illumination of structural properties of combinatorial objects, algebraic aspects such as symmetric functions, Young tableaux, representation theory (Lie groups and Lie algebras, quantum groups, Coxeter groups), Schubert calculus, as well as applications in exactly solvable models in statistical mechanics, knot theory, special functions and orthogonal polynomials.

Editors
  • Stefan Felsner, Technische Universitt Berlin, Germany
  • Tony Guttmann, University of Melbourne, Australia
  • Christian Krattenthaler, Universität Wien, Austria
  • Daniel Krob, Ecole Polytechnique, France
  • Don Rawlings, San Luis Obispo University, USA
  • Xavier Viennot, Université Bordeaux 1, France
  • Herbert Wilf, University of Pennsylvania, Philadelphia, USA

Indexed

Distributed Computing and Networking

This area of DMTCS concerns the theoretical foundations of distributed/parallel computing and of communication networks. We aim to publish high quality scientific papers dealing with questions of modeling, design and analysis of applications, platforms and algorithms in that domain. Topics include but are not limited to:

  • parallel, distributed and grid computing
  • networking
  • mobile computing
  • dynamical networks and environments

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

Indexed

Graphs and Algorithms

This section of Discrete Mathematics &Theoretical Computer Science seeks high quality articles covering all structural and algorithmical aspects of graphs. We handle submissions in all areas of graph theory, including but not limited to extremal graph theory, random graph theory, graph algorithms, graph colouring, connectivity theory infinite graphs, algebraic graph theory, matching theory, lattices, and partially ordered sets.Algorithmic aspects are understood in broad sense (parallel, sequential, randomized, on~line, ...) and extend to all applications dealing with or beeing modelled with graphs.

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
  • Jan Kratochvil, Charles University, Praha, Czech Republic
  • Hiroshi Nagamochi, Kyoto University, Japan
  • Jaikumar Radhakrishnan, Tata Insititute of Fundamental Research
  • Jiří Sgall, Academy of Sciences of the Czech Republic, Praha, Czech Republic
  • Zsolt Tuza, Hungarian Academiy of Sciences, Hungary

Indexed

 

Peer Review Process

All submissions to DMTCS undergo a scientific peer review process that is organized by an editor. The purpose of this process is 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.

 


Valid XHTML 1.0 Transitional