Volume 332,
Number 1-3,
February 2005
- Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center problems with minimum coverage.
1-17
Electronic Edition (link) BibTeX
- Alain Daurat:
Determination of Q-convex sets by X-rays.
19-45
Electronic Edition (link) BibTeX
- Lila Kari, Petr Sosík:
Aspects of shuffle and deletion on trajectories.
47-61
Electronic Edition (link) BibTeX
- Steven S. Seiden, Peter P. Chen, Robert F. Lax, Jianhua Chen, Guoli Ding:
New bounds for randomized busing.
63-81
Electronic Edition (link) BibTeX
- Marc Demange, Vangelis Th. Paschos:
On-line vertex-covering.
83-108
Electronic Edition (link) BibTeX
- Qingmin Shi, Joseph JáJá:
A new framework for addressing temporal range queries and some preliminary results.
109-121
Electronic Edition (link) BibTeX
- Maria J. Serna, Luca Trevisan, Fatos Xhafa:
The approximability of non-Boolean satisfiability problems and restricted integer programming.
123-139
Electronic Edition (link) BibTeX
- Sylvain Lombardy, Jacques Sakarovitch:
Derivatives of rational expressions with multiplicity.
141-177
Electronic Edition (link) BibTeX
- Jean Berstel, Luc Boasson, Michel Latteux:
Mixed languages.
179-198
Electronic Edition (link) BibTeX
- Franz-Josef Brandenburg, Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages.
199-232
Electronic Edition (link) BibTeX
- Salvatore La Torre, Aniello Murano, Margherita Napoli:
Weak Muller acceptance conditions for tree automata.
233-250
Electronic Edition (link) BibTeX
- Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online matching on a line.
251-264
Electronic Edition (link) BibTeX
- Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting models for 2SAT and 3SAT formulae.
265-291
Electronic Edition (link) BibTeX
- Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam:
A lower bound on compression of unknown alphabets.
293-311
Electronic Edition (link) BibTeX
- Marco Pedicini:
Greedy expansions and sets with deleted digits.
313-336
Electronic Edition (link) BibTeX
- Klaus Weihrauch, Ning Zhong:
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing.
337-366
Electronic Edition (link) BibTeX
- A. Cincotti:
Three-player partizan games.
367-389
Electronic Edition (link) BibTeX
- Longtao He, Binxing Fang, Jie Sui:
The wide window string matching algorithm.
391-404
Electronic Edition (link) BibTeX
- Jean Cardinal, Stefan Langerman:
Designing small keyboards is hard.
405-415
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi:
On the one-sided crossing minimization in a bipartite graph with large degrees.
417-446
Electronic Edition (link) BibTeX
- Hong-Gwa Yeh, Xuding Zhu:
Resource-sharing system scheduling and circular chromatic number.
447-460
Electronic Edition (link) BibTeX
- H. J. Huang, Li Jiao, To-Yat Cheung:
Property-preserving subnet reductions for designing manufacturing systems with shared resources.
461-485
Electronic Edition (link) BibTeX
- Harumichi Nishimura, Masanao Ozawa:
Uniformity of quantum circuit families for error-free algorithms.
487-496
Electronic Edition (link) BibTeX
- Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
On the differential approximation of MIN SET COVER.
497-513
Electronic Edition (link) BibTeX
- Jesper Makholm Byskov, Bolette Ammitzbøll Madsen, Bjarke Skjernaa:
New algorithms for Exact Satisfiability.
515-541
Electronic Edition (link) BibTeX
- Reza Gharavi, V. Anantharam:
An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices.
543-557
Electronic Edition (link) BibTeX
- Dekel Tsur:
Sequencing by hybridization with errors: handling longer sequences.
559-566
Electronic Edition (link) BibTeX
- Maxime Crochemore, Jacques Désarménien, Dominique Perrin:
A note on the Burrows - CWheeler transformation.
567-572
Electronic Edition (link) BibTeX
- Ali Aberkane, James D. Currie:
The Thue-Morse word contains circular 5/2+ power free words of every length.
573-581
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:25:00 2009
by Michael Ley (ley@uni-trier.de)
