The SCEAS System
Navigation Menu

Journals in DBLP

J. Discrete Algorithms
2007, volume: 5, number: 1

  1. Leszek Gasieniec, Chang Su, Prudence W. H. Wong, Qin Xin
    Routing of single-source and multiple-source queries in static sensor networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:1-11 [Journal]
  2. Kunihiko Sadakane
    Succinct data structures for flexible text retrieval systems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:12-22 [Journal]
  3. Aïda Ouangraoua, Pascal Ferraro, Laurent Tichit, Serge Dulucq
    Local similarity between quotiented ordered trees. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:23-35 [Journal]
  4. Cédric Bentz, Marie-Christine Costa, Frédéric Roupin
    Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:36-54 [Journal]
  5. David Peleg
    Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:55-64 [Journal]
  6. Takashi Mihara
    Quantum protocols for untrusted computations. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:65-72 [Journal]
  7. David J. Abraham, Robert W. Irving, David Manlove
    Two algorithms for the Student-Project Allocation problem. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:73-90 [Journal]
  8. Gilad Liberman, Zeev Nutov
    On shredders and vertex connectivity augmentation. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:91-101 [Journal]
  9. Marco Martens, Henk Meijer
    On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:102-114 [Journal]
  10. Kaushik Srinivasan, Charles J. Colbourn
    Failed disk recovery in double erasure RAID arrays. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:115-128 [Journal]
  11. Gruia Calinescu
    A note on data structures for maintaining bipartitions. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:129-134 [Journal]
  12. Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein
    Parameterized matching with mismatches. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:135-140 [Journal]
  13. Dimitris Fotakis
    A primal-dual algorithm for online non-uniform facility location. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:141-148 [Journal]
  14. Shmuel T. Klein, B. Riva Shalom, Yair Kaufman
    Searching for a set of correlated patterns. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:149-161 [Journal]
  15. Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
    On-line load balancing made simple: Greedy strikes back. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:162-175 [Journal]
  16. Gérard Maze
    Existence of a limiting distribution for the binary GCD algorithm. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:176-186 [Journal]
  17. Anders Dessmark, Andrzej Pelc
    Broadcasting in geometric radio networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:187-201 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002