Volume 5,
Number 1,
March 2007
- Leszek Gasieniec, Chang Su, Prudence W. H. Wong, Qin Xin:
Routing of single-source and multiple-source queries in static sensor networks.
1-11
Electronic Edition (link) BibTeX
- Kunihiko Sadakane:
Succinct data structures for flexible text retrieval systems.
12-22
Electronic Edition (link) BibTeX
- Aïda Ouangraoua, Pascal Ferraro, Laurent Tichit, Serge Dulucq:
Local similarity between quotiented ordered trees.
23-35
Electronic Edition (link) BibTeX
- Cédric Bentz, Marie-Christine Costa, Frédéric Roupin:
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.
36-54
Electronic Edition (link) BibTeX
- David Peleg:
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems.
55-64
Electronic Edition (link) BibTeX
- Takashi Mihara:
Quantum protocols for untrusted computations.
65-72
Electronic Edition (link) BibTeX
- David J. Abraham, Robert W. Irving, David Manlove:
Two algorithms for the Student-Project Allocation problem.
73-90
Electronic Edition (link) BibTeX
- Gilad Liberman, Zeev Nutov:
On shredders and vertex connectivity augmentation.
91-101
Electronic Edition (link) BibTeX
- Marco Martens, Henk Meijer:
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours.
102-114
Electronic Edition (link) BibTeX
- Kaushik Srinivasan, Charles J. Colbourn:
Failed disk recovery in double erasure RAID arrays.
115-128
Electronic Edition (link) BibTeX
- Gruia Calinescu:
A note on data structures for maintaining bipartitions.
129-134
Electronic Edition (link) BibTeX
- Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein:
Parameterized matching with mismatches.
135-140
Electronic Edition (link) BibTeX
- Dimitris Fotakis:
A primal-dual algorithm for online non-uniform facility location.
141-148
Electronic Edition (link) BibTeX
- Shmuel T. Klein, B. Riva Shalom, Yair Kaufman:
Searching for a set of correlated patterns.
149-161
Electronic Edition (link) BibTeX
- Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
On-line load balancing made simple: Greedy strikes back.
162-175
Electronic Edition (link) BibTeX
- Gérard Maze:
Existence of a limiting distribution for the binary GCD algorithm.
176-186
Electronic Edition (link) BibTeX
- Anders Dessmark, Andrzej Pelc:
Broadcasting in geometric radio networks.
187-201
Electronic Edition (link) BibTeX
Volume 5,
Number 2,
June 2007
2004 Symposium on String Processing and Information Retrieval
- Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci:
2004 Symposium on String Processing and Information Retrieval.
203
Electronic Edition (link) BibTeX
- Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient one-dimensional real scaled matching.
205-211
Electronic Edition (link) BibTeX
- Rolf Backofen, Sven Siebert:
Fast detection of common sequence structure patterns in RNAs.
212-228
Electronic Edition (link) BibTeX
- Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas:
Algorithms for extracting motifs from biological weighted sequences.
229-242
Electronic Edition (link) BibTeX
- Inbok Lee, Costas S. Iliopoulos, Kunsoo Park:
Linear time algorithm for the longest common repeat problem.
243-249
Electronic Edition (link) BibTeX
Regular papers
- Sabine Cornelsen, Gabriele Di Stefano:
Track assignment.
250-261
Electronic Edition (link) BibTeX
- Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut problems in graphs with a budget constraint.
262-279
Electronic Edition (link) BibTeX
- Magnus Bordewich, Martin E. Dyer:
Path coupling without contraction.
280-292
Electronic Edition (link) BibTeX
- Raja Jothi, Balaji Raghavachari:
Approximating the k-traveling repairman problem with repairtimes.
293-303
Electronic Edition (link) BibTeX
- Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for finding distance-edge-colorings of graphs.
304-322
Electronic Edition (link) BibTeX
- Tomasz Tyrakowski, Zbigniew Palka:
On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm.
323-329
Electronic Edition (link) BibTeX
- Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur:
Character sets of strings.
330-340
Electronic Edition (link) BibTeX
- Ales Berkopec:
HyperQuick algorithm for discrete hypergeometric distribution.
341-347
Electronic Edition (link) BibTeX
- Gill Barequet, Micha Moffie:
On the complexity of Jensen's algorithm for counting fixed polyominoes.
348-355
Electronic Edition (link) BibTeX
- Milad Niqui:
Exact arithmetic on the Stern-Brocot tree.
356-379
Electronic Edition (link) BibTeX
- Dana Shapira, James A. Storer:
Edit distance with move operations.
380-392
Electronic Edition (link) BibTeX
Volume 5,
Number 3,
September 2007
Selected papers from Ad Hoc Now 2005
Regular papers
- Daniel Perrucci, Juan Sabia:
Real roots of univariate polynomials and straight line programs.
471-478
Electronic Edition (link) BibTeX
- Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman codes in parallel.
479-490
Electronic Edition (link) BibTeX
- Dror Rawitz:
Admission control with advance reservations in simple networks.
491-500
Electronic Edition (link) BibTeX
- Luís M. S. Russo, Arlindo L. Oliveira:
Efficient generation of super condensed neighborhoods.
501-513
Electronic Edition (link) BibTeX
- Amihood Amir, Igor Nor:
Generalized function matching.
514-523
Electronic Edition (link) BibTeX
- Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami:
Computing the maximum clique in the visibility graph of a simple polygon.
524-532
Electronic Edition (link) BibTeX
- Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav:
On the minimum load coloring problem.
533-545
Electronic Edition (link) BibTeX
- Ulrik Brandes:
Optimal leaf ordering of complete binary trees.
546-552
Electronic Edition (link) BibTeX
- A. V. Kelarev:
Algorithms for computing parameters of graph-based extensions of BCH codes.
553-563
Electronic Edition (link) BibTeX
- Vincent Berry, François Nicolas:
Maximum agreement and compatible supertrees.
564-591
Electronic Edition (link) BibTeX
- H. M. Okasha, U. Rösler:
Asymptotic distributions for Random Median Quicksort.
592-608
Electronic Edition (link) BibTeX
- Jinjiang Yuan, Jian Ying Zhang, Sanming Zhou:
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.
609-621
Electronic Edition (link) BibTeX
- Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger:
Steiner diagrams and k-star hubs.
622-634
Electronic Edition (link) BibTeX
Volume 5,
Number 4,
December 2007
Selected papers from Combinatorial Pattern Matching 2005
Regular papers
Copyright © Sun May 17 00:09:05 2009
by Michael Ley (ley@uni-trier.de)
