Volume 102,
Number 1,
April 2007
- Ken S. Hu, Shyun-Shyun Yeoh, Chiuyuan Chen, Lih-Hsing Hsu:
Node-pancyclicity and edge-pancyclicity of hypercube variants.
1-7
Electronic Edition (link) BibTeX
- M. Jiang, Y. P. Luo, S. Y. Yang:
Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm.
8-16
Electronic Edition (link) BibTeX
- Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack:
On approximation by XOR-OBDDs.
17-21
Electronic Edition (link) BibTeX
- Wen-Hung Kuo, Dar-Li Yang:
Single machine scheduling with past-sequence-dependent setup times and learning effects.
22-26
Electronic Edition (link) BibTeX
- Yung H. Tsin:
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity.
27-34
Electronic Edition (link) BibTeX
- Cho-Chin Lin, Hao-Yun Yin:
Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences.
35-40
Electronic Edition (link) BibTeX
Volume 102,
Numbers 2-3,
April 2007
- Min Ji, T. C. Edwin Cheng:
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan.
41-47
Electronic Edition (link) BibTeX
- Zhilin Wu:
A note on the characterization of TL[EF].
48-54
Electronic Edition (link) BibTeX
- Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu:
Greedy online frequency allocation in cellular networks.
55-61
Electronic Edition (link) BibTeX
- Jiong Guo, Falk Hüffner, Hannes Moser:
Feedback arc set in bipartite tournaments is NP-complete.
62-65
Electronic Edition (link) BibTeX
- Xuehou Tan:
Sweeping simple polygons with the minimum number of chain guards.
66-71
Electronic Edition (link) BibTeX
- Benjamin Van Roy:
A short proof of optimality for the MIN cache replacement algorithm.
72-73
Electronic Edition (link) BibTeX
- Narad Rampersad:
On the context-freeness of the set of words containing overlaps.
74-78
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Yoko Kamidoi:
Minimum cost subpartitions in graphs.
79-84
Electronic Edition (link) BibTeX
- Luo Xiaofang:
The 4-choosability of toroidal graphs without intersecting triangles.
85-91
Electronic Edition (link) BibTeX
- Iiro S. Honkala, Tero Laihonen:
On a new class of identifying codes in graphs.
92-98
Electronic Edition (link) BibTeX
- Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann:
Dynamic programming algorithms for the mosaic longest common subsequence problem.
99-103
Electronic Edition (link) BibTeX
- Alexander A. Sherstov:
Powering requires threshold depth 3.
104-107
Electronic Edition (link) BibTeX
- Lenin Mehedy, Md. Kamrul Hasan, Mohammad Kaykobad:
An improved degree based condition for Hamiltonian cycles.
108-112
Electronic Edition (link) BibTeX
- Travis Gagie:
Dynamic Shannon coding.
113-117
Electronic Edition (link) BibTeX
- Kwangkeun Yi, Hosik Choi, Jaehwang Kim, Yongdai Kim:
An empirical study on classification methods for alarms from a bug-finding static C analyzer.
118-123
Electronic Edition (link) BibTeX
- Vaston Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira:
A note on the size of minimal covers.
124-126
Electronic Edition (link) BibTeX
- Fabien Laguillaumie, Damien Vergnaud:
Multi-designated verifiers signatures: anonymity without encryption.
127-132
Electronic Edition (link) BibTeX
Volume 102,
Number 4,
May 2007
Volume 102,
Number 5,
May 2007
Volume 102,
Number 6,
June 2007
Copyright © Sun May 17 00:04:08 2009
by Michael Ley (ley@uni-trier.de)
