Volume 20, Number 1, February 2009
, Yoshio Okamoto
: Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes.
: New Extensions of Pairing-Based Signatures into Universal (Multi) Designated Verifier Signatures.
Volume 20, Number 2, April 2009
: On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components.
: A Note on Scheduling Parallel Unit Jobs on Hypercubes.
Volume 20, Number 3, June 2009
: Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency.
: Proposal of a Semiformal Model of Anonymous Communication.
Volume 20, Number 4, August 2009
, Martin Kutrib
: Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity.
: Path Decomposition and Semilinearity of Petri Nets.
Volume 20, Number 5, October 2009
: On the Power of Cooperating Morphisms via Reachability Problems.
: The Length of Subset Reachability in Nondeterministic Automata.
Volume 20, Number 6, December 2009