Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

The game of chess has long been central to computer science and AI-related research, most notably in IBM’s Deep Blue in the 1990s and, more recently, AlphaZero. But the game is about more than ...

Graph algorithms and spanners have emerged as a critical area of research in computer science, underpinning both theoretical advances and practical applications such as network design, routing ...

A Rutgers professor who studies and improves the design of algorithms – human-made instructions computers follow to solve problems and perform computations – has been selected to receive a 2024 Sloan ...