[June 2013]  Fred Roberts Awarded Honorary Doctorate at University of Paris-Dauphine
On June 27, 2013, Fred S. Roberts, Director Emeritus of DIMACS and Director of the Command, Control and Interoperability Center for Advanced Data Analysis (CCICADA), was awarded the title and insignia of Honorary Doctor or ‘Docteur Honoris Causa’ at the University of Paris-Dauphine.  >>

[May 2013] Mathematical Mayhem: A DIMACS Detective Tale
Associate Director Gene Fiorini's honors seminar in mathematical forensics ended with a CSI-style final exam staged at DIMACS. >>

[May, 2013] Multi-disciplinary Modules for High School Classes
Integrating multi-disciplinary research with education is a recurring theme at DIMACS and one that is exemplified by three DIMACS education projects highlighted in an article in the May 2013 issue of International Innovation magazine. >>

[December, 2011] VCTAL Project Member Selected CADRE Fellow
VCTAL project evaluator Andrea Weinberg (pictured) was one of 10 early-career researchers selected to be a 2011-2012 CADRE (Community Advancing Discovery Research in Education) Fellow. >>

[October, 2012] Discrepancy of Three Permutations
DIMACS researcher Alantha Newman and graduate student Aleksandar Nikolov discovered a counterexample to a long-standing a conjecture by Jozsef Beck (Rutgers) on the discrepancy of a set system arising from three permutations on the integers 1 through n. Given a set system (i.e., m sets on n elements where m is O(n)), the problem is to assign each element a value of 1 or -1 so as to minimize the maximum over all sets of the absolute value of the sum of the values assigned to its elements. This minimum is the discrepancy.   >>

[May, 2012] Mantel’s Theorem for Random Graphs
Rutgers graduate student Bobby DeMarco and his advisor Jeffry Kahn (pictured) have determined when the size of the largest triangle-free subgraph and the largest bipartite subgraph of a random graph are likely to be equal. This is the “random graph version” of a classic (1907) result by Mantel showing that the sizes are equal in a complete graph.  >>

DIMACS Home Page