Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

Property testing in graph theory concerns the design of sublinear‐time algorithms that, given query access to a large graph, swiftly distinguish between the case where the graph satisfies a global ...

Graph sparsification refers to the process of approximating a dense graph by a much sparser one while retaining key structural and spectral properties. In the context of linear systems, and in ...

Crystal structures have a decisive impact on the properties of materials, and research on crystal structures often serves as a starting point for material studies. Crystal structure prediction is a ...

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

Like many of us, [Tim]’s seen online videos of circuit sculptures containing illuminated LED filaments. Unlike most of us, however, he went a step further by using graph theory to design glowing ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...

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