Also found in: Wikipedia.
DIMACSCenter for Discrete Mathematics and Theoretical Computer Science (Rutgers University; New Jersey)
References in periodicals archive ?
These DIMACS modules enable us to blaze that trail with confidence, to broaden our comfort zone even as we step beyond it.
Second DIMACS Implementation Challenge: Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
Koetter, "Online incremental network coding for multiple unicasts," in DIMACS WG on Network Coding, Piscataway, January, 2005.
Cohen, (1993) Local Search Strategies for Satisability Testing, Proceedings of 2nd DIMACS Challenge Workshop on Cliques, Color-ing, and Satisability, Rutgers University, pp.
universities, and some of the papers were presented at a June 2006 DIMACS workshop held at Rutgers University.
In Proceedings of the 6th DIMACS Implementation Challenge: Near neighbour searches (ALENEX 1999), January 1999.
Online Algorithms, DIMACS Series in Discrete Mathematics and Computer Science 7, 79-83.
Presented at the DIMACS workshop on Evolution as Computation (Princeton, N.
In Computational Geometry: Papers from the DIMACS Special Year, J.
DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.
Formal power series and algebraic combinatorics (New Brunswick, NJ, 1994), 1-23, DIMACS Ser.
In Proceedings of the DIMACS Partial Order Methods Workshop IV, Princeton University, July, 1996.