Volume 337,
Number 1-3,
June 2005
- Roberto Giacobazzi, Isabella Mastroeni:
Transforming semantics by abstract interpretation.
1-50
Electronic Edition (link) BibTeX
- Gennaro Costagliola, Filomena Ferrucci, Carmine Gravino:
Adding symbolic information to picture models: definitions and properties.
51-104
Electronic Edition (link) BibTeX
- Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the complexity of decidable cases of the commutation problem of languages.
105-118
Electronic Edition (link) BibTeX
- Ian McQuillan:
The generative capacity of block-synchronized context-free grammars.
119-133
Electronic Edition (link) BibTeX
- T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Semi-on-line multiprocessor scheduling with given total processing time.
134-146
Electronic Edition (link) BibTeX
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer:
Gathering of asynchronous robots with limited visibility.
147-168
Electronic Edition (link) BibTeX
- Wai-Fong Chuan:
Factors of characteristic words of irrational numbers.
169-182
Electronic Edition (link) BibTeX
- Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto:
On state-alternating context-free grammars.
183-216
Electronic Edition (link) BibTeX
- Philip Bille:
A survey on tree edit distance and related problems.
217-239
Electronic Edition (link) BibTeX
- Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter:
Generating bicliques of a graph in lexicographic order.
240-248
Electronic Edition (link) BibTeX
- Michael Elkin, David Peleg:
Approximating k-spanner problems for kge2.
249-277
Electronic Edition (link) BibTeX
- Dimitar P. Guelev, Dang Van Hung:
On the completeness and decidability of duration calculus with iteration.
278-304
Electronic Edition (link) BibTeX
- Jianer Chen, Iyad A. Kanj:
On approximating minimum vertex cover for graphs with perfect matching.
305-318
Electronic Edition (link) BibTeX
- Martin Aigner, Gianluca De Marco, Manuela Montangero:
The plurality problem with three colors and more.
319-330
Electronic Edition (link) BibTeX
- Bodo Manthey, Rüdiger Reischuk:
The intractability of computing the Hamming distance.
331-346
Electronic Edition (link) BibTeX
- Shlomo Hoory, Stefan Szeider:
Computing unsatisfiable k-SAT instances with few occurrences per variable.
347-359
Electronic Edition (link) BibTeX
- Arthur W. Chou, Ker-I Ko:
The computational complexity of distance functions of two-dimensional domains.
360-369
Electronic Edition (link) BibTeX
- Sun-Yuan Hsieh:
Embedding longest fault-free paths onto star graphs with more vertex faults.
370-378
Electronic Edition (link) BibTeX
- Henk Bruin, Oksan Volkova:
The complexity of Fibonacci-like kneading sequences.
379-389
Electronic Edition (link) BibTeX
- Li-Sha Huang, Minming Li, Bo Zhang:
Approximation of Walrasian equilibrium in single-minded auctions.
390-398
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:25:01 2009
by Michael Ley (ley@uni-trier.de)