معرفی
Andrea Munaro is an Assistant Professor at the Department of Mathematical, Physical and Computer Sciences, University of Parma. He holds a PhD from G-SCOP Laboratory, Univ. Grenoble Alpes, supervised by András Sebő and Matěj Stehlík. His academic journey includes postdoctoral positions at institutions such as Ulm, Koper, Fribourg, Morgantown, and Belfast.
Research Interests: Andrea specializes in Graph Theory and Theoretical Computer Science, focusing on width parameters like mim-width, sim-width, and tree-independence number. His work addresses algorithmic applications on graph classes (e.g., H-free, Pt-free), tackling problems such as coloring, independent packing, and domination. He explores structural properties and computational complexity of graphs with respect to k-connected subgraphs and Gallai families.
Scientific Contributions: His recent publications (2025–2021) include studies on width parameters, graph algorithms, and approximation schemes for problems in K4-free, H-free, and Pt-free graphs. His research spans algorithmic graph theory, structural graph theory, and computational complexity, with applications in contact graphs, path representations, and fixed-parameter tractability.
Students: He has advised Shizhou Yang (2021–2024) at Queen's University Belfast.
Teaching: Andrea teaches Algorithms and Data Structures and Programming courses at the University of Parma, previously holding appointments at Queen's University Belfast and West Virginia University. He organized conferences like GWP 2025 and served on program committees for WG 2023.
