Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

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 ...

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 ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...

UC Santa Barbara computer scientist Daniel Lokshtanov is advancing fundamental understanding of computational efficiency through groundbreaking research on quasi-polynomial time algorithms, supported ...

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 ...