# | Title | Journal | Year | Citations |
---|
1 | ViennaRNA Package 2.0 | Algorithms for Molecular Biology | 2011 | 3,719 |
2 | Geometric Algorithms and Combinatorial Optimization | Algorithms and Combinatorics | 1988 | 1,689 |
3 | A critical point for random graphs with a given degree sequence | Random Structures and Algorithms | 1995 | 1,678 |
4 | Evolutionary Algorithms for Solving Multi-Objective Problems | Genetic Algorithms and Evolutionary Computation | 2002 | 1,478 |
5 | An improved data stream summary: the count-min sketch and its applications | Journal of Algorithms | 2005 | 1,326 |
6 | REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems | Numerical Algorithms | 1994 | 1,281 |
7 | Graph minors. II. Algorithmic aspects of tree-width | Journal of Algorithms | 1986 | 1,183 |
8 | A Comparative Analysis of Selection Schemes Used in Genetic Algorithms | Foundations of Genetic Algorithms | 1991 | 1,054 |
9 | Computing Communities in Large Networks Using Random Walks | Journal of Graph Algorithms and Applications | 2006 | 1,010 |
10 | A multiprojection algorithm using Bregman projections in a product space | Numerical Algorithms | 1994 | 997 |
11 | Estimation of Distribution Algorithms | Genetic Algorithms and Evolutionary Computation | 2002 | 966 |
12 | Real-Coded Genetic Algorithms and Interval-Schemata | Foundations of Genetic Algorithms | 1993 | 885 |
13 | Cuckoo hashing | Journal of Algorithms | 2004 | 737 |
14 | Detailed Error Analysis for a Fractional Adams Method | Numerical Algorithms | 2004 | 724 |
15 | Numerical integration using sparse grids | Numerical Algorithms | 1998 | 720 |
16 | Stochastic Network Optimization with Application to Communication and Queueing Systems | Synthesis Lectures on Learning Networks and Algorithms | 2010 | 697 |
17 | Easy problems for tree-decomposable graphs | Journal of Algorithms | 1991 | 675 |
18 | A fast and simple randomized parallel algorithm for the maximal independent set problem | Journal of Algorithms | 1986 | 634 |
19 | Regularization Tools version 4.0 for Matlab 7.3 | Numerical Algorithms | 2007 | 602 |
20 | Geometric Algorithms and Combinatorial Optimization | Algorithms and Combinatorics | 1993 | 596 |
21 | An elementary proof of a theorem of Johnson and Lindenstrauss | Random Structures and Algorithms | 2003 | 569 |
22 | The degree sequence of a scale-free random graph process | Random Structures and Algorithms | 2001 | 546 |
23 | Replacing suffix trees with enhanced suffix arrays | Journal of Discrete Algorithms | 2004 | 544 |
24 | The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination | Foundations of Genetic Algorithms | 1991 | 539 |
25 | Geometry of Cuts and Metrics | Algorithms and Combinatorics | 1997 | 533 |
26 | Genetic Algorithms for Real Parameter Optimization | Foundations of Genetic Algorithms | 1991 | 530 |
27 | A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation | Journal of Algorithms | 1995 | 524 |
28 | An O(logn) parallel connectivity algorithm | Journal of Algorithms | 1982 | 476 |
29 | The Design of Innovation | Genetic Algorithms and Evolutionary Computation | 2002 | 469 |
30 | On choosing “optimal” shape parameters for RBF approximation | Numerical Algorithms | 2007 | 462 |
31 | Clustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms | Mathematical Modelling and Algorithms | 2006 | 443 |
32 | A Survey of Fast Exponentiation Methods | Journal of Algorithms | 1998 | 433 |
33 | The Byzantine generals strike again | Journal of Algorithms | 1982 | 430 |
34 | Tensor rank is NP-complete | Journal of Algorithms | 1990 | 430 |
35 | Algorithms for the Split Variational Inequality Problem | Numerical Algorithms | 2012 | 427 |
36 | The phase transition in inhomogeneous random graphs | Random Structures and Algorithms | 2007 | 419 |
37 | A Study of Reproduction in Generational and Steady-State Genetic Algorithms | Foundations of Genetic Algorithms | 1991 | 407 |
38 | Evolutionary Optimization in Dynamic Environments | Genetic Algorithms and Evolutionary Computation | 2002 | 402 |
39 | Vertex Cover: Further Observations and Further Improvements | Journal of Algorithms | 2001 | 401 |
40 | Simple Constructions of Almost k-wise Independent Random Variables | Random Structures and Algorithms | 1992 | 382 |
41 | Greedy Strikes Back: Improved Facility Location Algorithms | Journal of Algorithms | 1999 | 370 |
42 | Dynamic huffman coding | Journal of Algorithms | 1985 | 364 |
43 | Competitive paging algorithms | Journal of Algorithms | 1991 | 356 |
44 | A linear-time approximation algorithm for the weighted vertex cover problem | Journal of Algorithms | 1981 | 354 |
45 | Concentration | Algorithms and Combinatorics | 1998 | 348 |
46 | The theory and computation of evolutionary distances: Pattern recognition | Journal of Algorithms | 1980 | 347 |
47 | A “retraction” method for planning the motion of a disc | Journal of Algorithms | 1985 | 345 |
48 | Competitive algorithms for server problems | Journal of Algorithms | 1990 | 342 |
49 | Combinatorial Optimization | Algorithms and Combinatorics | 2012 | 341 |
50 | Jane: a new tool for the cophylogeny reconstruction problem | Algorithms for Molecular Biology | 2010 | 335 |
51 | Onk-connectivity for a geometric random graph | Random Structures and Algorithms | 1999 | 330 |
52 | Fast solution of toeplitz systems of equations and computation of Padé approximants | Journal of Algorithms | 1980 | 329 |
53 | On the Complexity of Dualization of Monotone Disjunctive Normal Forms | Journal of Algorithms | 1996 | 325 |
54 | An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm | Journal of Algorithms | 1997 | 323 |
55 | An efficient algorithm for the “stable roommates” problem | Journal of Algorithms | 1985 | 321 |
56 | Multiplierless multiple constant multiplication | ACM Transactions on Algorithms | 2007 | 321 |
57 | A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees | Journal of Algorithms | 1995 | 320 |
58 | Isomorph-Free Exhaustive Generation | Journal of Algorithms | 1998 | 316 |
59 | Efficient and Accurate Parallel Genetic Algorithms | Genetic Algorithms and Evolutionary Computation | 2001 | 310 |
60 | Finding approximate patterns in strings | Journal of Algorithms | 1985 | 309 |
61 | Algorithms in Real Algebraic Geometry | Algorithms and Computation in Mathematics | 2003 | 308 |
62 | Numerical differentiation with annihilators in noisy environment | Numerical Algorithms | 2009 | 298 |
63 | Survey propagation: An algorithm for satisfiability | Random Structures and Algorithms | 2005 | 294 |
64 | Finding the convex hull of a simple polygon | Journal of Algorithms | 1983 | 292 |
65 | An O(n log n) algorithm for finding all repetitions in a string | Journal of Algorithms | 1984 | 292 |
66 | Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets | ACM Transactions on Algorithms | 2007 | 292 |
67 | Responsible Artificial Intelligence | The Artificial Intelligence: Foundationsory, and Algorithms | 2019 | 292 |
68 | Algorithms for maximum independent sets | Journal of Algorithms | 1986 | 290 |
69 | An Incremental Algorithm for a Generalization of the Shortest-Path Problem | Journal of Algorithms | 1996 | 289 |
70 | Random walks in a convex body and an improved volume algorithm | Random Structures and Algorithms | 1993 | 281 |
71 | Decomposable searching problems I. Static-to-dynamic transformation | Journal of Algorithms | 1980 | 273 |
72 | Skip graphs | ACM Transactions on Algorithms | 2007 | 273 |
73 | Approximation Algorithms for Directed Steiner Problems | Journal of Algorithms | 1999 | 272 |
74 | Compressed representations of sequences and full-text indexes | ACM Transactions on Algorithms | 2007 | 271 |
75 | Affine Arithmetic: Concepts and Applications | Numerical Algorithms | 2004 | 269 |
76 | The birth of the giant component | Random Structures and Algorithms | 1993 | 267 |
77 | Space-efficient and exact de Bruijn graph representation based on a Bloom filter | Algorithms for Molecular Biology | 2013 | 266 |
78 | Fast parallel and serial approximate string matching | Journal of Algorithms | 1989 | 264 |
79 | NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs | Journal of Algorithms | 1998 | 246 |
80 | Triangulations | Algorithms and Computation in Mathematics | 2010 | 246 |
81 | Finding the maximum, merging, and sorting in a parallel computation model | Journal of Algorithms | 1981 | 244 |
82 | Parameterizing above Guaranteed Values: MaxSat and MaxCut | Journal of Algorithms | 1999 | 243 |
83 | Monte-Carlo approximation algorithms for enumeration problems | Journal of Algorithms | 1989 | 242 |
84 | The NP-completeness column: an ongoing guide | Journal of Algorithms | 1985 | 240 |
85 | Algorithms for graph partitioning on the planted partition model | Random Structures and Algorithms | 2001 | 240 |
86 | Partition function and base pairing probabilities of RNA heterodimers | Algorithms for Molecular Biology | 2006 | 239 |
87 | The Ramsey number R(3, t) has order of magnitude t2/log t | Random Structures and Algorithms | 1995 | 238 |
88 | A general model of web graphs | Random Structures and Algorithms | 2003 | 238 |
89 | Δ-stepping: a parallelizable shortest path algorithm | Journal of Algorithms | 2003 | 236 |
90 | Geometric Discrepancy | Algorithms and Combinatorics | 1999 | 223 |
91 | Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs | Journal of Algorithms | 1996 | 222 |
92 | Combinatorial Algebraic Topology | Algorithms and Computation in Mathematics | 2008 | 222 |
93 | Recovery in distributed systems using optimistic message logging and checkpointing | Journal of Algorithms | 1990 | 220 |
94 | A very simple algorithm for estimating the number of k-colorings of a low-degree graph | Random Structures and Algorithms | 1995 | 219 |
95 | Algorithmic construction of sets for k -restrictions | ACM Transactions on Algorithms | 2006 | 218 |
96 | Subgraph Isomorphism in Planar Graphs and Related Problems | Journal of Graph Algorithms and Applications | 1999 | 216 |
97 | Fast randomized consensus using shared memory | Journal of Algorithms | 1990 | 213 |
98 | An Ant Colony Optimization Algorithm for Shop Scheduling Problems | Mathematical Modelling and Algorithms | 2004 | 213 |
99 | Stochastic Approaches to Uncertainty Quantification in CFD Simulations | Numerical Algorithms | 2005 | 209 |
100 | Monotonicity in graph searching | Journal of Algorithms | 1991 | 208 |