Volume 97,
Number 1,
16 January 2006
- Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu:
A tight lower bound for job scheduling with cancellation.
1-3
Electronic Edition (link) BibTeX
- Xiaotie Deng, Li-Sha Huang:
On the complexity of market equilibria with maximum social welfare.
4-11
Electronic Edition (link) BibTeX
- Amos Beimel, Enav Weinreb:
Monotone circuits for monotone weighted threshold functions.
12-18
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser:
Transforming spanning trees and pseudo-triangulations.
19-22
Electronic Edition (link) BibTeX
- Haim Kaplan, Nira Shafrir:
The greedy algorithm for edit distance with moves.
23-27
Electronic Edition (link) BibTeX
- Bolette Ammitzbøll Madsen:
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter.
28-30
Electronic Edition (link) BibTeX
- Uriel Feige, Daniel Reichman:
On the hardness of approximating Max-Satisfy.
31-35
Electronic Edition (link) BibTeX
- Salvatore Caporaso:
A decidable characterization of the classes between lintime and exptime.
36-40
Electronic Edition (link) BibTeX
Volume 97,
Number 2,
31 January 2006
Volume 97,
Number 3,
14 February 2006
- Sangwon Kim, Joonwon Lee, Jinsoo Kim:
Runtime feasibility check for non-preemptive real-time periodic tasks.
83-87
Electronic Edition (link) BibTeX
- Xiaofan Yang, Jianqiu Cao, Graham M. Megson, Jun Luo:
Minimum neighborhood in a generalized cube.
88-93
Electronic Edition (link) BibTeX
- Jun-Ming Xu, Meijie Ma, Min Lü:
Paths in Möbius cubes and crossed cubes.
94-97
Electronic Edition (link) BibTeX
- Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results.
98-103
Electronic Edition (link) BibTeX
- Srecko Brlek, Sardaouna Hamadou, John Mullins:
A flaw in the electronic commerce protocol SET.
104-108
Electronic Edition (link) BibTeX
- Jiong Guo, Rolf Niedermeier:
A fixed-parameter tractability result for multicommodity demand flow in trees.
109-114
Electronic Edition (link) BibTeX
- Wenjun Xiao, Behrooz Parhami:
Cayley graphs as models of deterministic small-world networks.
115-117
Electronic Edition (link) BibTeX
- Jung Hee Cheon, Woo-Hwan Kim, Hyun Soo Nam:
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme.
118-123
Electronic Edition (link) BibTeX
- Yuan Li, Thomas W. Cusick:
Linear structures of symmetric functions over finite fields.
124-127
Electronic Edition (link) BibTeX
Volume 97,
Number 4,
28 February 2006
Volume 97,
Number 5,
16 March 2006
- Yves F. Verhoeven:
Enhanced algorithms for Local Search.
171-176
Electronic Edition (link) BibTeX
- Adam Kasperski, Pawel Zielinski:
An approximation algorithm for interval data minmax regret combinatorial optimization problems.
177-180
Electronic Edition (link) BibTeX
- Pavlos Efraimidis, Paul G. Spirakis:
Weighted random sampling with a reservoir.
181-185
Electronic Edition (link) BibTeX
- Morteza Fayyazi, David R. Kaeli, Waleed Meleis:
An adjustable linear time parallel algorithm for maximum weight bipartite matching.
186-190
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Kjartan Høie:
Pathwidth of cubic graphs and exact algorithms.
191-196
Electronic Edition (link) BibTeX
- Ewa Misiolek, Danny Z. Chen:
Two flow network simplification algorithms.
197-202
Electronic Edition (link) BibTeX
- Kang Li, Lusheng Wang:
A polynomial time approximation scheme for embedding a directed hypergraph on a ring.
203-207
Electronic Edition (link) BibTeX
- Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem.
208-211
Electronic Edition (link) BibTeX
Volume 97,
Number 6,
31 March 2006
Copyright © Sun May 17 00:04:07 2009
by Michael Ley (ley@uni-trier.de)
