Volume 81,
Number 1,
16 January 2002
Volume 81,
Number 2,
31 January 2002
- Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades:
Width-restricted layering of acyclic digraphs with consideration of dummy nodes.
59-63
Electronic Edition (link) BibTeX
- Pascal Koiran:
Transfer theorems via sign conditions.
65-69
Electronic Edition (link) BibTeX
- John Noga, Steven S. Seiden, Gerhard J. Woeginger:
A faster off-line algorithm for the TCP acknowledgement problem.
71-73
Electronic Edition (link) BibTeX
- Holger Petersen:
Bounds for the Element Distinctness Problem on one-tape Turing machines.
75-79
Electronic Edition (link) BibTeX
- Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov:
Minimizing the total weighted completion time of deteriorating jobs.
81-84
Electronic Edition (link) BibTeX
- Noritaka Kobayashi, Tatsuhiro Tsuchiya, Tohru Kikuno:
A new method for constructing pair-wise covering designs for software testing.
85-91
Electronic Edition (link) BibTeX
- R. W. Bulterman, F. W. van der Sommen, Gerard Zwaan, Tom Verhoeff, A. J. M. van Gasteren, W. H. J. Feijen:
On computing a longest path in a tree.
93-96
Electronic Edition (link) BibTeX
- Tae-Sun Chung, Hyoung-Joo Kim:
Extracting indexing information from XML DTDs.
97-103
Electronic Edition (link) BibTeX
- Wei Lai, Peter Eades:
Removing edge-node intersections in drawings of graphs.
105-110
Electronic Edition (link) BibTeX
- Diganta Goswami, Rajib Mall:
An efficient method for computing dynamic program slices.
111-117
Electronic Edition (link) BibTeX
Volume 81,
Number 3,
14 February 2002
Volume 81,
Number 4,
28 February 2002
- Judit Büki, Csaba Szabó:
Complexity of homomorphisms to direct products of graphs.
175-178
Electronic Edition (link) BibTeX
- Oukseh Lee, Kwangkeun Yi, Yunheung Paek:
A proof method for the correctness of modularized 0CFA.
179-185
Electronic Edition (link) BibTeX
- Toru Araki, Yukio Shibata:
Pancyclicity of recursive circulant graphs.
187-190
Electronic Edition (link) BibTeX
- San Skulrattanakulchai:
4-edge-coloring graphs of maximum degree 3 in linear time.
191-195
Electronic Edition (link) BibTeX
- Charles U. Martel:
The expected complexity of Prim's minimum spanning tree algorithm.
197-201
Electronic Edition (link) BibTeX
- Fanica Gavril:
Algorithms for maximum weight induced paths.
203-208
Electronic Edition (link) BibTeX
- Soumen Maity, Bimal K. Roy, Amiya Nayak:
On enumeration of catastrophic fault patterns.
209-212
Electronic Edition (link) BibTeX
- Susanne Albers, Marek Karpinski:
Randomized splay trees: Theoretical and experimental results.
213-221
Electronic Edition (link) BibTeX
- Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel:
On the minimum size of visibility graphs.
223-230
Electronic Edition (link) BibTeX
Volume 81,
Number 5,
16 March 2002
- Zenji Kobayashi, Takeshi Sekiguchi:
On a characterization of the standard Gray code by using its edge type on a hypercube.
231-237
Electronic Edition (link) BibTeX
- Dong-Ho Lee, Hyoung-Joo Kim:
An efficient nearest neighbor search in high-dimensional data spaces.
239-246
Electronic Edition (link) BibTeX
- Refael Hassin, Shlomi Rubinstein:
A 7/8-approximation algorithm for metric Max TSP.
247-251
Electronic Edition (link) BibTeX
- Alexander Meduna, Dusan Kolar:
Homogeneous grammars with a reduced number of non-context-free productions.
253-257
Electronic Edition (link) BibTeX
- Mark de Berg, A. Frank van der Stappen:
On the fatness of Minkowski sums.
259-264
Electronic Edition (link) BibTeX
- Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa:
Simple algorithms for searching a polygon with flashlights.
265-270
Electronic Edition (link) BibTeX
- Hai Zhou, Narendra V. Shenoy, William Nicholls:
Efficient minimum spanning tree construction without Delaunay triangulation.
271-276
Electronic Edition (link) BibTeX
- Aleksander Vesel, Janez Zerovnik:
Improved lower bound on the Shannon capacity of C7.
277-282
Electronic Edition (link) BibTeX
- Nectarios Kitsios, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, John Tsaknakis, Bill Vassiliadis:
An optimal algorithm for reporting visible rectangles.
283-288
Electronic Edition (link) BibTeX
Volume 81,
Number 6,
31 March 2002
- A. Koubková, Václav Koubek:
Algorithms for transitive closure.
289-296
Electronic Edition (link) BibTeX
- Edwin Naroska, Uwe Schwiegelshohn:
On an on-line scheduling problem for parallel jobs.
297-304
Electronic Edition (link) BibTeX
- Rezaul Alam Chowdhury, M. Kaykobad, Irwin King:
An efficient decoding technique for Huffman codes.
305-308
Electronic Edition (link) BibTeX
- Eric Sopena:
There exist oriented planar graphs with oriented chromatic number at least sixteen.
309-312
Electronic Edition (link) BibTeX
- Ilyong Chung, Wankyu Choi, Youngchel Kim, Mike Lee:
The design of conference key distribution system employing a symmetric balanced incomplete block design.
313-318
Electronic Edition (link) BibTeX
- Andrew G. Hart, Servet Martínez:
Sequential iteration of the Erlang fixed-point equations.
319-325
Electronic Edition (link) BibTeX
- C. T. Ng, T. C. Edwin Cheng, Aleksander Bachman, Adam Janiak:
Three scheduling problems with deteriorating jobs to minimize the total completion time.
327-333
Electronic Edition (link) BibTeX
- Bruno Zanuttini, Jean-Jacques Hébrard:
A unified framework for structure identification.
335-339
Electronic Edition (link) BibTeX
- Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan:
All-pairs shortest-paths computation in the presence of negative cycles.
341-343
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:04:06 2009
by Michael Ley (ley@uni-trier.de)
