About
Technology
Issues
FAQ
Search
Scientometrics
Impact Factor
Discipline Ranks
h
-index
g
-index
Articles
Citations
Article Citations
Citation Distribution
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Journals
›
Journal of Discrete Algorithms
›
top-articles
Journal of Discrete Algorithms
0.7
(top 50%)
impact factor
671
(top 20%)
papers
8.3K
(top 20%)
citations
39
(top 20%)
h
-index
0.7
(top 50%)
impact factor
797
all documents
8.7K
doc citations
62
(top 20%)
g
-index
Top Articles
#
Title
Journal
Year
Citations
1
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms
2004
544
2
Space efficient linear time construction of suffix arrays
Journal of Discrete Algorithms
2005
145
3
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
2007
134
4
An efficient fixed-parameter algorithm for 3-Hitting Set
Journal of Discrete Algorithms
2003
122
5
Two algorithms for the Student-Project Allocation problem
Journal of Discrete Algorithms
2007
96
6
Wavelet trees for all
Journal of Discrete Algorithms
2014
92
7
On minimum metric dimension of honeycomb networks
Journal of Discrete Algorithms
2008
88
8
Indexing text using the Ziv–Lempel trie
Journal of Discrete Algorithms
2004
82
9
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
2006
82
10
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
2008
82
11
Constructing suffix arrays in linear time
Journal of Discrete Algorithms
2005
80
12
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms
2009
72
13
On the approximability of the maximum induced matching problem
Journal of Discrete Algorithms
2005
71
14
Algorithms for propositional model counting
Journal of Discrete Algorithms
2010
69
15
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
2010
69
16
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal of Discrete Algorithms
2006
67
17
Approximate similarity search: A multi-faceted problem
Journal of Discrete Algorithms
2009
66
18
Approximation complexity of Metric Dimension problem
Journal of Discrete Algorithms
2012
65
19
A fully linear-time approximation algorithm for grammar-based compression
Journal of Discrete Algorithms
2005
64
20
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
2009
63
21
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms
2010
62
22
Petri net modelling of biological regulatory networks
Journal of Discrete Algorithms
2008
61
23
Running time analysis of Ant Colony Optimization for shortest path problems
Journal of Discrete Algorithms
2012
60
24
An efficient representation of Benes networks and its applications
Journal of Discrete Algorithms
2008
59
25
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms
2003
55
26
The longest common subsequence problem for arc-annotated sequences
Journal of Discrete Algorithms
2004
53
27
Chaining algorithms for multiple genome comparison
Journal of Discrete Algorithms
2005
52
28
On the analysis of a dynamic evolutionary algorithm
Journal of Discrete Algorithms
2006
52
29
Computing the longest common prefix array based on the Burrows–Wheeler transform
Journal of Discrete Algorithms
2013
50
30
Online weighted flow time and deadline scheduling
Journal of Discrete Algorithms
2006
49
31
String matching in O(n+m) quantum time
Journal of Discrete Algorithms
2003
48
32
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
2007
48
33
Stable marriage with ties and bounded length preference lists
Journal of Discrete Algorithms
2009
48
34
Multiscale approach for the network compression-friendly ordering
Journal of Discrete Algorithms
2011
47
35
Sparse RNA folding: Time and space efficient algorithms
Journal of Discrete Algorithms
2011
45
36
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
2007
43
37
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms
2008
43
38
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms
2003
42
39
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems
Journal of Discrete Algorithms
2007
42
40
Student-Project Allocation with preferences over Projects
Journal of Discrete Algorithms
2008
42
41
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms
2003
39
42
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Journal of Discrete Algorithms
2010
38
43
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms
2009
37
44
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
2007
36
45
Parameterized matching with mismatches
Journal of Discrete Algorithms
2007
36
46
A golden ratio parameterized algorithm for Cluster Editing
Journal of Discrete Algorithms
2012
36
47
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions
Journal of Discrete Algorithms
2005
35
48
Improved random graph isomorphism
Journal of Discrete Algorithms
2008
35
49
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Journal of Discrete Algorithms
2012
35
50
Improved compressed indexes for full-text document retrieval
Journal of Discrete Algorithms
2013
35
site/software ©
exaly
; All materials licenced under
CC by-SA
.