Table of Contents
Automata, Logic and Semantics
| Permutations of context-free, ET0L and indexed languages | PDF PostScript |
| Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche | 167-178 |
Combinatorics
| Avoiding patterns in irreducible permutations | |
| Jean-Luc Baril | 13-30 |
| Dendriform structures for restriction-deletion and restriction-contraction matroid Hopf algebras | |
| Adrian Tanasa, Nguyen Hoang-Nghia, Christophe Tollu | 77-90 |
| Statistics for 3-letter patterns with repetitions in compositions | PDF PostScript |
| Armend Shaban Shabani, Rexhep Gjergji | 147-166 |
| A proof of Zhil'tsov's theorem on decidability of equational theory of epigroups | |
| Inna Mikhaylova | 179-202 |
Discrete Algorithms
| On the complexity of edge-colored subgraph partitioning problems in network optimization | PDF PostScript |
| Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen | 227-244 |
| Energy-optimal algorithms for computing aggregative functions in random networks | |
| Marek Klonowski, Malgorzata Sulkowska | 285-306 |
Distributed Computing and Networking
| Robust Wireless Sensor Network Deployment | |
| Milan Erdelj, Nathalie Mitton, Tahiry Razafindralambo | 105-130 |
Graph Theory
| Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights | |
| Hongliang Lu | 1-12 |
| The complexity of deciding whether a graph admits an orientation with fixed weak diameter | |
| Julien Bensmail, Romaric Duvignau, Sergey Kirgizov | 31-42 |
| Edge-partitioning graphs into regular and locally irregular components | |
| Julien Bensmail, Brett Stevens | 43-58 |
| Rainbow eulerian multidigraphs and the product of cycles | PDF PostScript |
| Susana Clara López, Francesc Antoni Muntaner-Batle | 90-104 |
| Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable | PDF PostScript |
| Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou | 131-146 |
| The irregularity of two types of trees | |
| Li Jianxi, Yang Liu, Wai Chee Shiu | 203-216 |
| The inapproximability for the (0,1)-additive number | PDF PostScript |
| Arash Ahadi, Ali Dehghan | 217-226 |
| Traceability of locally hamiltonian and locally traceable graphs | |
| Johan de Wet, Susan van Aardt | 245-262 |
| Edge Disjoint Hamilton Cycles in Knödel Graphs | PDF PostScript |
| Paulraja Palanivel Subramania Nadar, Sampath Kumar S | 263-284 |
| On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance | PDF PostScript |
| Shih-Yan Chen, Shin-Shin Kao, Hsun Su | 307-314 |
| An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size | PDF PostScript |
| De-Yan Zeng, Jian-Hua Yin | 315-326 |
| Connected Tropical Subgraphs in Vertex-Colored Graphs | PDF PostScript |
| Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis | 327-348 |
| Linear recognition of generalized Fibonacci cubes Qh(111) | |
| Yoomi Rho, Aleksander Vesel | 349-362 |
Special issue PRIMA 2013
| Arithmetic completely regular codes | |
| Jacobus H. Koolen, Woo Sun Lee, William J. Martin, Hajime Tanaka | 59-76 |
ISSN: 1365-8050