Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

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

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

Kolla’s research interests include spectral graph theory, algorithms, complexity, convex programming, statistical physics and quantum computing. Kolla is particularly interested in the use of spectral ...

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...