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

#TitleJournalYearCitations
1Local search strategies for satisfiability testingDIMACS Series in Discrete Mathematics and Theoretical Computer Science1996218
2A classification of consensus methods for phylogeneticsDIMACS Series in Discrete Mathematics and Theoretical Computer Science2003173
3Algorithms for the satisfiability (SAT) problem: A surveyDIMACS Series in Discrete Mathematics and Theoretical Computer Science1997166
4Computing on data streamsDIMACS Series in Discrete Mathematics and Theoretical Computer Science1999160
5A greedy randomized adaptive search procedure for the quadratic assignment problemDIMACS Series in Discrete Mathematics and Theoretical Computer Science1994159
6The quadratic assignment problem: A survey and recent developmentsDIMACS Series in Discrete Mathematics and Theoretical Computer Science1994157
7Minimizing polynomial functionsDIMACS Series in Discrete Mathematics and Theoretical Computer Science2003147
8On the computational power of DNA annealing and ligationDIMACS Series in Discrete Mathematics and Theoretical Computer Science1996126
9Universal computation via self-assembly of DNA: Some theory and experimentsDIMACS Series in Discrete Mathematics and Theoretical Computer Science1998122
10Genetic hybrids for the quadratic assignment problemDIMACS Series in Discrete Mathematics and Theoretical Computer Science1994120
11On maximum clique problems in very large graphsDIMACS Series in Discrete Mathematics and Theoretical Computer Science1999116
12A survey on combinatorial group testing algorithms with applications to DNA Library ScreeningDIMACS Series in Discrete Mathematics and Theoretical Computer Science2000115
13On constructing a molecular computerDIMACS Series in Discrete Mathematics and Theoretical Computer Science1996110
14A theoretician’s guide to the experimental analysis of algorithmsDIMACS Series in Discrete Mathematics and Theoretical Computer Science2002108
15Why is modal logic so robustly decidable?DIMACS Series in Discrete Mathematics and Theoretical Computer Science1997106
16Breaking DES using a molecular computerDIMACS Series in Discrete Mathematics and Theoretical Computer Science1996101
17The median procedure for partitionsDIMACS Series in Discrete Mathematics and Theoretical Computer Science199599
18New directions in testingDIMACS Series in Discrete Mathematics and Theoretical Computer Science199196
19A DNA and restriction enzyme implementation of Turing machinesDIMACS Series in Discrete Mathematics and Theoretical Computer Science199696
20Improved linear programming-based lower bounds for the quadratic assignment problemDIMACS Series in Discrete Mathematics and Theoretical Computer Science199494
21Good encodings for DNA-based solutions to combinatorial problemsDIMACS Series in Discrete Mathematics and Theoretical Computer Science199893
22Synopsis data structures for massive data setsDIMACS Series in Discrete Mathematics and Theoretical Computer Science199987
23Parameterized complexity: A framework for systematically confronting computational intractabilityDIMACS Series in Discrete Mathematics and Theoretical Computer Science199984
24A survey of out-of-core algorithms in numerical linear algebraDIMACS Series in Discrete Mathematics and Theoretical Computer Science199984
25DNA-based cryptographyDIMACS Series in Discrete Mathematics and Theoretical Computer Science200084
26Graph searching, path-width, tree-width and related problems (A survey)DIMACS Series in Discrete Mathematics and Theoretical Computer Science199183
27On nested depth first searchDIMACS Series in Discrete Mathematics and Theoretical Computer Science199782
28Finding hard instances of the satisfiability problem: A surveyDIMACS Series in Discrete Mathematics and Theoretical Computer Science199782
29On algorithms for simple stochastic gamesDIMACS Series in Discrete Mathematics and Theoretical Computer Science199379
30Permutation groups and polynomial-time computationDIMACS Series in Discrete Mathematics and Theoretical Computer Science199378
31Model checking and the mu-calculusDIMACS Series in Discrete Mathematics and Theoretical Computer Science199778
32Stretchability of pseudolines is NP-hardDIMACS Series in Discrete Mathematics and Theoretical Computer Science199175
33Exploring the k-colorable landscape with iterated greedyDIMACS Series in Discrete Mathematics and Theoretical Computer Science199675
34Graph entropy: A surveyDIMACS Series in Discrete Mathematics and Theoretical Computer Science199572
35Maximum cuts and large bipartite subgraphsDIMACS Series in Discrete Mathematics and Theoretical Computer Science199570
36Distributed coloration neighborhood searchDIMACS Series in Discrete Mathematics and Theoretical Computer Science199668
37Concerning the NJ algorithm and its unweighted version, UNJDIMACS Series in Discrete Mathematics and Theoretical Computer Science199767
38Combinatorial property testing (a survey)DIMACS Series in Discrete Mathematics and Theoretical Computer Science199867
39Generalized FFTs–A survey of some recent resultsDIMACS Series in Discrete Mathematics and Theoretical Computer Science199766
40Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiabilityDIMACS Series in Discrete Mathematics and Theoretical Computer Science199665
41Survey: Information flow on treesDIMACS Series in Discrete Mathematics and Theoretical Computer Science200460
42SAT versus UNSATDIMACS Series in Discrete Mathematics and Theoretical Computer Science199659
43Approximate solution of weighted MAX-SAT problems using GRASPDIMACS Series in Discrete Mathematics and Theoretical Computer Science199759
44Fast point-to-point shortest path computations with arc-flagsDIMACS Series in Discrete Mathematics and Theoretical Computer Science200958
45A continuous based heuristic for the maximum clique problemDIMACS Series in Discrete Mathematics and Theoretical Computer Science199656
46Reconciled trees and incongruent gene and species treesDIMACS Series in Discrete Mathematics and Theoretical Computer Science199756
47Depth functions in nonparametric multivariate inferenceDIMACS Series in Discrete Mathematics and Theoretical Computer Science200656
48Groups and expandersDIMACS Series in Discrete Mathematics and Theoretical Computer Science199355
49The server problem and on-line gamesDIMACS Series in Discrete Mathematics and Theoretical Computer Science199252
50GRAPE: a system for computing with graphs and groupsDIMACS Series in Discrete Mathematics and Theoretical Computer Science199351