Discrete Mathematics & Theoretical Computer Science


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.

Sections:

  • 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 12 month for papers submitted in 2011.

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 of 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 15, No 2 (2013)

Table of Contents

Analysis of Algorithms

Connectivity for line-of-sight networks in higher dimensions PDF PostScript
Luc Devroye, Linda Farczadi 71-86

Combinatorics

Descent variation of samples of geometric variables PDF PostScript
Charlotte Brennan, Arnold Knopfmacher 1-12
Operations on partially ordered sets and rational identities of type A PDF PostScript
Adrien Boussicault 13-32
On the enumeration of d-minimal permutations PDF PostScript
Mathilde Bouvel, Luca Ferrari 33-48

Discrete Algorithms

Efficient repeat finding in sets of strings via suffix arrays PDF PostScript
Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber 59-70

Graph Theory

Bipartite Powers of k-chordal Graphs PDF PostScript
L. Sunil Chandran, Rogers Mathew 49-58
Improved Bounds on the Crossing Number of Butterfly Network PDF PostScript
Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah 87-94


ISSN: 1365-8050