Live briefing
Everything about DIMACS
Center for Discrete Mathematics and Theoretical Computer Science at Rutgers University
The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is a collaboration between Rutgers University, Princeton University, and the research firms AT&T, Bell Labs, Applied Communication Sciences, and NEC. It was founded in 1989 with money from the National Science Foundation. Its offices are located on the Rutgers campus, and 250 members from the six institutions form its permanent members. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: DIMACSA 5-minute orientation
- Skim a recent paper: A dataset of DIMACS formulas derived from Kconfig models for research on highly configurable softwareInfluential work since 2022
- Pick up a classic book: Evolution as computationThe most-reprinted book on the subject
- Read the landmark paper: From the ground up: the DIMACS software security workshopCited 43 times
- Go sideways: Algorithm engineeringA closely related topic
- Go sideways: Fred S. RobertsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
From the ground up: the DIMACS software security workshop
New evolutionary operators in coloring DIMACS challenge benchmark graphs
Comments on "The 1993 DIMACS graph coloring Challenge" and "Energy function-based approaches to graph Coloring"
Report of the DIMACS working group on abstractions for network services, architecture, and implementation
Analysis of the Malatya Centrality-Based Clique Method on DIMACS Benchmarks and Random Graphs
New hybrid decentralized evolutionary approach for DIMACS challenge graph coloring & wireless network instances
Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances
Testing a Heuristic Algorithm for Finding a Maximum Clique on DIMACS and Facebook Graphs
🆕 Influential since 2022
📚 Books worth reading
Evolution as computationLaura F. Landweber, Erik Winfree · 2000
Multichannel optical networksPeng-Jun Wan · 1998
On-line algorithmsAmerican Mathem American Mathem · 1992
Computer-aided verification '90CAV (Conference) (2nd 1990 Center for Discrete Mathematics and Theoretical Computer Science) · 1991
Distributed computing and cryptographyDIMACS Workshop in Distributed Computing and Cryptography (1989 Princeton, N.J.) · 1991
Data structures, near neighbor searches, and methodologyMichael H Goldwasser, David S. Johnson · 2002
Reliability of computer and communication networksDIMACS Workshop on Reliability of Computer and Communication Networks (1989 Rutgers University) · 1991
Video miningDIMACS Workshop on Video Mining (2002 Rutgers University) · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Algorithm engineering Algorithm engineering focuses on the design, analysis, implementation, optimization, profiling and experimental evaluation of computer algorithms, bridging…
- Fred S. Roberts Fred Stephen Roberts (born June 19, 1943) is an American mathematician, a professor of mathematics at Rutgers University, and a former director of DIMACS…
- Andrew V. Goldberg Andrew Vladislav Goldberg (born 1960) is an American computer scientist and operations researcher. He is known for algorithms on graphs and networks, including…
- Clique problem In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete…
- Dan Gusfield Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at University of California, Davis. Gusfield is known…
- Discrete mathematics Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a one-to-one…
- William O. Baker Award for Initiatives in Research The William O. Baker Award for Initiatives in Research, previously the NAS Award for Initiatives in Research, is awarded annually by the National Academy…
- Theoretical computer science Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation…