default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 5
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 - Kunihiko Sadakane:
Succinct data structures for flexible text retrieval systems. 12-22 - Aïda Ouangraoua, Pascal Ferraro, Laurent Tichit, Serge Dulucq:
Local similarity between quotiented ordered trees. 23-35 - 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 - David Peleg:
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems. 55-64 - Takashi Mihara:
Quantum protocols for untrusted computations. 65-72 - David J. Abraham, Robert W. Irving, David F. Manlove:
Two algorithms for the Student-Project Allocation problem. 73-90 - Gilad Liberman, Zeev Nutov:
On shredders and vertex connectivity augmentation. 91-101 - Marco Martens, Henk Meijer:
On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. 102-114 - Kaushik Srinivasan, Charles J. Colbourn:
Failed disk recovery in double erasure RAID arrays. 115-128 - Gruia Calinescu:
A note on data structures for maintaining bipartitions. 129-134 - Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein:
Parameterized matching with mismatches. 135-140 - Dimitris Fotakis:
A primal-dual algorithm for online non-uniform facility location. 141-148 - Shmuel T. Klein, B. Riva Shalom, Yair Kaufman:
Searching for a set of correlated patterns. 149-161 - Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
On-line load balancing made simple: Greedy strikes back. 162-175 - Gérard Maze:
Existence of a limiting distribution for the binary GCD algorithm. 176-186 - Anders Dessmark, Andrzej Pelc:
Broadcasting in geometric radio networks. 187-201
Volume 5, Number 2, June 2007
- Alberto Apostolico, Ricardo A. Baeza-Yates, Massimo Melucci:
2004 Symposium on String Processing and Information Retrieval. 203 - Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient one-dimensional real scaled matching. 205-211 - Rolf Backofen, Sven Siebert:
Fast detection of common sequence structure patterns in RNAs. 212-228 - Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas:
Algorithms for extracting motifs from biological weighted sequences. 229-242 - Inbok Lee, Costas S. Iliopoulos, Kunsoo Park:
Linear time algorithm for the longest common repeat problem. 243-249
- Sabine Cornelsen, Gabriele Di Stefano:
Track assignment. 250-261 - Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut problems in graphs with a budget constraint. 262-279 - Magnus Bordewich, Martin E. Dyer:
Path coupling without contraction. 280-292 - Raja Jothi, Balaji Raghavachari:
Approximating the k-traveling repairman problem with repairtimes. 293-303 - Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for finding distance-edge-colorings of graphs. 304-322 - Tomasz Tyrakowski, Zbigniew Palka:
On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm. 323-329 - Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur:
Character sets of strings. 330-340 - Ales Berkopec:
HyperQuick algorithm for discrete hypergeometric distribution. 341-347 - Gill Barequet, Micha Moffie:
On the complexity of Jensen's algorithm for counting fixed polyominoes. 348-355 - Milad Niqui:
Exact arithmetic on the Stern-Brocot tree. 356-379 - Dana Shapira, James A. Storer:
Edit distance with move operations. 380-392
Volume 5, Number 3, September 2007
- Violet R. Syrotiuk, Edgar Chávez:
Editorial. 393-394 - Jorge Urrutia:
Local solutions for global problems in wireless networks. 395-407 - K. Subramani:
A Zero-Space algorithm for Negative Cost Cycle Detection in networks. 408-421 - Bin Tang, Himanshu Gupta:
Cache placement in sensor networks under an update cost constraint. 422-435 - Jerzy Konorski:
A station strategy to deter backoff attacks in IEEE 802.11 LANs. 436-454 - Rui Huang, Gergely V. Záruba:
Location tracking in mobile ad hoc networks using particle filters. 455-470
- Daniel Perrucci, Juan Sabia:
Real roots of univariate polynomials and straight line programs. 471-478 - Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman codes in parallel. 479-490 - Dror Rawitz:
Admission control with advance reservations in simple networks. 491-500 - Luís M. S. Russo, Arlindo L. Oliveira:
Efficient generation of super condensed neighborhoods. 501-513 - Amihood Amir, Igor Nor:
Generalized function matching. 514-523 - 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 - Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav:
On the minimum load coloring problem. 533-545 - Ulrik Brandes:
Optimal leaf ordering of complete binary trees. 546-552 - Andrei V. Kelarev:
Algorithms for computing parameters of graph-based extensions of BCH codes. 553-563 - Vincent Berry, François Nicolas:
Maximum agreement and compatible supertrees. 564-591 - H. M. Okasha, U. Rösler:
Asymptotic distributions for Random Median Quicksort. 592-608 - 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 - Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger:
Steiner diagrams and k-star hubs. 622-634
Volume 5, Number 4, December 2007
- Kunsoo Park, Laurent Mouchard:
Combinatorial Pattern Matching. 635 - Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel:
A linear time algorithm for the inversion median problem in circular bacterial genomes. 637-646 - Abdullah N. Arslan:
Regular expression constrained sequence alignment. 647-661 - Moritz G. Maaß, Johannes Nowak:
Text indexing with errors. 662-681 - Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A simple fast hybrid pattern-matching algorithm. 682-695 - Hélène Touzet:
Comparing similar ordered trees in linear-time. 696-705 - Paul Horton, Wataru Fujibuchi:
An upper bound on the hardness of exact matrix based motif discovery. 706-713 - Sebastian Böcker, Hans-Michael Kaltenbach:
Mass spectra alignments and their significance. 714-728
- Reuven Bar-Yehuda, Jonathan Laserson:
Exploiting locality: approximating sorting buffers. 729-738 - Frantisek Franek, Jiandong Jiang, William F. Smyth:
Two-pattern strings II - frequency of occurrence and substring complexity. 739-748
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 2025-08-10 21:20 CEST 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:
