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