the open-access journal Discrete Mathematics and Theoretical Computer
Science (DMTCS).
DMTCS is a high standard peer-reviewed electronic journal devoted to
rapid publication of innovative research in the fields of Discrete
Mathematics and Theoretical Computer Science with an emphasis on the
intersection of the two. It is one of the earliest open-access journal
in the fields, and is listed by ISI.
The Discrete Algorithms 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
Section editors
* Therese Biedl, University of Waterloo, Canada
* Hans Bodlaender, Universiteit Utrecht, The Netherlands
* Magnus Halldorsson, Reykjavik University
* Jan Kratochvil, Charles University, Praha, Czech Republic
* Jaikumar Radhakrishnan, Tata Insititute of Fundamental Research
* Jiri Sgall, Charles University, Praha, Czech Republic
* Zsolt Tuza, Hungarian Academiy of Sciences, Hungary
The Editor-in-Chief of DMTCS is Jens Gustedt, INRIA Nancy - Grand Est.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************