Volume 109,
Number 1,
December 2008
- Jong-Won Roh, Byoung-Kee Yi:
Efficient indexing of interval time sequences.
1-12
Electronic Edition (link) BibTeX
- Olivier Gauwin, Joachim Niehren, Yves Roos:
Streaming tree automata.
13-17
Electronic Edition (link) BibTeX
- Youngjoong Ko, Hongkuk An, Jungyun Seo:
Pseudo-relevance feedback and statistical query expansion for web snippet generation.
18-22
Electronic Edition (link) BibTeX
- Judith Nagy-György, Csanád Imreh:
Online hypergraph coloring.
23-26
Electronic Edition (link) BibTeX
- Sumit Ganguly, Anirban Majumder:
Deterministic K-set structure.
27-31
Electronic Edition (link) BibTeX
- Leah Epstein, Asaf Levin:
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
32-37
Electronic Edition (link) BibTeX
- Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger:
The Magnus-Derek game revisited.
38-40
Electronic Edition (link) BibTeX
- Beate Bollig:
A note on the size of OBDDs for the graph of integer multiplication.
41-43
Electronic Edition (link) BibTeX
- Shakhar Smorodinsky:
A note on the online First-Fit algorithm for coloring k.
44-45
Electronic Edition (link) BibTeX
- J. Andrés Montoya:
The parameterized complexity of probability amplification.
46-53
Electronic Edition (link) BibTeX
- Martin Held, Joseph S. B. Mitchell:
Triangulating input-constrained planar point sets.
54-56
Electronic Edition (link) BibTeX
- Tetsuo Asano:
Online uniformity of integer points on a line.
57-60
Electronic Edition (link) BibTeX
- Selim G. Akl, Kamrul Islam, Henk Meijer:
Planar tree transformation: Results and counterexample.
61-67
Electronic Edition (link) BibTeX
- Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond:
Parameterized approximation of dominating set problems.
68-70
Electronic Edition (link) BibTeX
- Rafael Dueire Lins:
Cyclic reference counting.
71-78
Electronic Edition (link) BibTeX
- Mikhail J. Atallah, Greg N. Frederickson, Ashish Kundu:
A tree-covering problem arising in integrity of tree-structured data.
79-82
Electronic Edition (link) BibTeX
- Luca Aceto, Anna Ingólfsdóttir:
On the expressibility of priority.
83-85
Electronic Edition (link) BibTeX
Volume 109,
Number 2,
December 2008
- Mark de Berg, Shripad Thite:
Cache-oblivious selection in sorted X.
87-92
Electronic Edition (link) BibTeX
- J. Mark Keil, Tzvetalin S. Vassilev:
The relative neighbourhood graph is a part of every 30degree-triangulation.
93-97
Electronic Edition (link) BibTeX
- Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
Anonymous graph exploration without collision by mobile robots.
98-103
Electronic Edition (link) BibTeX
- Taolue Chen, Wan Fokkink, Rob J. van Glabbeek:
Ready to preorder: The case of weak process semantics.
104-111
Electronic Edition (link) BibTeX
- Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang:
Finding cycles in hierarchical hypercube networks.
112-115
Electronic Edition (link) BibTeX
- Hwei-Jen Lin, Hung-Hsuan Wu:
Efficient geometric measure of music similarity.
116-120
Electronic Edition (link) BibTeX
- Palash Sarkar:
A general mixing strategy for the ECB-Mix-ECB mode of operation.
121-123
Electronic Edition (link) BibTeX
- Clemens Huemer, Ferran Hurtado, Julian Pfeifle:
The rotation graph of k.
124-129
Electronic Edition (link) BibTeX
- Rui Li, Jixiang Meng:
Reversals Cayley graphs of symmetric groups.
130-132
Electronic Edition (link) BibTeX
- Aravind Srinivasan:
A note on the distribution of the number of prime factors of the integers.
133-135
Electronic Edition (link) BibTeX
- Emanuele G. Fusco, Andrzej Pelc:
Acknowledged broadcasting in ad hoc radio networks.
136-141
Electronic Edition (link) BibTeX
- Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Ortega:
Dynamic polar diagram.
142-146
Electronic Edition (link) BibTeX
- Chia-Jui Lai, Chang-Hsiung Tsai:
On embedding cycles into faulty dual-cubes.
147-150
Electronic Edition (link) BibTeX
- Vicent Cholvi:
Stability bounds in networks with dynamic link capacities.
151-154
Electronic Edition (link) BibTeX
- Johann Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks.
155-160
Electronic Edition (link) BibTeX
- Hsin-Hao Su, Chin Lung Lu, Chuan Yi Tang:
An improved algorithm for finding a length-constrained maximum-density subtree in a tree.
161-164
Electronic Edition (link) BibTeX
- Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu:
Improved approximation of the largest common subtree of two unordered trees of bounded height.
165-170
Electronic Edition (link) BibTeX
Volume 109,
Number 3,
January 2009
- Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao:
Optimal algorithms for the average-constrained maximum-sum segment problem.
171-174
Electronic Edition (link) BibTeX
- Valentin Ziegler:
Approximating optimum branchings in linear time.
175-178
Electronic Edition (link) BibTeX
- Edo Liberty, Steven W. Zucker:
The Mailman algorithm: A note on matrix-vector multiplication.
179-182
Electronic Edition (link) BibTeX
- Mira Gonen, Yuval Shavitt:
A Theta(logn.
183-186
Electronic Edition (link) BibTeX
- Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi:
Deterministically testing sparse polynomial identities of unbounded degree.
187-192
Electronic Edition (link) BibTeX
- Sarah Novotny, Juan Ortiz, Darren A. Narayan:
Minimal k.
193-198
Electronic Edition (link) BibTeX
- Jing Huang, Haina Sun, Weifan Wang, Dong Chen:
(2, 1)-Total labelling of trees with sparse vertices of maximum degree.
199-203
Electronic Edition (link) BibTeX
- Xin Han, He Guo, Dawei Yin, Yong Zhang:
A note on on-line broadcast scheduling with deadlines.
204-207
Electronic Edition (link) BibTeX
- Sanjay Jain:
On some open problems in reflective inductive inference.
208-211
Electronic Edition (link) BibTeX
Volume 109,
Number 4,
January 2009
- Víctor Dalmau:
There are no pure relational width 2 constraint satisfaction problems.
213-218
Electronic Edition (link) BibTeX
- Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk:
Geometric stable roommates.
219-224
Electronic Edition (link) BibTeX
- Holger Petersen, Szymon Grabowski:
Range mode and range median queries in constant time and sub-quadratic space.
225-228
Electronic Edition (link) BibTeX
- Pascal Schweitzer:
Using the incompressibility method to obtain local lemma results for Ramsey-type problems.
229-232
Electronic Edition (link) BibTeX
- Krzysztof Majewski, Nicholas Pippenger:
Attribute estimation and testing quasi-symmetry.
233-237
Electronic Edition (link) BibTeX
- Mukul S. Bansal, David Fernández-Baca:
Computing distances between partial rankings.
238-241
Electronic Edition (link) BibTeX
- Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication.
242-247
Electronic Edition (link) BibTeX
- Hongbo Hua, Yaoping Hou:
On graphs with the third largest number of maximal independent sets.
248-253
Electronic Edition (link) BibTeX
- Virginia Vassilevska:
Efficient algorithms for clique problems.
254-257
Electronic Edition (link) BibTeX
Volume 109,
Number 5,
February 2009
Copyright © Sun May 17 00:04:10 2009
by Michael Ley (ley@uni-trier.de)
