معرفی
Paul Wollan is a Professor in the Department of Computer Science at the University of Rome "La Sapienza". He has been a faculty member at the university since completing his postdoctoral positions at the University of Waterloo (2006) and University of Hamburg (2007-2009). He earned his PhD in Algorithms, Combinatorics, and Optimization in 2005 from Georgia Tech under the supervision of Robin Thomas.
Wollan's research focuses on graph theory, combinatorial optimization, and structural graph theory. His work centers on developing structural techniques for labeled graphs, algorithmic applications of graph structure theory, and providing new proofs for results in graph minors. He has made significant contributions to the theory of graph minors, immersions, and connectivity in graphs. His research has applications in theoretical computer science, particularly in algorithm design and complexity.
His recent publications (2017-2024) demonstrate a consistent focus on structural graph theory, with particular emphasis on graph minors, immersions, connectivity, and applications to algorithmic problems. The work shows a progression toward simplifying complex structural results while extending the theoretical foundations of graph theory. Key themes include grid theorems, Erdős-Posá properties, chi-boundedness, and connectivity in both directed and undirected graphs.
- ERC Starting Grant (2011-2017) for Project DASTCO (Developing and Applying Structural Techniques for Combinatorial Objects)
- Alexander von Humboldt Foundation Research Fellowship (2007-2009)
Wollan has advised several PhD students including Irene Muzi, Katherine Edwards, and Gregory Gauthier. He led Project DASTCO, which developed new structural tools and techniques for graphs and other combinatorial objects through the study of labeled graphs. The project sought to increase understanding of classic results in graph theory while developing a broader structural theory of labeled graphs. He is also involved with the Bertinoro Workshop on Algorithms and Graphs, which will be held again in October 2025 after a long hiatus.
