Source

DIMACS series in discrete mathematics and theoretical computer science

ISSNs: 1052-1798, 2472-4793

Source type: book series

Alternate name: Series in discrete mathematics and theoretical computer science

Fully OA: No

DOAJ: No

OpenAlex ID: S4210177973

The Random Projection Method

2005 · Santosh Vempala · DIMACS series in discrete mathematics and theoretical computer science · 543

Local search strategies for satisfiability testing

1996 · Bart Selman, Henry Kautz, et al. · DIMACS series in discrete mathematics and theoretical computer science · 516

Cliques, Coloring, and Satisfiability

1996 · Johnson, David, Trick, Michael · DIMACS series in discrete mathematics and theoretical computer science · 479

Computing on data streams

1999 · Monika Henzinger, Prabhakar Raghavan, et al. · DIMACS series in discrete mathematics and theoretical computer science · 424

Minimizing polynomial functions

2003 · Pablo Parrilo, Bernd Sturmfels · DIMACS series in discrete mathematics and theoretical computer science · 309

PDF

The quadratic assignment problem: A survey and recent developments

1994 · Panos Pardalos, Franz Rendl, et al. · DIMACS series in discrete mathematics and theoretical computer science · 296

A classification of consensus methods for phylogenetics

2003 · David Bryant · DIMACS series in discrete mathematics and theoretical computer science · 288

Algorithms for the satisfiability (SAT) problem: A survey

1997 · Jun Gu, Paul Purdom, et al. · DIMACS series in discrete mathematics and theoretical computer science · 287

A theoretician’s guide to the experimental analysis of algorithms

2002 · David Johnson · DIMACS series in discrete mathematics and theoretical computer science · 269

New directions in testing

1991 · Richard Lipton · DIMACS series in discrete mathematics and theoretical computer science · 263

Why is modal logic so robustly decidable?

1997 · Moshe Vardi · DIMACS series in discrete mathematics and theoretical computer science · 250

A greedy randomized adaptive search procedure for the quadratic assignment problem

1994 · Yong Li, Panos Pardalos, et al. · DIMACS series in discrete mathematics and theoretical computer science · 239

Genetic hybrids for the quadratic assignment problem

1994 · Charles Fleurent, Jacques Ferland · DIMACS series in discrete mathematics and theoretical computer science · 229

Breaking DES using a molecular computer

1996 · Dan Boneh, Christopher Dunworth, et al. · DIMACS series in discrete mathematics and theoretical computer science · 225

On maximum clique problems in very large graphs

1999 · J. Abello, Panos Pardalos, et al. · DIMACS series in discrete mathematics and theoretical computer science · 223

Universal computation via self-assembly of DNA: Some theory and experiments

1998 · Erik Winfree, Xiaoping Yang, et al. · DIMACS series in discrete mathematics and theoretical computer science · 222

Quadratic Assignment and Related Problems

1994 · Pardalos, Panos, Wolkowicz, Henry · DIMACS series in discrete mathematics and theoretical computer science · 222

Finding hard instances of the satisfiability problem: A survey

1997 · Stephen Cook, David Mitchell · DIMACS series in discrete mathematics and theoretical computer science · 220

On the computational power of DNA annealing and ligation

1996 · Erik Winfree · DIMACS series in discrete mathematics and theoretical computer science · 197

Polyhedral Combinatorics

1991 · Cook, William, Seymour, P · DIMACS series in discrete mathematics and theoretical computer science · 195

PDF

On constructing a molecular computer

1996 · Leonard Adleman · DIMACS series in discrete mathematics and theoretical computer science · 193

Parameterized complexity: A framework for systematically confronting computational intractability

1999 · Rodney Downey, Michael Fellows, et al. · DIMACS series in discrete mathematics and theoretical computer science · 191

Synopsis data structures for massive data sets

1999 · Phillip Gibbons, Yossi Matias · DIMACS series in discrete mathematics and theoretical computer science · 190

On nested depth first search

1997 · Gerard Holzmann, Doron Peled, et al. · DIMACS series in discrete mathematics and theoretical computer science · 189

A survey on combinatorial group testing algorithms with applications to DNA Library Screening

2000 · Hung Ngo, Ding-Zhu Du · DIMACS series in discrete mathematics and theoretical computer science · 187

Works count: 1,373

Citation count: 29,370

H-index: 79

I10-index: 586

2yr mean citedness: