Volume 8,
Number 1,
March 2010
- Antoine Deza, Feng Xie:
On the generalized Berge sorting conjecture.
1-7
- Hadis Amini, Frédéric Meunier, Héloïse Michel, Atefeh Mohajeri:
Greedy colorings for the binary paintshop problem.
8-14
- Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Sigma-local graphs.
15-23
- Rohit Khandekar, Vinayaka Pandit:
Online and offline algorithms for the sorting buffers problem on the line metric.
24-35
- Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.
36-49
- Marko Samer, Stefan Szeider:
Algorithms for propositional model counting.
50-64
- Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. Huber, Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
65-75
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß:
Fixed-parameter tractability results for feedback set problems in tournaments.
76-86
- Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the metric deadline TSP.
87-100
Volume 8,
Number 2,
June 2010
Special papers:
Selected papers from the 3rd Algorithms and Complexity in Durham Workshop ACiD 2007
Regular papers
- Morris Michael, François Nicolas, Esko Ukkonen:
On the complexity of finding gapped motifs.
131-142
- John Augustine, Brian Putnam, Sasanka Roy:
Largest empty circle centered on a query line.
143-153
- Elisabeth Gassner:
The Steiner Forest Problem revisited.
154-163
- Yuval Lando, Zeev Nutov:
On minimum power connectivity problems.
164-173
- Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Optimal on-line colorings for minimizing the number of ADMs in optical networks.
174-188
- James B. Orlin, Kamesh Madduri, K. Subramani, M. Williamson:
A faster algorithm for the single source shortest path problem with few distinct positive lengths.
189-198
- Marco Bressan, Enoch Peserico:
Choose the damping, choose the ranking?
199-213
- Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation algorithms for shortest descending paths in terrains.
214-230
- Martin Lätsch, Rainer Schrader:
Distance-hereditary digraphs.
231-240
- Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic extended suffix arrays.
241-257
Volume 8,
Number 3,
September 2010
Volume 8,
Number 4,
December 2010
- Dekel Tsur:
Fast index for approximate string matching.
339-345
- Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear and ring networks.
346-355
- Leah Epstein, Meital Levy:
Dynamic multi-dimensional bin packing.
356-372
- Alexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
ISB-tree: A new indexing scheme with efficient expected behaviour.
373-387
- Daniel Binkele-Raible, Henning Fernau:
A new upper bound for Max-2-SAT: A graph-theoretic approach.
388-401
- Wing-Kai Hon, Manish Patil, Rahul Shah, Shih-Bin Wu:
Efficient index for retrieving top-k most frequent documents.
402-417
- Lucian Ilie, Gonzalo Navarro, Liviu Tinta:
The longest common extension problem revisited and applications to approximate string searching.
418-428
Last update Fri May 25 09:30:56 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
