Discrete Mathematics & Theoretical Computer Science
With great sadness the Editorial Board of Discrete Mathematics and Theoretical Computer Science must report that our long serving Editor, Herb S. Wilf, passed away on January 7, after a brave battle with complications from ALS.
Herb has influenced the development of discrete mathematics over the past 40 years tremendously, by his original ideas, by his eye for beauty in mathematics, by the constant encouragement he had for others, and, through his engaging personality, by his lectures and teaching. We will all miss the scientist and human Herb Wilf enormously.
Warning: Due to massif spamming of our user database, it is currently not possible to create new user ids via our web interface. We hope to resolve this problem soon. In the mean time, if you want to do a submission to DMTCS and do not yet have a user id here, please contact us directly by mail and we will create it for you.
- Analysis of Algorithms
- Automata, Logic and Semantics
- Combinatorics
- Discrete Algorithms
- Distributed Computing and Networking
- Graph Theory
The journal is devoted to a quest of quality and immediacy. The median value for acceptance of papers (including refereeing and all eventual revisions) has been about 10 month for papers submitted in 2007.
Author's manuscripts are published as soon as they have been accepted and the authors provide the final LaTeX sources, They are freely available 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 reception of the sources and final publication has a median below 2 weeks.
DMTCS is published by a French association of the same name in cooperation with the Laboratoire Lorrain de Recherche en Informatique et ses Applications, LORIA, in Nancy, France, which provides us with our primary server.
Vol 14, No 1 (2012)
Table of Contents
Automata, Logic and Semantics
| Monadic second-order classes of forests with a monadic second-order 0-1 law | PDF PostScript |
| Jason P. Bell, Stanley N. Burris, Karen Yeats | 87-108 |
Combinatorics
| Adaptive Identification of Sets of Vertices in Graphs | PDF PostScript |
| Ville Junnila | 69-86 |
Distributed Computing and Networking
| Optimal Computer Crash Performance Precaution | PDF PostScript |
| Efraim Laksman, Håkan Lennerstad, Lars Lundberg | 55-68 |
Graph Theory
| The generalized 3-connectivity of Cartesian product | PDF PostScript |
| Hengzhe Li, Xueliang Li, Yuefang Sun | 43-54 |
Graphs and Algorithms
| Vertex-colouring edge-weightings with two edge weights | PDF PostScript |
| Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens | 1-20 |
| On Hamilton-chain saturated uniform hypergraphs | PDF PostScript |
| Andrzej Zak, Aneta Dudek | 21-28 |
| A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set | PDF PostScript |
| Serge Gaspers, Mathieu Liedloff | 29-42 |
| Bounds for the minimum oriented diameter | PDF PostScript |
| Sascha Kurz, Martin Lätsch | 109-140 |
ISSN: 1365-8050