期刊名称：DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE ISSN： 1462-7264 出版频率： Quarterly 出版社： DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE, 62 RUE DU CARDINAL MATHIEU, NANCY, FRANCE, F-54000   出版社网址： http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs 期刊网址： http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs 影响因子： 0.596 主题范畴： COMPUTER SCIENCE, SOFTWARE ENGINEERING;    MATHEMATICS, APPLIED;    MATHEMATICS 变更情况： 期刊简介(About the journal)    投稿须知(Instructions to Authors)    编辑部信息(Editorial Board)    About the journal ISSN: 1462-7264. EISSN: 1365-8050 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 Open Submissions Indexed 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 Open Submissions Indexed 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 Open Submissions Indexed 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, Massachusetts Institute of Technology 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 Open Submissions Indexed 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 Magnús Halldórsson, Reykjavik University Klaus Jansen, Christian-Albrechts-Universität zu Kiel Jan Kratochvil, Charles University, Praha, Czech Republic 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 Open Submissions Indexed 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 Open Submissions Indexed 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 Open Submissions Indexed 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 Open Submissions Indexed Peer Reviewed Special issue in honor of Laci Babai's 60th birthday Editors Ákos Seress Open Submissions Indexed Peer Reviewed Regular Contributions Open Submissions Indexed 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. Journal Contact Mailing Address DMTCS c/o Jens Gustedt 67A avenue Jean Jaurès 67100 France France Principal Contact Editorial Office Email: admin@dmtcs.org Support Contact Technical Office Email: admin@dmtcs.org Instructions to Authors Submissions » Online Submissions » Author Guidelines » Copyright Notice » Privacy Statement Online Submissions Already have a Username/Password for Discrete Mathematics & Theoretical Computer Science? Go to Login Need a Username/Password? Go to Registration Registration and login are required to submit items online and to check the status of current submissions.   Author Guidelines DMTCS covers Discrete Mathematics and Theoretical Computer Science as domain of interest. DMTCS is a scientific journal. This requires that your work is original The main results of your paper must not have appeared elsewhere in a journal, neither by yourself nor by somebody else. There is no excuse for plagiarism, not even self-plagiarism. We have a good record in tracking such things down, be warned. important Your results must be of importance to a wider public and should be of interest for more readers than just the referees. self contained Other than for conference proceedings, we don't have any restrictions on the number of pages for an article. So there is no excuse to suppress proofs or not to give verbose examples. On the other hand, self contained short notes are highly welcome. complete Your work must relate to the current state of the art of the domain in question. In particular, foreign and own results external to the manuscript must be correctly credited and complete reference to such related work must be given. legible The journal's language is English, all conventions for scientific work in that language apply. correct Your work must be mathematical correct and its quality of writing must be such that the referees will agree upon this fact. Your writing must be grammatically correct. Be ensured, that especially authors that are non-native speakers of English will receive all possible help to correct flaws. But also have in mind, that incorrect grammar might be the cause of severe misunderstandings and finally result in a rejection of the paper. DMTCS is no circular letter, and no preprint server. If you are looking for that, please consider the wide possibilities that the web offers nowadays.   Submission Preparation Checklist As part of the submission process, authors are required to check off their submission's compliance with all of the following items, and submissions may be returned to authors that do not adhere to these guidelines. The submission has not been previously published, nor is it before another journal for consideration (or an explanation has been provided in Comments to the Editor). The text adheres to the stylistic and bibliographic requirements outlined in the Author Guidelines, which is found in About the Journal. The submission is in PostScript or PDF format If a submission is accepted, authors must provide the sources of the article in LaTeX format suitable to be processed with the journals style file. Hints for preparing a document suitable for that style can be found at http://www.dmtcs.org/sample/.   Copyright Notice If accepted, prior to publication the following copyright has to be signed and returned to the journal's mailing adress: Authors: .................................................. Paper Title: .................................................. I hereby transfer to Discrete Mathematics and Theoretical Computer Science, DMTCS, non profit organization constitued under French law, all the rights concerning the paper herein mentionned. I confirm, that my co-authors and their employer(s) agreed on this step. I am aware of the fact that the DMTCS guarantees free access to the paper on the internet and that the copyright falls back to the authors in case the internet service of DMTCS can not be continued. I am also aware, that the authors, as anybody else, for non-profit use only, have the right to copy the unmodified electronic version of the paper and to distribute it freely in its electronic form. Date: .................................................. Address: .................................................. Signature: ..................................................   Privacy Statement The names and email addresses entered in this journal site will be used exclusively for the stated purposes of this journal and will not be made available for any other purpose or to any other party.   Editorial Board Editor-in-chief Jens Gustedt Editorial Team 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, France Magnús M. Halldórsson, Reykjavik University Mihyun Kang, Graz University of Technology (TU Graz), Austria Christian Krattenthaler, Universität Wien, Vienna, Austria, Austria Anca Muscholl, Université Bordeaux 1, LaBRI, France Hadas Shachnai, Technion, Haifa, Israel Section Editors José L. Balcázar, Universitat Politècnica de Catalunya, Barcelona, Spain Joergen Bang-Jensen, University of Southern Denmark Richard Beigel, Temple University, Philadelphia PA, USA Olivier Bernardi, Massachusetts Institute of Technology, United States Therese Biedl, University of Waterloo, Canada Hans L. Bodlaender, Universiteit Utrecht, The Netherlands Stephan Brandt, University of Southern Denmark Odense, Denmark Veronique Bruyere, Belgium Brigitte Chauvin, University of Versailles and INRIA Rocquencourt Maria Chudnovsky, Columbia University Artur Czumaj, University of Warwick Luc Devroye, McGill University, Montreal, Canada Andreas Dress Michael Drmota, Technische Universität Wien, Austria Stefan Felsner, Technische Universität Berlin, Germany Isabelle Guérin Lassous, LIP / Université Lyon I, France Jens Gustedt, INRIA Nancy - Grand Est, France Magnús M. Halldórsson, Reykjavik University Frederic Havet, CNRS, France Michael Anthony Henning, University of Johannesburg, South Africa Ted Herman, University of Iowa, USA Jing Huang, University of Victoria, Canada Philippe Jacquet, INRIA, Rocquencourt, France Klaus Jansen, Christian-Albrechts-Universität zu Kiel, Germany Tomas Kaiser, University of West Bohemia, Czech Republic Mihyun Kang, Graz University of Technology (TU Graz), Austria Juhani Eero Urho karhumäki, Department of Mathematics Ken-ichi Kawarabayashi, NII, Tokyo, Japan Peter Keevash, University of Oxford, United Kingdom Martin Klazar, Charles University, Praha, Czech Republic Christian Krattenthaler, Universität Wien, Vienna, Austria, Austria Matthias Kriesell, Ilmenau University of Technology Daniel Krob, Ecole Polytechnique, France Klaus-Jörn Lange, Universität Tübingen, Germany Bernard Mans, Macquarie University, Australia Piotr Micek, Jagiellonian University, Kraków, Poland Anca Muscholl, Université Bordeaux 1, LaBRI, France Hiroshi Nagamochi, Kyoto University, Japan Rolf Niedermeier, TU Berlin, Germany Jean-Christophe Novelli, Université Paris-Est Marne-la-Vallée, France Andrzej Pelc, Universite du Quebec en Outaouais Tonian Pitassi, University of Pittsburgh, USA Jaikumar Radhakrishnan, Tata Insititute of Fundamental Research Andrew Rau-Chaplin, Dalhousie University, Canada Dieter Rautenbach, Universität Ulm, Germany Antonio Restivo, Univeristy of Palermo Michel Rigo, University of Liège Uwe Schöning, Universität Ulm, Germany Jiří Sgall, Charles University, Praha, Czech Republic, Czech Republic Hadas Shachnai, Technion, Haifa, Israel Milos Stojakovic, University of Novi Sad, Serbia, Serbia and Montenegro Howard Straubing, Boston College, USA Zoltán Szigeti, Grenoble INP - Ensimag, France Wojciech Szpankowski, Purdue University, Indiana, USA Val Tannen, University of Pennsylvania, Philadelphia, USA Wolfgang Thomas, RWTH Aachen, Germany Zsolt Tuza, Hungarian Academy of Sciences & University of Pannonia, Hungary, Hungary Pascal Weil, CNRS & LaBRI, Université Bordeaux 1, France Yaokun Wu Anders Yeo, Royal Holloway, University of London Layout Editors Ingrid Falk, INRIA/LORIA and Universités Nancy Jens Gustedt, INRIA Nancy - Grand Est, France Copyeditors Michael Drmota, Technische Universität Wien, Austria Ingrid Falk, INRIA/LORIA and Universités Nancy Isabelle Guérin Lassous, LIP / Université Lyon I, France Jens Gustedt, INRIA Nancy - Grand Est, France Magnús M. Halldórsson, Reykjavik University Christian Krattenthaler, Universität Wien, Vienna, Austria, Austria Anca Muscholl, Université Bordeaux 1, LaBRI, France Michel Rigo, University of Liège Proofreaders Ingrid Falk, INRIA/LORIA and Universités Nancy Jens Gustedt, INRIA Nancy - Grand Est, France