Volume 101,
Number 1,
January 2007
- Joost Engelfriet, Tjalling Gelsema:
An exercise in structural congruence.
1-5
Electronic Edition (link) BibTeX
- Houman Alborzi, Hanan Samet:
Execution time analysis of a top-down R-tree construction algorithm.
6-12
Electronic Edition (link) BibTeX
- Eric McDermid, Christine Cheng, Ichiro Suzuki:
Hardness results on the man-exchange stable marriage problem with short preference lists.
13-19
Electronic Edition (link) BibTeX
- Junhu Wang:
Binary equality implication constraints, normal forms and data redundancy.
20-25
Electronic Edition (link) BibTeX
- Uriel Feige, James R. Lee:
An improved approximation ratio for the minimum linear arrangement problem.
26-29
Electronic Edition (link) BibTeX
- Vardges Melkonian:
Flows in dynamic networks with aggregate arc capacities.
30-35
Electronic Edition (link) BibTeX
- Faisal N. Abu-Khzam, Michael A. Langston:
Linear-time algorithms for problems on planar graphs with fixed disk dimension.
36-40
Electronic Edition (link) BibTeX
- Richard S. Bird, Stefan Sadnicki:
Minimal on-line labelling.
41-45
Electronic Edition (link) BibTeX
- Yoshinobu Kawabe, Ken Mano, Hideki Sakurada, Yasuyuki Tsukada:
Theorem-proving anonymity of infinite-state systems.
46-51
Electronic Edition (link) BibTeX
Volume 101,
Number 2,
January 2007
- Peter Clifford, Raphaël Clifford:
Simple deterministic wildcard matching.
53-54
Electronic Edition (link) BibTeX
- Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
On the longest increasing subsequence of a circular list.
55-59
Electronic Edition (link) BibTeX
- Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi:
Wait-free regular storage from Byzantine components.
60-65
Electronic Edition (link) BibTeX
- Daniel Sawitzki:
Lower bounds on the OBDD size of two fundamental functions' graphs.
66-71
Electronic Edition (link) BibTeX
- Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata:
Isomorphic factorization, the Kronecker product and the line digraph.
72-77
Electronic Edition (link) BibTeX
- MoonBae Song, KwangJin Park, Ki-Sik Kong, SangKeun Lee:
Bottom-up nearest neighbor search for R-trees.
78-85
Electronic Edition (link) BibTeX
- Eric Bach:
Bounds for the expected duration of the monopolist game.
86-92
Electronic Edition (link) BibTeX
Volume 101,
Number 3,
February 2007
- Chang-Hsiung Tsai, Shu-Yun Jiang:
Path bipancyclicity of hypercubes.
93-97
Electronic Edition (link) BibTeX
- Lev Reyzin, Nikhil Srivastava:
On the longest path algorithm for reconstructing trees from distance matrices.
98-100
Electronic Edition (link) BibTeX
- Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An improved exact algorithm for the domatic number problem.
101-106
Electronic Edition (link) BibTeX
- Ulrich Ultes-Nitsche:
A power-set construction for reducing Büchi automata to non-determinism degree two.
107-111
Electronic Edition (link) BibTeX
- Dana Ron, Amir Rosenfeld, Salil P. Vadhan:
The hardness of the Expected Decision Depth problem.
112-118
Electronic Edition (link) BibTeX
- Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter:
On transitive orientations with restricted covering graphs.
119-125
Electronic Edition (link) BibTeX
- Marcin Peczarski:
The Ford-Johnson algorithm still unbeaten for less than 47 elements.
126-128
Electronic Edition (link) BibTeX
- Michael J. Collins, David Kempe, Jared Saia, Maxwell Young:
Nonnegative integral subset representations of integer sets.
129-133
Electronic Edition (link) BibTeX
- Min Chen, André Raspaud, Weifan Wang:
Three-coloring planar graphs without short cycles.
134-138
Electronic Edition (link) BibTeX
Volume 101,
Number 4,
February 2007
Volume 101,
Number 5,
March 2007
Volume 101,
Number 6,
March 2007
Copyright © Wed Jun 4 19:12:20 2008
by Michael Ley (ley@uni-trier.de)
