معرفی
Kolja Knauer is a Professor at the Universitat de Barcelona, holding a dual role as Professor Agregat and Maître de conférences (on leave). He is affiliated with the Department of Mathematics and Computer Science, specializing in Combinatorics. His research focuses on structural combinatorics, matroid theory, graph theory, and discrete geometry, with notable contributions to oriented matroids, lattice path matroids, and geometric graphs.
He leads the MICINN project ACoGe (PID2022-137283NB-C22) on algebraic combinatorics and geometry, and participates in the ANR project DAGDigDec (ANR-21-CE48-0012) on digraph decompositions. Knauer is the Editor-in-chief of Annals of Combinatorics and a Section editor of Discrete Mathematics & Theoretical Computer Science.
His research interests span Cayley graphs, graph colorings, convex geometries, and computational geometry. Recent work includes studies on matroid polytopes, oriented matroid complexes, and combinatorial algorithms. He actively organizes events like the Combinatorial Geometries & Geometric Combinatorics program at CRM (2025) and the recurring Three Talks in Combinatorics seminar at UB.
Knauer advises PhD students including Gil Puig i Surroca and Manon Philibert. His work often intersects algebraic structures, geometric configurations, and combinatorial optimization. He collaborates internationally, with affiliations to the Institute of Mathematics of the University of Barcelona (IMUB) and the Catalan Institution for Research and Advanced Studies (CRM).
