Volume 107,
Number 1,
June 2008
- Fanica Gavril:
Minimum weight feedback vertex sets in circle graphs.
1-6
- Frank Pok Man Chu:
A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements.
7-12
- Pedro García, Manuel Vazquez de Parga, Damián López:
On the efficient construction of quasi-reversible automata for reversible languages.
13-17
- Pao-Lien Lai, Hong-Chun Hsu:
The two-equal-disjoint path cover problem of Matching Composition Network.
18-23
- Jianxin Wang, Jianer Chen, Min Huang:
An improved lower bound on approximation algorithms for the Closest Substring problem.
24-28
- Michael Segal:
Fast algorithm for multicast and data gathering in wireless networks.
29-33
- Artur Alves Pessoa:
A note on the construction of error detecting/correcting prefix codes.
34-38
- Shai Gutner:
Elementary approximation algorithms for prize collecting Steiner tree problems.
39-44
Volume 107,
Number 2,
July 2008
Volume 107,
Numbers 3-4,
July 2008
- Jun Yan, Jian Zhang:
An efficient method to generate feasible paths for basis path testing.
87-92
- Joanna Skowronek-Kaziów:
1, 2 Conjecture - the multiplicative version.
93-95
- Sören Laue, Domagoj Matijevic:
Approximating k-hop minimum spanning trees in Euclidean metrics.
96-101
- Haihui Zhang, Zhiren Sun:
On 3-choosability of planar graphs without certain cycles.
102-106
- Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang:
A relaxation of Havel's 3-color problem.
107-109
- Jung-Sheng Fu:
Conditional fault Hamiltonicity of the complete graph.
110-113
- Lawrence S. Moss:
Confusion of memory.
114-119
- Joseph S. B. Mitchell, Valentin Polishchuk:
Minimum-perimeter enclosures.
120-124
- François Delbot, Christian Laforest:
A better list heuristic for vertex cover.
125-127
- John S. Fitzgerald, Cliff B. Jones:
The connection between two ways of reasoning about partial functions.
128-132
Volume 107,
Number 5,
August 2008
- Orr Dunkelman, Nathan Keller:
Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers.
133-137
- Timothy M. Chan:
Well-separated pair decomposition in linear time?
138-141
- Hsin-Wen Wei, Kwei-Jay Lin, Wan-Chen Lu, Wei Kuan Shih:
Generalized rate monotonic schedulability bounds using relative period ratios.
142-148
- Meena Mahajan, Jayalal M. N. Sarma:
Rigidity of a simple extended lower triangular matrix.
149-153
- Mathieu Liedloff:
Finding a dominating set on bipartite graphs.
154-157
- Yi-Hsiung Chao, Shun-Shii Lin, Kwei-Jay Lin:
Schedulability issues for EDZL scheduling on real-time multiprocessor systems.
158-164
- M. L. Chiang, Shu-Chin Wang, L. Y. Tseng:
The incremental agreement.
165-170
- Chung-Meng Lee, Jimmy J. M. Tan, Lih-Hsing Hsu:
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position.
171-176
- Subhashis Majumder, Bhargab B. Bhattacharya:
On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips.
177-182
- Gustavo M. D. Vieira, Luiz E. Buzato:
On the coordinator's rule for Fast Paxos.
183-187
- Takunari Miyazaki:
On the asymmetric complexity of the group-intersection problem.
188-193
- Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing crossings: Convex hulls of segment and plane intersections.
194-197
Volume 107,
Number 6,
August 2008
- Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
The online Prize-Collecting Traveling Salesman Problem.
199-204
- Wen-Qing Wang, Xie-Bin Chen:
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges.
205-210
- Haibin Shen, Yier Jin:
Low complexity bit parallel multiplier for GF(2m) generated by equally-spaced trinomials.
211-215
- Karel De Loof, Bernard De Baets, Hans De Meyer:
On the random generation of monotone data sets.
216-220
- José Miguel Cañete Valdeón, Fernando Enríquez, Javier Ortega, Ernesto Veláquez:
Clarifying the semantics of value in use cases through Jackson's Problem Frames.
221-229
- Daniel Andrén, Lars Hellström, Klas Markström:
Fast multiplication of matrices over a finitely generated semiring.
230-234
- Kai Engelhardt, Yoram Moses:
Single-bit messages are insufficient for data link over duplicating channels.
235-239
- Michael H. Goldwasser, Arundhati Bagchi Misra:
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts.
240-245
- Behrooz Parhami:
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings.
246-251
- Li Sun, Fuji Zhang, Jianguo Qian:
Multi-hop all-to-all optical routings in Cartesian product networks.
252-256
- Min-Sheng Lin, Yung-Jui Chen:
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph.
257-264
Copyright © Mon Nov 23 21:57:33 2009
by Michael Ley (ley@uni-trier.de)
