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.

In 2014, DMTCS publishes three journal issues

  • 16:1, regular issue, publication completed.
  • 16:2, special issue for PRIMA, publication ongoing.
  • 16:3, regular issue, publication is ongoing.


  • 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 16, No 2 (2014)

The Second Pacific Rim Mathematical Association (PRIMA) Congress was held in Shanghai, China, June 24-28, 2013. With more than 800 registered participants from around the world, the conference was the second biggest mathematical event that ever took place in China (second only to the International Congress of Mathematicians (ICM) held in Beijing, China, August 20-28, 2002).

Highlights of the conference were 2 public lectures, given by Ronald Graham (University of California, San Diego) and Cédric Villani (Université de Lyon and Institut Henri Poincaré). There were also 11 plenary lectures and 23 special sessions.

The special session on Combinatorics and Discrete Mathematics consisted of 22 lectures covering the frontier of many research areas, presented by the following invited speakers:

Eiichi Bannai (Shanghai Jiao Tong University), Andreas Brandstädt (University of Rostock), David Bryant (University of Otago), L. Sunil Chandran (Indian Institute of Science), Nikolai Dolbilin (Steklov Mathematical Institute), Andreas Dress (Chinese Academy of Sciences), Stefan Grünewald (Chinese Academy of Sciences), Michel Habib (University Paris Diderot Paris 7), Pinar Heggernes (University of Bergen), Pavol Hell (Simon Fraser University), Jing Huang (University of Victoria), Jan Kratochvíl (Charles University), Jack Koolen (University of Science and Technology of China), Brendan McKay (Australian National University), Jaroslav Nešetřil (Charles University), Sang-il Oum (Korean Advanced Institute of Science and Technology), Bruce Reed (McGill University), Moshe Rosenfeld (University of Washington Tacoma), Jayme L. Szwarcfiter (Universidade Fed. do Rio de Janeiro), Mikhail Tyaglov (Shanghai Jiao Tong University), Ryuhei Uehara (Japan Advanced Institute of Science and Technology), Xuding Zhu (Zhejiang Normal University).

This special issue of Discrete Mathematics & Theoretical Computer Science collects papers related to work that was presented at this special session and in some further pertinent contributions. We would like to thank all participants (invited speakers, authors, and anonymous referees) for their presence and contribution.

Andreas Dress, Jing Huang, and Yaokun Wu

Table of Contents

Special issue PRIMA 2013

Diversities and the Geometry of Hypergraphs PDF PostScript
David Bryant, Paul Tupper 1-20
Uniquely monopolar-partitionable block graphs PDF PostScript
Xuegang Chen, Jing Huang 21-34
On Additive Combinatorics of Permutations of ℤn PDF PostScript
L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh 35-40
A matroid associated with a phylogenetic tree PDF PostScript
Andreas Dress, Katharina Huber, Mike Steel 41-56
Influence of the tie-break rule on the end-vertex problem PDF PostScript
Pierre Charbit, Michel Habib, Antoine Mamcarz 57-72
Complexity aspects of the computation of the rank of a graph PDF PostScript
Igor da Fonseca Ramos, Vinícius F. dos Santos, Jayme L. Szwarcfiter 73-86
The graph isomorphism problem on geometric graphs PDF PostScript
Ryuhei Uehara 87-96
Nonrepetitive colorings of lexicographic product of graphs PDF PostScript
Balázs Keszegh, Balázs Patkós, Xuding Zhu 97-110

ISSN: 1365-8050