Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

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

Abstract. Let 𝐼(𝐺;𝑥) denote the independence polynomial of a graph 𝐺. In this paper we study the unimodality properties of 𝐼(𝐺;𝑥) for some composite graphs 𝐺. Given two graphs 𝐺₁ and 𝐺₂, let ...

Proceedings of the National Academy of Sciences of the United States of America PNAS is the world's most-cited multidisciplinary scientific serial. It publishes high-impact research reports, ...