Table of Contents
Analysis of Algorithms
On the Dynamics of Systems of Urns | |
Marek Klonowski, Jacek Cichoń, Rafał Kapelko | 235-250 |
Automata, Logic and Semantics
Classical Automata on Promise Problems | |
Viliam Geffert, Abuzer Yakaryilmaz | 157-180 |
Some undecidable problems about the trace-subshift associated to a Turing machine | |
Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés | 267-284 |
Combinatorics
Minimum Number of Colors: the Turk’s Head Knots Case Study | PDF PostScript |
Pedro Lopes, Joao Matias | 1-30 |
On avoidance of patterns of the form σ-τ by words over a finite alphabet | |
Toufik Mansour, Mark Shattuck | 181-202 |
Symmetries of Monocoronal Tilings | |
Dirk Frettlöh, Alexey Garber | 203-234 |
A relation on 132-avoiding permutation patterns | |
Natalie Aisbett | 285-302 |
Discrete Algorithms
Improving Vertex Cover as a Graph Parameter | |
Robert Ganian | 77-100 |
Reducing the rank of a matroid | |
Gwenaël Joret, Adrian Vetta | 143-156 |
Graph Theory
The game chromatic number of trees and forests | PDF PostScript |
Charles L Dunn, Victor Larsen, Kira Lindke, Troy Retter, Dustin Toci | 31-48 |
On graphs double-critical with respect to the colouring number | |
Matthias Kriesell, Anders Sune Pedersen | 49-62 |
The complexity of P4-decomposition of regular graphs and multigraphs | |
Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael J. Plantholt, Shailesh K. Tipnis | 63-76 |
Disimplicial arcs, transitive vertices, and disimplicial eliminations | |
Martiniano Roberto Eguía, Francisco Juan Soulignac | 101-118 |
Packing Plane Perfect Matchings into a Point Set | |
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid | 119-142 |
Cubical coloring — fractional covering by cuts and semidefinite programming | PDF PostScript |
Robert Šámal | 251-266 |
The double competition multigraph of a digraph | |
Jeongmi Park, Yoshio Sano | 303-310 |
ISSN: 1365-8050