0.0(top 100%)
impact factor
1.3K(top 20%)
papers
13.5K(top 20%)
citations
51(top 10%)
h-index
0.0(top 100%)
extended IF
1.4K
all documents
14.6K
doc citations
78(top 10%)
g-index
Top Articles
# | Title | Journal | Year | Citations |
---|---|---|---|---|
1 | Local search strategies for satisfiability testing | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 218 |
2 | A classification of consensus methods for phylogenetics | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2003 | 173 |
3 | Algorithms for the satisfiability (SAT) problem: A survey | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 166 |
4 | Computing on data streams | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1999 | 160 |
5 | A greedy randomized adaptive search procedure for the quadratic assignment problem | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1994 | 159 |
6 | The quadratic assignment problem: A survey and recent developments | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1994 | 157 |
7 | Minimizing polynomial functions | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2003 | 147 |
8 | On the computational power of DNA annealing and ligation | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 126 |
9 | Universal computation via self-assembly of DNA: Some theory and experiments | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1998 | 122 |
10 | Genetic hybrids for the quadratic assignment problem | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1994 | 120 |
11 | On maximum clique problems in very large graphs | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1999 | 116 |
12 | A survey on combinatorial group testing algorithms with applications to DNA Library Screening | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2000 | 115 |
13 | On constructing a molecular computer | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 110 |
14 | A theoretician’s guide to the experimental analysis of algorithms | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2002 | 108 |
15 | Why is modal logic so robustly decidable? | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 106 |
16 | Breaking DES using a molecular computer | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 101 |
17 | The median procedure for partitions | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1995 | 99 |
18 | New directions in testing | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1991 | 96 |
19 | A DNA and restriction enzyme implementation of Turing machines | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 96 |
20 | Improved linear programming-based lower bounds for the quadratic assignment problem | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1994 | 94 |
21 | Good encodings for DNA-based solutions to combinatorial problems | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1998 | 93 |
22 | Synopsis data structures for massive data sets | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1999 | 87 |
23 | Parameterized complexity: A framework for systematically confronting computational intractability | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1999 | 84 |
24 | A survey of out-of-core algorithms in numerical linear algebra | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1999 | 84 |
25 | DNA-based cryptography | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2000 | 84 |
26 | Graph searching, path-width, tree-width and related problems (A survey) | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1991 | 83 |
27 | On nested depth first search | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 82 |
28 | Finding hard instances of the satisfiability problem: A survey | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 82 |
29 | On algorithms for simple stochastic games | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1993 | 79 |
30 | Permutation groups and polynomial-time computation | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1993 | 78 |
31 | Model checking and the mu-calculus | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 78 |
32 | Stretchability of pseudolines is NP-hard | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1991 | 75 |
33 | Exploring the k-colorable landscape with iterated greedy | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 75 |
34 | Graph entropy: A survey | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1995 | 72 |
35 | Maximum cuts and large bipartite subgraphs | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1995 | 70 |
36 | Distributed coloration neighborhood search | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 68 |
37 | Concerning the NJ algorithm and its unweighted version, UNJ | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 67 |
38 | Combinatorial property testing (a survey) | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1998 | 67 |
39 | Generalized FFTs–A survey of some recent results | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 66 |
40 | Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 65 |
41 | Survey: Information flow on trees | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2004 | 60 |
42 | SAT versus UNSAT | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 59 |
43 | Approximate solution of weighted MAX-SAT problems using GRASP | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 59 |
44 | Fast point-to-point shortest path computations with arc-flags | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2009 | 58 |
45 | A continuous based heuristic for the maximum clique problem | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1996 | 56 |
46 | Reconciled trees and incongruent gene and species trees | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1997 | 56 |
47 | Depth functions in nonparametric multivariate inference | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 2006 | 56 |
48 | Groups and expanders | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1993 | 55 |
49 | The server problem and on-line games | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1992 | 52 |
50 | GRAPE: a system for computing with graphs and groups | DIMACS Series in Discrete Mathematics and Theoretical Computer Science | 1993 | 51 |