default search action
Journal of Discrete Algorithms, Volume 8
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
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
Fixed-parameter tractability results for feedback set problems in tournaments. 76-86 - Hans-Joachim Böckenhauer
Reoptimization of the metric deadline TSP. 87-100
Volume 8, Number 2, June 2010
- Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Editorial. 101 - Colin T. S. Sng, David F. Manlove
Popular matchings in the weighted capacitated house allocation problem. 102-116 - Costas S. Iliopoulos, M. Sohel Rahman
Finite automata based algorithms on subsequences and supersequences of degenerate strings. 117-130
- 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
Optimal on-line colorings for minimizing the number of ADMs in optical networks. 174-188 - James B. Orlin
A faster algorithm for the single source shortest path problem with few distinct positive lengths. 189-198 - Marco Bressan
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
Dynamic extended suffix arrays. 241-257
Volume 8, Number 3, September 2010
- Fabian Gieseke, Joachim Gudmundsson
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. 259-272 - Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. 273-281 - Seok-Hee Hong, Hiroshi Nagamochi:
Convex drawings of hierarchical planar graphs and clustered planar graphs. 282-295 - Nicolas Boria, Vangelis Th. Paschos:
Fast reoptimization for the minimum spanning tree problem. 296-310 - Ehab Morsy, Hiroshi Nagamochi:
On the approximation of the generalized capacitated tree-routing problem. 311-320 - Hajo Broersma
Computing sharp 2-factors in claw-free graphs. 321-329 - Ignasi Sau
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. 330-338
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
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
Efficient index for retrieving top-k most frequent documents. 402-417 - Lucian Ilie
The longest common extension problem revisited and applications to approximate string searching. 418-428
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: