Volume 396,
Numbers 1-3,
May 2008
- Wenbin Chen, Jiangtao Meng, Dengpan Yin:
An improved lower bound for approximating minimum GCD multiplier in linfinity norm (GCDMinfinity).
1-9
Electronic Edition (link) BibTeX
- L. Salinas, E. Goles:
Covering by squares.
10-27
Electronic Edition (link) BibTeX
- Longcheng Liu, Enyu Yao:
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance.
28-34
Electronic Edition (link) BibTeX
- W. M. B. Dukes, M. F. Flanagan, Toufik Mansour, Vincent Vajnovszki:
Combinatorial Gray codes for classes of pattern avoiding permutations.
35-49
Electronic Edition (link) BibTeX
- Min-Zheng Shieh, Shi-Chun Tsai:
Jug measuring: Algorithms and complexity.
50-62
Electronic Edition (link) BibTeX
- Bruno Escoffier, Jérôme Monnot:
A better differential approximation ratio for symmetric TSP.
63-70
Electronic Edition (link) BibTeX
- Miguel Couceiro, Maurice Pouzet:
On a quasi-ordering on Boolean functions.
71-87
Electronic Edition (link) BibTeX
- Trevor I. Fenner, Mark Levene, George Loizou:
Modelling the navigation potential of a web page.
88-96
Electronic Edition (link) BibTeX
- Xavier Défago, Samia Souissi:
Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity.
97-112
Electronic Edition (link) BibTeX
- Paul E. Dunne, Yann Chevaleyre:
The complexity of deciding reachability properties of distributed negotiation schemes.
113-144
Electronic Edition (link) BibTeX
- Raphael Yuster:
All-pairs disjoint paths from a common ancestor in O~(ninfinit) time.
145-150
Electronic Edition (link) BibTeX
- Xueliang Li, Wenli Zhou:
The 2nd-order conditional 3-coloring of claw-free graphs.
151-157
Electronic Edition (link) BibTeX
- Sandy Irani, Vitus J. Leung:
Probabilistic analysis for scheduling with conflicts.
158-179
Electronic Edition (link) BibTeX
- Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu:
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity.
180-190
Electronic Edition (link) BibTeX
- Ying-You Chen, Dyi-Rong Duh, Tai-Ling Ye, Jung-Sheng Fu:
Weak-vertex-pancyclicity of (n, k)-star graphs.
191-199
Electronic Edition (link) BibTeX
- Regant Y. S. Hung, H. F. Ting:
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay.
200-211
Electronic Edition (link) BibTeX
- David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Partitioned probe comparability graphs.
212-222
Electronic Edition (link) BibTeX
- Joan Boyar, René Peralta:
Tight bounds for the multiplicative complexity of symmetric functions.
223-246
Electronic Edition (link) BibTeX
Notes
Copyright © Sun May 17 00:25:15 2009
by Michael Ley (ley@uni-trier.de)