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

#TitleJournalYearCitations
1Replacing suffix trees with enhanced suffix arraysJournal of Discrete Algorithms2004544
2Space efficient linear time construction of suffix arraysJournal of Discrete Algorithms2005145
3Succinct data structures for flexible text retrieval systemsJournal of Discrete Algorithms2007134
4An efficient fixed-parameter algorithm for 3-Hitting SetJournal of Discrete Algorithms2003122
5Two algorithms for the Student-Project Allocation problemJournal of Discrete Algorithms200796
6Wavelet trees for allJournal of Discrete Algorithms201492
7On minimum metric dimension of honeycomb networksJournal of Discrete Algorithms200888
8Indexing text using the Ziv–Lempel trieJournal of Discrete Algorithms200482
9A note on the complexity of minimum dominating setJournal of Discrete Algorithms200682
10A polynomial algorithm to find an independent set of maximum weight in a fork-free graphJournal of Discrete Algorithms200882
11Constructing suffix arrays in linear timeJournal of Discrete Algorithms200580
12A generalization of Dijkstra's shortest path algorithm with applications to VLSI routingJournal of Discrete Algorithms200972
13On the approximability of the maximum induced matching problemJournal of Discrete Algorithms200571
14Algorithms for propositional model countingJournal of Discrete Algorithms201069
15Fixed-parameter tractability results for feedback set problems in tournamentsJournal of Discrete Algorithms201069
16Online competitive algorithms for maximizing weighted throughput of unit jobsJournal of Discrete Algorithms200667
17Approximate similarity search: A multi-faceted problemJournal of Discrete Algorithms200966
18Approximation complexity of Metric Dimension problemJournal of Discrete Algorithms201265
19A fully linear-time approximation algorithm for grammar-based compressionJournal of Discrete Algorithms200564
20Parameterized complexity of finding regular induced subgraphsJournal of Discrete Algorithms200963
21A faster algorithm for the single source shortest path problem with few distinct positive lengthsJournal of Discrete Algorithms201062
22Petri net modelling of biological regulatory networksJournal of Discrete Algorithms200861
23Running time analysis of Ant Colony Optimization for shortest path problemsJournal of Discrete Algorithms201260
24An efficient representation of Benes networks and its applicationsJournal of Discrete Algorithms200859
25On time versus size for monotone dynamic monopolies in regular topologiesJournal of Discrete Algorithms200355
26The longest common subsequence problem for arc-annotated sequencesJournal of Discrete Algorithms200453
27Chaining algorithms for multiple genome comparisonJournal of Discrete Algorithms200552
28On the analysis of a dynamic evolutionary algorithmJournal of Discrete Algorithms200652
29Computing the longest common prefix array based on the Burrows–Wheeler transformJournal of Discrete Algorithms201350
30Online weighted flow time and deadline schedulingJournal of Discrete Algorithms200649
31String matching in O(n+m) quantum timeJournal of Discrete Algorithms200348
32Broadcasting in geometric radio networksJournal of Discrete Algorithms200748
33Stable marriage with ties and bounded length preference listsJournal of Discrete Algorithms200948
34Multiscale approach for the network compression-friendly orderingJournal of Discrete Algorithms201147
35Sparse RNA folding: Time and space efficient algorithmsJournal of Discrete Algorithms201145
36A simple fast hybrid pattern-matching algorithmJournal of Discrete Algorithms200743
37An approximation algorithm for sorting by reversals and transpositionsJournal of Discrete Algorithms200843
38Efficient text fingerprinting via Parikh mappingJournal of Discrete Algorithms200342
39Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problemsJournal of Discrete Algorithms200742
40Student-Project Allocation with preferences over ProjectsJournal of Discrete Algorithms200842
41The consensus string problem for a metric is NP-completeJournal of Discrete Algorithms200339
42Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphsJournal of Discrete Algorithms201038
43Vertex and edge covers with clustering properties: Complexity and algorithmsJournal of Discrete Algorithms200937
44A primal-dual algorithm for online non-uniform facility locationJournal of Discrete Algorithms200736
45Parameterized matching with mismatchesJournal of Discrete Algorithms200736
46A golden ratio parameterized algorithm for Cluster EditingJournal of Discrete Algorithms201236
47On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functionsJournal of Discrete Algorithms200535
48Improved random graph isomorphismJournal of Discrete Algorithms200835
49Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graphJournal of Discrete Algorithms201235
50Improved compressed indexes for full-text document retrievalJournal of Discrete Algorithms201335